D?E?K=(1000)8

DOI10.1002/rsa.10022zbMath1016.68695OpenAlexW2065856224MaRDI QIDQ2772918

Philippe Flajolet

Publication date: 14 May 2002

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.10022

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mellin transforms and asymptotics: Harmonic sums
• Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
• A probabilistic analysis of the height of tries and of the complexity of triesort
• The first cycles in an evolving graph
• A diffusion limit for a class of randomly-growing binary trees
• Branching processes in the analysis of the heights of trees
• Analytical depoissonization and its applications
• The expected linearity of a simple equivalence algorithm
• On The variance of the extremal path length in a symmetric digital trie
• On convergence rates in the central limit theorems for combinatorial structures
• On the analysis of linear probing hashing
• Linear probing and graphs
• On pattern frequency occurrences in a Markovian sequence
• Dynamics of the binary Euclidean algorithm: Functional analysis and operators
• Large deviations of combinatorial distributions. II: Local limit theorems
• Central and local limit theorems applied to asymptotic enumeration. II: Multivariate generating functions
• Combinatorics of geometrically distributed random variables: Left-to-right maxima
• Large deviations for combinatorial distributions. I: Central limit theorems
• Central and local limit theorems applied to asymptotic enumeration
• The scaling window of the 2-SAT transition
• The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields
• Random sampling of large planar maps and convex polyhedra
• q-Series Arising From The Study of Random Graphs
• The exact length of the Euclidean algorithm in [ X ]
• A note on the height of binary search trees
• On some applications of formulae of Ramanujan in the analysis of algorithms
• Generalized Digital Trees and Their Difference—Differential Equations
• On the internal path length ofd-dimensional quad trees
• On the average redundancy rate of the Lempel-Ziv code
• The statistics of continued fractions for polynomials over a finite field
• The birth of the giant component

This page was built for publication: D?E?K=(1000)8