Flajolet, Philippe - INRIA Paris-Rocquencourt

• A Hybrid of Darboux's Method and Singularity Analysis
• The Annals of Probability 2005, Vol. 33, No. 3, 12001233
• ISOMORPHISM AND SYMMETRIES IN RANDOM PHYLOGENETIC TREES
• Algorithmica (1998) 22: 490515 Algorithmica
• Theoretical Computer Science 49 (1987) 283-309 North-Holland
• Non Overlapping Partitions, Continued Fractions,
• 1 -7 july 2001, Tatihou Island Algebraic Analytic Asymptotics
• Hidden Pattern Statistics Philippe Flajolet
• Digital Trees and Memoryless Sources: from Arithmetics to Analysis
• Analytic Combinatorics--A Calculus of Discrete Structures
• THE AVERAGE CASE ANALYSIS OF ALGORITHMS
• de r eche r che INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE
• Hachage, arbres, chemins & graphes Philippe Chassaing 1 et Philippe Flajolet 2
• RANDOM MAPPING STATISTICS Philippe Flajolet
• Discrete Mathematics 41 (198Z!) 145-153 North-Holland Publishing Company
• ANALYTIC COMBINATORICS SYMBOLIC COMBINATORICS
• Discrete Mathematics 114 (1993) 159-180 North-Holland
• Airy Phenomena and Analytic Combinatorics of Connected Graphs
• ANALYTIC URNS PHILIPPE FLAJOLET, JOAQUIM GABARR
• EVALUATION DE PROTOCOLES DE COMMUNICATION: ASPECTS MATH '
• de r eche r che INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET AUTOMATIQUE
• ON ADAPTIVE SAMPLING Philippe Flajolet
• THE SIGSAM CHALLENGES: SYMBOLIC ASYMPTOTICS IN PRACTICE
• DYNAMIC DATA STRUCTURES FINITE FILES, LIMITING PROFILES AND VARIANCE L. CNEND1, P. FLAJOLET2, J. FRANcDN3, C. PUECH4, J. VUILLEMIN5
• SIAM J. COMPUT. Vol. 15, No. 3, August 1986
• Airy Phenomena and Analytic Combinatorics of Connected Graphs
• AverageCase Analysis of Algorithms and Data Structures
• de r eche r che INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE
• GAUSSIAN LIMITING DISTRIBUTIONS FOR THE NUMBER OF COMPONENTS IN COMBINATORIAL STRUCTURES
• de r eche r che INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE
• Zeta Function Expansions of Classical Constants
• Publication List Philippe Flajolet
• THE ENUMERATION OF PRUDENT POLYGONS BY AREA AND ITS UNUSUAL ASYMPTOTICS
• THE DISTRIBUTION OF HEIGHT AND DIAMETER IN RANDOM NON-PLANE BINARY TREES
• Analytic Combinatorics of the Mabinogion Urn Philippe Flajolet1
• 2007 Conference on Analysis of Algorithms, AofA 07 DMTCS proc. AH, 2007, 127146 HyperLogLog: the analysis of a near-optimal
• Boltzmann Sampling of Unlabelled Structures Philippe Flajolet Eric Fusy
• Fourth Colloquium on Mathematics and Computer Science DMTCS proc. AG, 2006, 59118 Some exactly solvable models
• THE UBIQUITOUS DIGITAL TREE PHILIPPE FLAJOLET
• THE SCIENTIFIC WORKS OF RAINER KEMP (19492004) PHILIPPE FLAJOLET, MARKUS NEBEL, AND HELMUT PRODINGER
• Fast Computation of Special Resultants Alin Bostan a
• ON THE NON-HOLONOMIC CHARACTER OF LOGARITHMS, POWERS, AND THE nTH PRIME FUNCTION
• Counting by Coin Tossings Philippe Flajolet
• ANALYTIC COMBINATORICS COMPLEX ASYMPTOTICS
• Loglog Counting of Large Cardinalities (Extended Abstract)
• ISSN0249-6399 de recherche
• ISSN0249-6399 de recherche
• The complete analysis of a polynomial factorization algorithm
• An Analytic Approach to Smooth Polynomials over Finite Fields
• ISSN0249-6399 de recherche
• ISSN0249-6399 de recherche
• The Analysis of Hybrid Trie Structures* Julien Clkment'-2 Philippe Flajolet' Brigitte Vallke2
• 05/27/2006 02:06 PMSpringer Online Reference Works Page 1 of 2http://eom.springer.de/A/a110330.htm
• ~y~ergeometricsand the Cost Structure of Quadtrees
• Theoretical ELSEVIER Theoretical Computer Science 144 (1995) 3-58
• Corrigenda to "Mellin Transforms and Asymptotics: Harmonic Sums",
• COMPUTATIONAL AND APPLIED MATHEMATICS
• ss A. Lny,, Vevo2,s.soil. CAA4ssok AJD\ludtrt , cA,149),,, ciA41/4-A/Dfri-61104\-2
• Discrete Cornput Georn 12: 151-175 (1994) Geometr 1994 Springer-Verlag New York Inc. Y
• Algorithmica (1993) 10:473-500 -Algorithmica
• Discrete Applied Mathematics 39 (1992) 207-223 North-Holland
• SIAM J. DISC. MATH. Vol. 3, No. 2, pp. 216-240, May 1990
• J. Combinatorics (1990) 11,421-432EurOP. pJon-overlappingPartitions, Continued Fractions, Bessel Functions
• Europ. J. Combinatorics (1989) 10, 235-241 Elliptic Functions, Continued Fractions and Doubled Permutations
• prubab. Th. Re!. Fields 80, 139-150 (1988) Probabilitvd Theory%fated Fields
• MATHEFATICAL METHODS IN THE ANALYSIS OF ALGORITHMS AND DATA STRUCTURES
• Discrete Mathematics 65 (1987) 149-156 North-Holland
• Partial Match Retrieval of Multidimensional Data PHILIPPE FLAJOLET
• JOURNAL OF COMPUTER AND SYSTEM SCIENCES 31, 182-209 (1985) Probabitistic Counting Algorithms
• BIT 25 (1985). 113-134 APPROXIMATE COUNTING: A DETAILED ANALYSIS,
• Annals of Discrete Mathematics 25 (1985) 145-188 0 Elsevier Science Publishers B.V. (North-Holland) 145
• Math. Proc. Camb. Phil. Soc. (1984), 96,
• , O c ~ ~ p \ LOF COMPUTER AND SYSTEM SCIENCES 25, 171-213 (1982) The Average Height of Binary Trees
• A RECURSIVE PARTIONNING PROCESS OF COMPUTER SCIENCE
• Discrete Mathematics 32 (1980) 125-161 @ North-Holland Publishing Company
• From the Discrete to the Continuous,
• Toulouse, May 30, 2008 SUR LA SOMME D'UNE PROGRESSION
• Combinatorics Philippe Flajolet
• Errata et corrigenda ANALYTIC COMBINATORICS
• A concordance between OEIS and AC Here is a concordance of sequences from the On-line Encyclopedia of Integer Sequences
• Multidimensional Divide-and-Conquer and Weighted Digital Sums
• COMBINATORIAL MODELS OF CREATIONANNIHILATION PAWEL BLASIAK AND PHILIPPE FLAJOLET
• de r eche r che INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE
• de r eche r che INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE
• LOGLOG COUNTING OF LARGE CARDINALITIES MARIANNE DURAND AND PHILIPPE FLAJOLET
• BASIC ANALYTIC COMBINATORICS OF DIRECTED LATTICE PATHS
• de r eche r che INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE
• RANDOM MAPS, COALESCING SADDLES, SINGULARITY ANALYSIS, AND AIRY PHENOMENA
• POLYA FESTOONS PHILIPPE FLAJOLET
• de r eche r che INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE
• NIT E DE RECHERCHE RIA-ROCQUENCOURT
• Average-Case Analysis of Algorithms and Data Structures
• Combinatorics, Probability and Computing (2004) 13, 577625. c 2004 Cambridge University Press DOI: 10.1017/S0963548304006315 Printed in the United Kingdom
• PSEUDO-FACTORIALS, ELLIPTIC FUNCTIONS, AND CONTINUED FRACTIONS
• Generating functions for generating trees
• Singularity Analysis, Hadamard Products,
• Analytic Analysis of Algorithms Philippe Flajolet \Lambda
• Some Airy Phenomena of Analytic Combinatorics
• ISSN0249-6399 de recherche
• de r eche r che INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET AUTOMATIQUE
• de r eche r che INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE
• Lindelof Representations and (Non-)Holonomic Philippe Flajolet
• DOI: 10.1007/s00453-001-0056-0 Algorithmica (2001) 31: 361377
• THE CYCLE CONSTRUCTION Philippe Flajolet and Mich` ele Soriay
• Torino, Oct. 1998 ANALYTIC COMBINATORICS
• IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 11, NOVEMBER 2002 2911 Analytic Variations on Redundancy Rates of Renewal
• de recherche INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE
• Euler Sums and Contour Integral Representations Philippe Flajolet and Bruno Salvy
• JOURNAL OF ALGOIUTHMS 1, 111-141 (1980) Sequence of Operations Analysis for Dynamic
• Theoretical Computer Science 123 (1994) 291-314 Mellin transforms and asymptotics
• de r eche r che INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET AUTOMATIQUE
• de r eche r che INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE
• ICM 2002 Vol. III 1{3 Singular Combinatorics
• de r eche r che INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE
• THE AIRY DISTRIBUTION IN ANALYTIC COMBINATORICS
• Counting by Coin Tossings Philippe Flajolet
• ANALYTIC MODELS FOR TREE COMMUNICATION PROTOCOLS
• The complete analysis of a polynomial factorization algorithm
• Metsovo, June 1999 Analytic Aspects
• Computing 34,391-400 (1990) 0by Springer-Verlag I990
• INFORMATION SCIENCES 38,121-146 (1986) 121 The Analysis of Simple List Structures
• Acta Informatica 31, 673-696 (1994) 0 Springer-Verlag 1994
• THE UBIQUITOUS GAUSSIAN LAW IN ANALYTIC COMBINATORICS
• Hidden Pattern Statistics Philippe Flajolet 1 , Yves Guivarc'h 2 ,
• Extended Abstract submitted to ICALP'2000 (Track A); Version of January 21, 2000 PLANAR MAPS AND AIRY PHENOMENA
• ALP, January 2002 Digital Trees and
• Generalized Digital Trees and Their Difference-Differential Equations
• A concordance between OEIS and AC Here is a concordance of sequences from the On-line Encyclopedia of Integer Sequences
• THE EVOLUTION OF TWO STACKS IN BOUNDED SPACE RANDOM WA!.KS IN A TRIANGLE
• PERFORMANCE '87 P.4. Counois and C. Larouche (editors)
• arXiv:math/0611332v2[math.CA]11Jul2007 ON DIFFERENCES OF ZETA VALUES
• Continued Fractions, Comparison Algorithms, and Fine Structure Constants
• de r eche r che INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET AUTOMATIQUE
• de r eche r che INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE
• de r eche r che INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE
• ANALYTIC COMBINATORICS SYMBOLIC COMBINATORICS
• HACHAGE, ARBRES, CHEMINS & GRAPHES PHILIPPE CHASSAING ET PHILIPPE FLAJOLET
• ANALYTIC COMBINATORICS COMPLEX ASYMPTOTICS
• de r eche r che INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET AUTOMATIQUE
• Theoretical ComputerScience
• THE ENUMERATION OF PRUDENT POLYGONS BY AREA AND ITS UNUSUAL ASYMPTOTICS
• Theoretical Computer Science 49 (1987) 283-309 283 North-Holland
• RANDOM SYSTEMS IN COMBINATORICS Philippe Flajolet
• de r eche r che INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE
• ON THE ANALYSIS OF LINEAR PROBING HASHING
• Random Triangulations (Extended Abstract) 3 Luc Devroye
• KnuthFest, January 2002 From Caltech to Page 131
• Fifth Colloquium on Mathematics and Computer Science DMTCS proc. AI, 2008, 121134 The height of random binary unlabelled trees
• BIT32 (1992), 384-402, PAGE USAGE IN A QUADTREE INDEX
• Asymptotique des rcurrences mahlriennes : le cas cyclotomique
• ANALYTIC VARIATIONS ON THE COMMON SUBEXPRESSION PROBLEM
• Adv. Appl. Prob. 18, 441-472 (1986) Printed in N. Ireland
• ON BUFFON MACHINES AND NUMBERS PHILIPPE FLAJOLET, MARYSE PELLETIER, AND MICH`ELE SORIA
• ISSN0249-6399ISRNINRIA/RR--3914--FR+ENG de recherche
• On Buffon Machines and Numbers Philippe Flajolet
• CHEMINS GRAPHES CHASSAIN PHILIPPE FLAJOLET
• VARIETIES OF INCREASING Francois Bergeron
• Theoretical Computer Science 287 (2002) 515534 www.elsevier.com/locate/tcs
• THE AVERAGE CASE ANALYSIS OF ALGORITHMS
• Journ ees ASTI, Cit e des Sciences, Paris Informatique et Math ematiques