Philippe Flajolet

According to our database1, Philippe Flajolet
  • authored at least 137 papers between 1972 and 2012.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2012
The distribution of height and diameter in random non-plane binary trees.
Random Struct. Algorithms, 2012

Some New Self-avoiding Walk and Polygon Models.
Fundam. Inform., 2012

2011
The enumeration of prudent polygons by area and its unusual asymptotics.
J. Comb. Theory, Ser. A, 2011

Universal Lossless Data Compression Via Binary Decision Diagrams
CoRR, 2011

On Buffon Machines and Numbers.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010
Multidimensional Divide-and-Conquer and Weighted Digital Sums
CoRR, 2010

Lindelöf Representations and (Non-)Holonomic Sequences.
Electr. J. Comb., 2010

2009
The Number of Symbol Comparisons in QuickSort and QuickSelect.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

Multidimensional Divide-and-Conquer and Weighted Digital Sums.
Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, 2009

Analytic Combinatorics.
Cambridge University Press, ISBN: 978-0-521-89806-5, 2009

2007
Analytic combinatorics: a calculus of discrete structures.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Boltzmann Sampling of Unlabeled Structures.
Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics, 2007

2006
The scientific works of Rainer Kemp (1949-2004).
Theor. Comput. Sci., 2006

Fast computation of special resultants.
J. Symb. Comput., 2006

Hidden word statistics.
J. ACM, 2006

Combinatorial aspects of continued fractions.
Discrete Mathematics, 2006

A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics.
Electr. J. Comb., 2006

The Ubiquitous Digital Tree.
Proceedings of the STACS 2006, 2006

2005
On the Non-Holonomic Character of Logarithms, Powers, and the nth Prime Function.
Electr. J. Comb., 2005

2004
Boltzmann Samplers for the Random Generation of Combinatorial Structures.
Combinatorics, Probability & Computing, 2004

And/Or Trees Revisited.
Combinatorics, Probability & Computing, 2004

Generating functions for generating trees
CoRR, 2004

Airy Phenomena and Analytic Combinatorics of Connected Graphs.
Electr. J. Comb., 2004

Counting by Coin Tossings.
Proceedings of the Advances in Computer Science, 2004

Theory and Practice of Probabilistic Counting Algorithms (Abstract of Invited Talk).
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003
Loglog Counting of Large Cardinalities (Extended Abstract).
Proceedings of the Algorithms, 2003

2002
Analytic variations on redundancy rates of renewal processes.
IEEE Trans. Information Theory, 2002

Motif statistics.
Theor. Comput. Sci., 2002

On the robustness of interconnections in random graphs: a symbolic approach.
Theor. Comput. Sci., 2002

Basic analytic combinatorics of directed lattice paths.
Theor. Comput. Sci., 2002

Generating functions for generating trees.
Discrete Mathematics, 2002

Random Sampling from Boltzmann Principles.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001
D·E·K=(1000)8.
Random Struct. Algorithms, 2001

Random maps, coalescing saddles, singularity analysis, and Airy phenomena.
Random Struct. Algorithms, 2001

The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields.
J. Algorithms, 2001

Analytic Variations on the Airy Distribution.
Algorithmica, 2001

Dynamical Sources in Information Theory: A General Analysis of Trie Structures.
Algorithmica, 2001

Hidden Pattern Statistics.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
Analytic Variations on Bucket Selection and Sorting.
Acta Inf., 2000

Trade-Offs between Density and Robustness in Random Interconnection Graphs.
Proceedings of the Theoretical Computer Science, 2000

Planar Maps and Airy Phenomena.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999
Singularity Analysis and Asymptotics of Bernoulli Sums.
Theor. Comput. Sci., 1999

On Stirling Numbers for Complex Arguments and Hankel Contours.
SIAM J. Discrete Math., 1999

Analytic combinatorics of non-crossing configurations.
Discrete Mathematics, 1999

Properties of Random Triangulations and Trees.
Discrete & Computational Geometry, 1999

Motif Statistics.
Proceedings of the Algorithms, 1999

1998
Continued Fraction Algorithms, Functional Operators, and Structure Constants.
Theor. Comput. Sci., 1998

Euler Sums and Contour Integral Representations.
Experimental Mathematics, 1998

On the Analysis of Linear Probing Hashing.
Algorithmica, 1998

The Analysis of Hybrid Trie Structures.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

An Analytic Approach to Smooth Polynominals over Finite Fields.
Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998

1997
Analysis of algorithms.
Random Struct. Algorithms, 1997

Patterns in random binary search trees.
Random Struct. Algorithms, 1997

An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction.
Combinatorics, Probability & Computing, 1997

The SIGSAM challenges: symbolic asymptotics in practice.
ACM SIGSAM Bulletin, 1997

1996
Random Polynomials and Polynomial Factorization.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

An introduction to the analysis of algorithms.
Addison-Wesley-Longman, ISBN: 978-0-201-40009-0, 1996

1995
Mellin Transforms and Asymptotics: Finite Differences and Rice's Integrals.
Theor. Comput. Sci., 1995

Mellin Transforms and Asymptotics: Harmonic Sums.
Theor. Comput. Sci., 1995

Hypergeometrics and the Cost Structure of Quadtrees.
Random Struct. Algorithms, 1995

Computer Algebra Libraries for Combinatorial Structures.
J. Symb. Comput., 1995

1994
A Calculus for the Random Generation of Labelled Combinatorial Structures.
Theor. Comput. Sci., 1994

Mellin Transforms and Asymptotics: Digital Sums.
Theor. Comput. Sci., 1994

Search Costs in Quadtrees and Singularity Perturbation Asymptotics.
Discrete & Computational Geometry, 1994

Mellin Transforms and Asymptotics: The Mergesort Recurrence.
Acta Inf., 1994

An analysis of the Gaussian algorithm for lattice reduction.
Proceedings of the Algorithmic Number Theory, First International Symposium, 1994

1993
A Finite Sum of Products of Binomial Coefficients (C. C. Grosjean).
SIAM Review, 1993

General combinatorial schemas: Gaussian limit distributions and exponential tails.
Discrete Mathematics, 1993

The Distribution of Heights of Binary Trees and Other Simple Trees.
Combinatorics, Probability & Computing, 1993

Analytic Variations on Quadtrees.
Algorithmica, 1993

Exact Asymptotics of Divide-and-Conquer Recurrences.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

A Calculus of Random Generation.
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992
Generalized Digital Trees and Their Difference-Differential Equations.
Random Struct. Algorithms, 1992

Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search.
Discrete Applied Mathematics, 1992

Page Usage in a Quadtree Index.
BIT, 1992

Analytic Analysis of Algorithms.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

Varieties of Increasing Trees.
Proceedings of the CAAP '92, 1992

1991
Automatic Average-Case Analysis of Algorithm.
Theor. Comput. Sci., 1991

The Cycle Construction.
SIAM J. Discrete Math., 1991

The Analysis of Multidimensional Searching in Quad-Trees.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1990
Singularity Analysis of Generating Functions.
SIAM J. Discrete Math., 1990

Gaussian limiting distributions for the number of components in combinatorial structures.
J. Comb. Theory, Ser. A, 1990

Non-overlapping Partitions, Continued Fractions, Bessel Functions and a Divergent Series.
Eur. J. Comb., 1990

On adaptive sampling.
Computing, 1990

Analytic Variations on the Common Subexpression Problem.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

The Lattice Reduction Algorithm of Gauss: An Average Case Analysis
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Average-Case Analysis of Algorithms and Data Structures.
Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A), 1990

1989
Average cost of orthogonal range queries in multiattribute trees.
Inf. Syst., 1989

Elliptic Functions, Continued Fractions and Doubled Permutations.
Eur. J. Comb., 1989

The first cycles in an evolving graph.
Discrete Mathematics, 1989

On the Performance of Orthogonal Range Queries in Multiattribute and Doubly Chained Trees.
Proceedings of the Algorithms and Data Structures, 1989

Analysis of KDT-Trees: KD-Trees Improved by Local Reogranisations.
Proceedings of the Algorithms and Data Structures, 1989

Random Mapping Statistics.
Proceedings of the Advances in Cryptology, 1989

1988
Random Allocations and Probabilistic Languages.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

Lambda - Upsilon - Omega: An Assistant Algorithms Analyzer.
Proceedings of the Applied Algebra, 1988

1987
Analytic Models and Ambiguity of Context-Free Languages.
Theor. Comput. Sci., 1987

A Complexity Calculus for Recursive Tree Algorithms.
Mathematical Systems Theory, 1987

Estimating the multiplicities of conflicts to speed their resolution in multiple access channels.
J. ACM, 1987

Prefixes of Infinite Words and Ambiguous Context-Free Languages.
Inf. Process. Lett., 1987

Level number sequences for trees.
Discrete Mathematics, 1987

Random Tree Models in the Analysis of Algorithms.
Proceedings of the Performance '87, 1987

1986
Digital Search Trees Revisited.
SIAM J. Comput., 1986

Register Allocation for Unary-Binary Trees.
SIAM J. Comput., 1986

The Complexity of Generating an Exponentially Distributed Variate.
J. Algorithms, 1986

Partial match retrieval of multidimensional data.
J. ACM, 1986

The analysis of simple list structures.
Inf. Sci., 1986

The Evolution of Two Stacks in Bounded Space and Random Walks in a Triangle.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1985
Q -ary collision resolution algorithms in random-access systems with free or blocked channel access.
IEEE Trans. Information Theory, 1985

Analysis of a stack algorithm for random multiple-access communication.
IEEE Trans. Information Theory, 1985

Probabilistic Counting Algorithms for Data Base Applications.
J. Comput. Syst. Sci., 1985

Search Trees and Bubble Memories.
ITA, 1985

Approximate Counting: A Detailed Analysis.
BIT, 1985

Ambiguity and Transcendence.
Proceedings of the Automata, 1985

Elements of a general theory of combinatorial structures.
Proceedings of the Fundamentals of Computation Theory, 1985

1983
Patterns and Pattern-Matching in Trees: An Analysis
Information and Control, 1983

On the Performance Evaluation of Extendible Hashing and Trie Searching.
Acta Inf., 1983

Tree Structures for Partial Match Retrieval
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

Probabilistic Counting
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

Methods in the Analysis of Algorithms: Evaluations of a Recursive Partitioning Process.
Proceedings of the Fundamentals of Computation Theory, 1983

Digital Search Trees and the Generation of an Exponentially Distributed Variate.
Proceedings of the CAAP'83, 1983

1982
The Average Height of Binary Trees and Other Simple Trees.
J. Comput. Syst. Sci., 1982

On congruences and continued fractions for some classical combinatorial quantities.
Discrete Mathematics, 1982

A Branching Process Arising in Dynamic Hashing, Trie Searching and Polynomial Factorization.
Proceedings of the Automata, 1982

1981
A Complexity Calculus for Classes of Recursive Search Programs over Tree Structures
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980
A Note on Gray Code and Odd-Even Merge.
SIAM J. Comput., 1980

Sequence of Operations Analysis for Dynamic Data Structures.
J. Algorithms, 1980

Combinatorial aspects of continued fractions.
Discrete Mathematics, 1980

On the Analysis of Tree-Matching Algorithms.
Proceedings of the Automata, 1980

Exploring Binary Trees and Other Simple Trees
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

On the analysis of tree-matching algorithms.
Proceedings of the Proc. 5eme Colleque de Lille sur les Arbres en Algebre et en Programmation, 1980

1979
The Number of Registers Required for Evaluating Arithmetic Expressions.
Theor. Comput. Sci., 1979

Computing Integrated Costs of Sequences of Operations with Application to Dictionaries
Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

Towards Analysing Sequences of Operations for Dynamic Data Structures (Preliminary Version)
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1977
On the Average Number of Registers Required for Evaluating Arithmetic Expressions
Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October, 1977

1974
On Sets Having Only Hard Subsets.
Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, July 29, 1974

1973
Decision Problems for Multihead Finite Automata.
Proceedings of the Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, 1973

1972
Complexité des problèmes de décision relatifs aux algorithmes de tri.
ICALP, 1972


  Loading...