Philippe J. Flajolet

Philippe J. Flajolet's AcademicInfluence.com Rankings

Computer Science

#4381

World Rank

#4614

Historical Rank

computer-science Degrees

Philippe J. Flajolet

Mathematics

#5577

World Rank

#7838

Historical Rank

Combinatorics

#67

World Rank

#74

Historical Rank

Measure Theory

#809

World Rank

#1072

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Philippe J. Flajolet's Degrees

PhD Computer Science Université Paris Cité
Masters Mathematics Université Paris Cité

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2025

Why Is Philippe J. Flajolet Influential?

(Suggest an Edit or Addition)

(See a Problem?)

Philippe J. Flajolet's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Analytic Combinatorics (2009) (3293)
Probabilistic Counting Algorithms for Data Base Applications (1985) (1320)
Singularity Analysis of Generating Functions (1990) (900)
An introduction to the analysis of algorithms (1995) (796)
Analytic Combinatorics: RANDOM STRUCTURES (2009) (790)
HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm (2007) (626)
Mellin Transforms and Asymptotics: Harmonic Sums (1995) (560)
Combinatorial aspects of continued fractions (1980) (508)
Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search (1992) (424)
On adaptive sampling (1990) (340)
Boltzmann Samplers for the Random Generation of Combinatorial Structures (2004) (328)
A Calculus for the Random Generation of Labelled Combinatorial Structures (1994) (327)
Random Mapping Statistics (1990) (322)
Euler Sums and Contour Integral Representations (1998) (288)
The Average Height of Binary Trees and Other Simple Trees (1982) (286)
Generating functions for generating trees (2002) (266)
Loglog counting of large cardinalities (2003) (263)
Mellin Transforms and Asymptotics: Finite Differences and Rice's Integrals (1995) (244)
Basic analytic combinatorics of directed lattice paths (2002) (243)
Varieties of Increasing Trees (1992) (229)
Q -ary collision resolution algorithms in random-access systems with free or blocked channel access (1985) (210)
Average-Case Analysis of Algorithms and Data Structures (1991) (198)
Analytic combinatorics of non-crossing configurations (1999) (198)
Analytic Models and Ambiguity of Context-Free Languages (1987) (184)
On approximate counting (1982) (180)
Approximate counting: A detailed analysis (1985) (172)
Probabilistic counting (1983) (170)
Random maps, coalescing saddles, singularity analysis, and Airy phenomena (2001) (151)
Digital Search Trees Revisited (1986) (146)
On the Analysis of Linear Probing Hashing (1998) (145)
Mellin Transforms and Asymptotics: Digital Sums (1994) (143)
Automatic Average-Case Analysis of Algorithm (1991) (136)
Partial match retrieval of multidimensional data (1986) (135)
Gaussian limiting distributions for the number of components in combinatorial structures (1990) (133)
Some exactly solvable models of urn process theory (2006) (127)
Loglog Counting of Large Cardinalities (Extended Abstract) (2003) (119)
The first cycles in an evolving graph (1989) (119)
Analysis of a stack algorithm for random multiple-access communication (1985) (109)
The Number of Registers Required for Evaluating Arithmetic Expressions (1979) (107)
Estimating the multiplicities of conflicts to speed their resolution in multiple access channels (1987) (104)
Dynamical sources in information theory: A general analysis of trie structures (2001) (102)
Singularity Analysis and Asymptotics of Bernoulli Sums (1999) (98)
On Ramanujan's Q-function (1995) (96)
Analytic urns (2004) (95)
Analytic Variations on the Common Subexpression Problem (1990) (93)
Analysis of algorithms (2000) (83)
Singularity analysis, Hadamard products, and tree recurrences (2003) (80)
Analytic Variations on the Airy Distribution (2001) (80)
Patterns in random binary search trees (1997) (77)
On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel (1986) (77)
Patterns and Pattern-Matching in Trees: An Analysis (1984) (75)
General combinatorial schemas: Gaussian limit distributions and exponential tails (1993) (75)
Boltzmann Sampling of Unlabelled Structures (2006) (74)
An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction (1997) (71)
The formal theory of birth-and-death processes, lattice path combinatorics and continued fractions (2000) (71)
Sequence of Operations Analysis for Dynamic Data Structures (1980) (70)
Hypergeometrics and the Cost Structure of Quadtrees (1995) (68)
Analytic combinatorics : functional equations, rational and algebraic functions (2001) (65)
Continued Fraction Algorithms, Functional Operators, and Structure Constants (1998) (63)
A Note on Gray Code and Odd-Even Merge (1980) (63)
Generalized Digital Trees and Their Difference-Differential Equations (1992) (62)
On the Non-Holonomic Character of Logarithms, Powers, and the nth Prime Function (2005) (60)
Fast computation of special resultants (2006) (59)
Mellin transforms and asymptotics (1994) (58)
Level number sequences for trees (1987) (57)
The analysis of hybrid trie structures (1998) (56)
On congruences and continued fractions for some classical combinatorial quantities (1982) (56)
On the performance evaluation of extendible hashing and trie searching (1983) (56)
COMBINATORIAL MODELS OF CREATION{ANNIHILATION (2010) (56)
Analytic Combinatorics of Chord Diagrams (2000) (55)
Some Uses of the Mellin Integral Transform in the Analysis of Algorithms (1985) (52)
The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields (2001) (51)
The Distribution of Heights of Binary Trees and Other Simple Trees (1993) (49)
Register Allocation for Unary-Binary Trees (1986) (48)
And/Or Trees Revisited (2004) (47)
Analytic variations on quadtrees (1993) (47)
Hidden word statistics (2006) (45)
THE FERMAT CUBIC, ELLIPTIC FUNCTIONS, CONTINUED FRACTIONS, AND A COMBINATORIAL EXCURSION (2005) (45)
Non-overlapping Partitions, Continued Fractions, Bessel Functions and a Divergent Series (1990) (44)
Digital Trees and Memoryless Sources: from Arithmetics to Analysis (2010) (43)
Isomorphism and Symmetries in Random Phylogenetic Trees (2009) (43)
An Analytic Approach to Smooth Polynominals over Finite Fields (1998) (42)
The Number of Symbol Comparisons in QuickSort and QuickSelect (2009) (41)
Airy Phenomena and Analytic Combinatorics of Connected Graphs (2004) (41)
Analytic Analysis of Algorithms (1992) (41)
Lambda-Upsilon-Omega the 1989 cookbook (1989) (40)
A Branching Process Arising in Dynamic Hashing, Trie Searching and Polynomial Factorization (1982) (40)
The Average case analysis of algorithms : counting and generating functions (1993) (39)
ANALYTIC COMBINATORICS — SYMBOLIC COMBINATORICS (2002) (38)
The Evolution of Two Stacks in Bounded Space and Random Walks in a Triangle (1996) (38)
Search costs in quadtrees and singularity perturbation asymptotics (1994) (37)
Continued Fractions, Comparison Algorithms, and Fine Structure Constants (2000) (37)
Deviations from uniformity in random strings (1988) (36)
Algebraic Methods for Trie Statistics (1985) (35)
Counting by Coin Tossings (2004) (35)
A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics (2006) (34)
Computer Algebra Libraries for Combinatorial Structures (1995) (34)
A Calculus for the random generation of combinatorial structures (1993) (34)
The Average case analysis of algorithms : complex asymptotics and generating functions (1993) (33)
Lambda - Upsilon - Omega: An Assistant Algorithms Analyzer (1988) (33)
On Sets Having Only Hard Subsets (1974) (33)
The Maximum of a Random Walk and Its Application to Rectangle Packing (1997) (32)
Properties of Random Triangulations and Trees (1999) (32)
Boltzmann Sampling of Unlabeled Structures (2007) (31)
Limit distributions for coefficients of iterates of polynomials with applications to combinatorial enumerations (1984) (30)
On Buffon machines and numbers (2009) (30)
Analytic variations on redundancy rates of renewal processes (2002) (30)
The Average Case Analysis Of Algorithms (1993) (30)
Page usage in a quadtree index (1992) (29)
The analysis of simple list structures (1986) (29)
Ambiguity and Transcendence (1985) (28)
The Complexity of Generating an Exponentially Distributed Variate (1983) (28)
Tree structures for partial match retrieval (1983) (27)
The Average Case Analysis of Algorithms : Multivariate Asymptotics and Limit Distributions (1997) (27)
Analytic variations on bucket selection and sorting (2000) (26)
The average case analysis of algorithms : Saddle Point Asymptotics (1994) (25)
Random Sampling from Boltzmann Principles (2002) (24)
The analysis of multidimensional searching in quad-trees (1991) (24)
Planar Maps and Airy Phenomena (2000) (24)
Mathematics and Computer Science Iii: "Algorithms, Trees, Combinatorics And Probabilities" (2004) (23)
Prefixes of Infinite Words and Ambiguous Context-Free Languages (1987) (23)
The distribution of height and diameter in random non‐plane binary trees (2010) (23)
Exploring binary trees and other simple trees (1980) (23)
The Cycle Construction (1991) (23)
On differences of zeta values (2006) (23)
The Ubiquitous Digital Tree (2006) (23)
On the analysis of tree-matching algorithms (1980) (21)
Elliptic Functions, Continued Fractions and Doubled Permutations (1989) (21)
On Stirling Numbers for Complex Arguments and Hankel Contours (1999) (21)
Analysis of KDT-Trees: KD-Trees Improved by Local Reogranisations (1989) (20)
Lindelöf Representations and (Non-)Holonomic Sequences (2009) (19)
Exact Asymptotics of Divide-and-Conquer Recurrences (1993) (18)
Hidden Pattern Statistics (2001) (18)
Random Polynomials and Polynomial Factorization (1996) (18)
An analysis of the Gaussian algorithm for lattice reduction (1994) (18)
Mathematics and Computer Science II (2002) (17)
Pseudo-factorials, elliptic functions, and continued fractions (2009) (17)
Continued fractions from Euclid to the present day (2000) (17)
Elements of a general theory of combinatorial structures (1985) (16)
Random Tree Models in the Analysis of Algorithms (1987) (16)
The Average Case Analysis of Algorithms: Mellin Transform Asymptotics (1996) (16)
Analytic Combinatorics of the Mabinogion Urn (2008) (16)
Fast Computation (2007) (15)
The lattice reduction algorithm of Gauss: an average case analysis (1990) (14)
ANALYTIC METHODS (2014) (14)
The height of random binary unlabelled trees (2008) (14)
A complexity calculus for classes of recursive search programs over tree structures (1981) (14)
A complexity calculus for recursive tree algorithms (1986) (13)
Analytic Models for Tree Communication Protocols (1987) (12)
AN INTRODUCTION TO THE ANALYSIS OF ALGORITHMS Second Edition (2012) (12)
MATHEFATICAL METHODS IN THE ANALYSIS OF ALGORITHMS AND DATA STRUCTURES (1985) (11)
Introduction à l'analyse des algorithmes (1996) (10)
On the average number of registers required for evaluating arithmetic expressions (1977) (10)
Decision Problems for Multihead Finite Automata (1973) (10)
AN INVITATION TO ANALYTIC COMBINATORICS (2009) (10)
Towards analysing sequences of operations for dynamic data structures (1979) (9)
Fast Computation With Two Algebraic Numbers (2001) (9)
On the robustness of interconnections in random graphs: a symbolic approach (2002) (8)
The SIGSAM challenges: symbolic asymptotics in practice (1997) (8)
The unusual asymptotics of three-sided prudent polygons (2010) (8)
The enumeration of prudent polygons by area and its unusual asymptotics (2010) (7)
Mathematics and Computer Science III (2004) (7)
A Calculus of Random Generation (1993) (7)
Dynamic data structures: Finite files, limiting profiles and variance analysis (1980) (7)
Random Allocations and Probabilistic Languages (1988) (7)
On Generating Functions of Generating Trees on Generating Functions of Generating Trees on Generating Functions of Generating Trees (1999) (7)
ON A FUNCTIONAL EQUATION ARISING IN THE BROADCAST CHANNEL ANALYSIS OF A PROTOCOL FOR A MULTI-ACCESS (1986) (6)
Search Trees and Bubble Memories (1985) (6)
Page usage in quadtree indexes (1991) (6)
Singular combinatorics (2003) (6)
Methods in the Analysis of Algorithms: Evaluations of a Recursive Partitioning Process (1983) (5)
Average cost of orthogonal range queries in multiattribute trees (1989) (5)
On The Gauss-Kuzmin-Wirsing Constant (1995) (5)
Computing integrated costs of sequences of operations with application to dictionaries (1979) (5)
Multidimensional Divide-and-Conquer and Weighted Digital Sums (2009) (5)
Analytic Combinatorics: SADDLE-POINT ASYMPTOTICS (2009) (4)
The ubiquitous Gaussian law in analytic combinatorics (1997) (4)
Analytic Variations on Quad{trees (1991) (4)
A PROBLEM IN STATISTICAL CLASSIFICATION THEORY (2004) (4)
Euler Sums and Contour Integral Representations Euler Sums and Contour Integral Representations Euler Sums and Contour Integral Representations (1996) (4)
Some New Self-avoiding Walk and Polygon Models (2012) (4)
Deviations from normality in random strings (1986) (4)
Algebraically independent formal power series: A language theory interpretation (1990) (3)
Analytic Combinatorics: COMPLEX ANALYSIS, RATIONAL AND MEROMORPHIC ASYMPTOTICS (2009) (3)
On the Performance of Orthogonal Range Queries in Multiattribute and Doubly Chained Trees (1989) (3)
Analytic combinatorics: a calculus of discrete structures (2007) (3)
The scientific works of Rainer Kemp (1949-2004) (2006) (3)
Analytic Combinatorics: LABELLED STRUCTURES AND EXPONENTIAL GENERATING FUNCTIONS (2009) (3)
Gaussian limit distributions and exponential tails (1993) (3)
Polya festoons (1991) (3)
Discrepancy of Sequences in Discrete Spaces (1989) (2)
P Olya Festoons Algorithms Project Inria Rocquencourt F-78153 Le Chesnay (france) (1991) (2)
Trade-Offs between Density and Robustness in Random Interconnection Graphs (2000) (2)
Theory and Practice of Probabilistic Counting Algorithms (Abstract of Invited Talk) (2004) (2)
Digital Search Trees and the Generation of an Exponentially Distributed Variate (1983) (2)
Analytic Combinatorics: COMBINATORIAL STRUCTURES AND ORDINARY GENERATING FUNCTIONS (2009) (2)
Universal Lossless Data Compression Via Binary Decision Diagrams (2011) (2)
D⋅E⋅K=(1000)8 (2001) (2)
Random Triangulations ( Extended Abstract ) (1996) (1)
Planar Maps and Airy (2000) (1)
Digital Search Trees Revisited | SIAM Journal on Computing | Vol. 15, No. 3 | Society for Industrial and Applied Mathematics (1)
Analytic Combinatorics: SINGULARITY ANALYSIS OF GENERATING FUNCTIONS (2009) (1)
Algorithms seminar, 1991-1992 (1992) (1)
Random Polynomials and Polynomial Factorization Random Polynomials and Polynomial Factorization Random Polynomials and Polynomial Factorization (1996) (1)
Analytic variations on the redundancy rate of renewal processes (2000) (1)
Analytic Variations on Bucket Selection and Sorting Analytic Variations on Bucket Selection and Sorting Analytic Variations on Bucket Selection and Sorting (1998) (1)
BASIC COMPLEX ANALYSIS (2009) (0)
`Average-Case'-Analysis of Algorithms (Dagstuhl Seminar 9728) (2021) (0)
New Results - Computer Algebra (2008) (0)
29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2018, June 25-29, 2018, Uppsala, Sweden (2018) (0)
Analytic Combinatorics: PREFACE (2009) (0)
Method for Developing Combinatorial Generation Algorithms Based on AND/OR Trees and Its Application (2020) (0)
PROCESSES, LATTICE PATH COMBINATORICS AND CONTINUED FRACTIONS (2000) (0)
4 Concluding Remarks Acknowledgements (1994) (0)
New Results - Analyse d'algorithmes (2002) (0)
Scientific Foundations - Algorithmique des séquences (2002) (0)
Random Sampling from Boltzmann Prin iplesPhilippe (2002) (0)
TIGHT MARKOV CHAINS AND RANDOM COMPOSITIONS 1 (2012) (0)
Scientific Foundations - Analyse d'algorithmes (2002) (0)
A Finite Sum of Products of Binomial Coefficients (C. C. Grosjean) (1993) (0)
"Average-Case"-Analysis of Algorithms (Dagstuhl Seminar 9328) (2021) (0)
Understanding the HyperLogLog : a Near-Optimal Cardinality Estimation Algorithm (2016) (0)
Asymptotics of linear divide-and-conquer recurrences (2013) (0)
Symbolic Enumerative Combinatorics and Complex Asymptotic Analysis (2002) (0)
INTRODUCTION 1 Introduction to Hashing Papers by (2012) (0)
33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2022, June 20-24, 2022, Philadelphia, PA, USA (2022) (0)
New Results - Algorithmique des séquences (2002) (0)
Analytic Methods for Select Sets (2012) (0)
2011 Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (2011) (0)
Threshold Phenomena in an "easy" Class of Random Lattices and Eecient Reduction Algorithms Random Assignment Problem and Asymptotic Essential Uniqueness in Optimization over Random Data the Kernel Method the Height and Width of Simple Trees (0)
Singularity Analysis and Asymptotics of Bernoulli Sums Singularity Analysis and Asymptotics of Bernoulli Sums Singularity Analysis and Asymptotics of Bernoulli Sums (1998) (0)
Analytic Combinatorics of Non-crossing Conngurations Analytic Combinatorics of Non-crossing Conngurations Analytic Combinatorics of Non-crossing Conngurations (2007) (0)
Random Sampling from {B}oltzmann Principles (2002) (0)
New Results - Analysis of algorithms (2004) (0)
Elementary Problems: E3415-E3420 (1991) (0)
AUXILIARY ELEMENTARY NOTIONS (2009) (0)
`Average-Case'-Analysis of Algorithms (Dagstuhl Seminar 9527) (2021) (0)
APPLICATIONS OF RATIONAL AND MEROMORPHIC ASYMPTOTICS (2009) (0)
APPLICATIONS OF SINGULARITY ANALYSIS (2009) (0)
Analytic Combinatorics: CONCEPTS OF PROBABILITY THEORY (2009) (0)
COMBINATORIAL PARAMETERS AND MULTIVARIATE GENERATING FUNCTIONS (2009) (0)
On Ramanujan's Q-function s (2003) (0)
The Book Review Column 1 Books on Cryptography and Coding Theory (2010) (0)
The Analysis of Hybrid Trie Structures the Analysis of Hybrid Trie Structures the Analysis of Hybrid Trie Structures (1997) (0)
MULTIVARIATE ASYMPTOTICS AND LIMIT LAWS (2009) (0)

This paper list is powered by the following services:

Philippe J. Flajolet's Academic­Influence.com Rankings

Philippe J. Flajolet's Degrees

Similar Degrees You Can Earn

Why Is Philippe J. Flajolet Influential?

Philippe J. Flajolet's Published Works

Published Works

Philippe J. Flajolet's AcademicInfluence.com Rankings