Complexité des problèmes de décision relatifs aux algorithmes de tri. - Philippe Flajolet; Jean-Marc Steyaert (ICALP, 1972)

Decision Problems for Multihead Finite Automata. - Philippe Flajolet; Jean-Marc Steyaert (MFCS, 1973)

On Sets Having Only Hard Subsets. - Philippe Flajolet; Jean-Marc Steyaert (ICALP, 1974)

Une généralisation de la notion d'ensemble immune. - Philippe Flajolet; Jean-Marc Steyaert (RAIRO Theor. Informatics Appl., 1974)

On the Average Number of Registers Required for Evaluating Arithmetic Expressions - Philippe Flajolet; Jean-Claude Raoult; Jean Vuillemin (FOCS, 1977)

Towards Analysing Sequences of Operations for Dynamic Data Structures (Preliminary Version) - Philippe Flajolet; Jean Françon; Jean Vuillemin (FOCS, 1979)

Computing Integrated Costs of Sequences of Operations with Application to Dictionaries - Philippe Flajolet; Jean Françon; Jean Vuillemin (STOC, 1979)

The Number of Registers Required for Evaluating Arithmetic Expressions. - Philippe Flajolet; Jean-Claude Raoult; Jean Vuillemin (Theor. Comput. Sci., 1979)

On the analysis of tree-matching algorithms. - Philippe Flajolet; Jean-Marc Steyaert (CLAAP, 1980)

Exploring Binary Trees and Other Simple Trees - Philippe Flajolet; Andrew M. Odlyzko (FOCS, 1980)

Sequence of Operations Analysis for Dynamic Data Structures. - Philippe Flajolet; Jean Françon; Jean Vuillemin (J. Algorithms, 1980)

A Note on Gray Code and Odd-Even Merge. - Philippe Flajolet; Lyle Ramshaw (SIAM J. Comput., 1980)

A Complexity Calculus for Classes of Recursive Search Programs over Tree Structures - Philippe Flajolet; Jean-Marc Steyaert (FOCS, 1981)

A Branching Process Arising in Dynamic Hashing, Trie Searching and Polynomial Factorization. - Philippe Flajolet; Jean-Marc Steyaert (ICALP, 1982)

On congruences and continued fractions for some classical combinatorial quantities. - Philippe Flajolet (Discret. Math., 1982)

The Average Height of Binary Trees and Other Simple Trees. - Philippe Flajolet; Andrew M. Odlyzko (J. Comput. Syst. Sci., 1982)

Digital Search Trees and the Generation of an Exponentially Distributed Variate. - Philippe Flajolet; Nasser Saheb (CAAP, 1983)

Methods in the Analysis of Algorithms: Evaluations of a Recursive Partitioning Process. - Philippe Flajolet (FCT, 1983)

Probabilistic Counting - Philippe Flajolet; G. Nigel Martin (FOCS, 1983)

Tree Structures for Partial Match Retrieval - Philippe Flajolet; Claude Puech (FOCS, 1983)

On the Performance Evaluation of Extendible Hashing and Trie Searching. - Philippe Flajolet (Acta Informatica, 1983)

Patterns and Pattern-Matching in Trees: An Analysis - Jean-Marc Steyaert; Philippe Flajolet (Inf. Control., 1983)

Elements of a general theory of combinatorial structures. - Philippe Flajolet (FCT, 1985)

Ambiguity and Transcendence. - Philippe Flajolet (ICALP, 1985)

Approximate Counting: A Detailed Analysis. - Philippe Flajolet (BIT, 1985)

Search Trees and Bubble Memories. - Philippe Flajolet; Thomas Ottmann; Derick Wood (RAIRO Theor. Informatics Appl., 1985)

Probabilistic Counting Algorithms for Data Base Applications. - Philippe Flajolet; G. Nigel Martin (J. Comput. Syst. Sci., 1985)

Analysis of a stack algorithm for random multiple-access communication. - Guy Fayolle; Philippe Flajolet; Micha Hofri; Philippe Jacquet (IEEE Trans. Inf. Theory, 1985)

Q -ary collision resolution algorithms in random-access systems with free or blocked channel access. - Peter Mathys; Philippe Flajolet (IEEE Trans. Inf. Theory, 1985)

The Evolution of Two Stacks in Bounded Space and Random Walks in a Triangle. - Philippe Flajolet (MFCS, 1986)

The analysis of simple list structures. - Philippe Flajolet; Claude Puech; Jean Vuillemin (Inf. Sci., 1986)

Partial match retrieval of multidimensional data. - Philippe Flajolet; Claude Puech (J. ACM, 1986)

The Complexity of Generating an Exponentially Distributed Variate. - Philippe Flajolet; Nasser Saheb (J. Algorithms, 1986)

Register Allocation for Unary-Binary Trees. - Philippe Flajolet; Helmut Prodinger (SIAM J. Comput., 1986)

Digital Search Trees Revisited. - Philippe Flajolet; Robert Sedgewick (SIAM J. Comput., 1986)

Random Tree Models in the Analysis of Algorithms. - Philippe Flajolet (Performance, 1987)

Level number sequences for trees. - Philippe Flajolet; Helmut Prodinger (Discret. Math., 1987)

Prefixes of Infinite Words and Ambiguous Context-Free Languages. - Jean-Michel Autebert; Philippe Flajolet; Joaquim Gabarró (Inf. Process. Lett., 1987)

Estimating the multiplicities of conflicts to speed their resolution in multiple access channels. - Albert G. Greenberg; Philippe Flajolet; Richard E. Ladner (J. ACM, 1987)

A Complexity Calculus for Recursive Tree Algorithms. - Philippe Flajolet; Jean-Marc Steyaert (Math. Syst. Theory, 1987)

Analytic Models and Ambiguity of Context-Free Languages. - Philippe Flajolet (Theor. Comput. Sci., 1987)

Lambda - Upsilon - Omega: An Assistant Algorithms Analyzer. - Philippe Flajolet; Bruno Salvy; Paul Zimmermann (AAECC, 1988)

Random Allocations and Probabilistic Languages. - Philippe Flajolet; Danièle Gardy; Loÿs Thimonier (ICALP, 1988)

Random Mapping Statistics. - Philippe Flajolet; Andrew M. Odlyzko (EUROCRYPT, 1989)

Analysis of KDT-Trees: KD-Trees Improved by Local Reogranisations. - Walter Cunto; Gustavo Lau; Philippe Flajolet (WADS, 1989)

On the Performance of Orthogonal Range Queries in Multiattribute and Doubly Chained Trees. - Danièle Gardy; Philippe Flajolet; Claude Puech (WADS, 1989)

The first cycles in an evolving graph. - Philippe Flajolet; Donald E. Knuth; Boris G. Pittel (Discret. Math., 1989)

Elliptic Functions, Continued Fractions and Doubled Permutations. - Philippe Flajolet; Jean Françon (Eur. J. Comb., 1989)

Average cost of orthogonal range queries in multiattribute trees. - Danièle Gardy; Philippe Flajolet; Claude Puech (Inf. Syst., 1989)

Average-Case Analysis of Algorithms and Data Structures. - Jeffrey Scott Vitter; Philippe Flajolet (Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A), 1990)

The Lattice Reduction Algorithm of Gauss: An Average Case Analysis - Brigitte Vallée; Philippe Flajolet (FOCS, 1990)

Analytic Variations on the Common Subexpression Problem. - Philippe Flajolet; Paolo Sipala; Jean-Marc Steyaert (ICALP, 1990)

On adaptive sampling. - Philippe Flajolet (Computing, 1990)

Non-overlapping Partitions, Continued Fractions, Bessel Functions and a Divergent Series. - Philippe Flajolet; René Schott (Eur. J. Comb., 1990)

Gaussian limiting distributions for the number of components in combinatorial structures. - Philippe Flajolet; Michèle Soria (J. Comb. Theory A, 1990)

Singularity Analysis of Generating Functions. - Philippe Flajolet; Andrew M. Odlyzko (SIAM J. Discret. Math., 1990)

The Analysis of Multidimensional Searching in Quad-Trees. - Philippe Flajolet; Gaston H. Gonnet; Claude Puech; J. M. Robson (SODA, 1991)

The Cycle Construction. - Philippe Flajolet; Michèle Soria (SIAM J. Discret. Math., 1991)

Automatic Average-Case Analysis of Algorithm. - Philippe Flajolet; Bruno Salvy; Paul Zimmermann (Theor. Comput. Sci., 1991)

Varieties of Increasing Trees. - François Bergeron; Philippe Flajolet; Bruno Salvy (CAAP, 1992)

Analytic Analysis of Algorithms. - Philippe Flajolet (ICALP, 1992)

Page Usage in a Quadtree Index. - Mamoru Hoshi; Philippe Flajolet (BIT, 1992)

Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search. - Philippe Flajolet; Danièle Gardy; Loÿs Thimonier (Discret. Appl. Math., 1992)

Generalized Digital Trees and Their Difference-Differential Equations. - Philippe Flajolet; L. Bruce Richmond (Random Struct. Algorithms, 1992)

A Calculus of Random Generation. - Philippe Flajolet; Paul Zimmermann; Bernard Van Cutsem (ESA, 1993)

Exact Asymptotics of Divide-and-Conquer Recurrences. - Philippe Flajolet; Mordecai J. Golin (ICALP, 1993)

Analytic Variations on Quadtrees. - Philippe Flajolet; Gaston H. Gonnet; Claude Puech; J. M. Robson (Algorithmica, 1993)

The Distribution of Heights of Binary Trees and Other Simple Trees. - Philippe Flajolet; Zhicheng Gao; Andrew M. Odlyzko; L. Bruce Richmond (Comb. Probab. Comput., 1993)

General combinatorial schemas: Gaussian limit distributions and exponential tails. - Philippe Flajolet; Michèle Soria (Discret. Math., 1993)

A Finite Sum of Products of Binomial Coefficients (C. C. Grosjean). - Philippe Flajolet; Bruno Salvy; Helmut Prodinger (SIAM Rev., 1993)

An analysis of the Gaussian algorithm for lattice reduction. - Hervé Daudé; Philippe Flajolet; Brigitte Vallée (ANTS, 1994)

Mellin Transforms and Asymptotics: The Mergesort Recurrence. - Philippe Flajolet; Mordecai J. Golin (Acta Informatica, 1994)

Search Costs in Quadtrees and Singularity Perturbation Asymptotics. - Philippe Flajolet; T. Lafforgue (Discret. Comput. Geom., 1994)

Mellin Transforms and Asymptotics: Digital Sums. - Philippe Flajolet; Peter J. Grabner; Peter Kirschenhofer; Helmut Prodinger; Robert F. Tichy (Theor. Comput. Sci., 1994)

A Calculus for the Random Generation of Labelled Combinatorial Structures. - Philippe Flajolet; Paul Zimmermann; Bernard Van Cutsem (Theor. Comput. Sci., 1994)

Computer Algebra Libraries for Combinatorial Structures. - Philippe Flajolet; Bruno Salvy (J. Symb. Comput., 1995)

Hypergeometrics and the Cost Structure of Quadtrees. - Philippe Flajolet; Gilbert Labelle; Louise Laforest; Bruno Salvy (Random Struct. Algorithms, 1995)

Mellin Transforms and Asymptotics: Harmonic Sums. - Philippe Flajolet; Xavier Gourdon; Philippe Dumas 001 (Theor. Comput. Sci., 1995)

Mellin Transforms and Asymptotics: Finite Differences and Rice's Integrals. - Philippe Flajolet; Robert Sedgewick (Theor. Comput. Sci., 1995)

An introduction to the analysis of algorithms. - Robert Sedgewick; Philippe Flajolet (Addison-Wesley-Longman, 1996)

Random Polynomials and Polynomial Factorization. - Philippe Flajolet; Xavier Gourdon; Daniel Panario (ICALP, 1996)

The SIGSAM challenges: symbolic asymptotics in practice. - Philippe Flajolet; Bruno Salvy (SIGSAM Bull., 1997)

An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction. - Hervé Daudé; Philippe Flajolet; Brigitte Vallée (Comb. Probab. Comput., 1997)

Patterns in random binary search trees. - Philippe Flajolet; Xavier Gourdon; Conrado Martinez (Random Struct. Algorithms, 1997)

Analysis of algorithms. - Philippe Flajolet; Wojciech Szpankowski (Random Struct. Algorithms, 1997)

An Analytic Approach to Smooth Polynominals over Finite Fields. - Daniel Panario; Xavier Gourdon; Philippe Flajolet (ANTS, 1998)

The Analysis of Hybrid Trie Structures. - Julien Clément 001; Philippe Flajolet; Brigitte Vallée (SODA, 1998)

On the Analysis of Linear Probing Hashing. - Philippe Flajolet; Patricio V. Poblete; Alfredo Viola (Algorithmica, 1998)

Euler Sums and Contour Integral Representations. - Philippe Flajolet; Bruno Salvy (Exp. Math., 1998)

Continued Fraction Algorithms, Functional Operators, and Structure Constants. - Philippe Flajolet; Brigitte Vallée (Theor. Comput. Sci., 1998)

Properties of Random Triangulations and Trees. - Luc Devroye; Philippe Flajolet; Ferran Hurtado; Marc Noy; William L. Steiger (Discret. Comput. Geom., 1999)

Analytic combinatorics of non-crossing configurations. - Philippe Flajolet; Marc Noy (Discret. Math., 1999)

On Stirling Numbers for Complex Arguments and Hankel Contours. - Philippe Flajolet; Helmut Prodinger (SIAM J. Discret. Math., 1999)

Singularity Analysis and Asymptotics of Bernoulli Sums. - Philippe Flajolet (Theor. Comput. Sci., 1999)

Planar Maps and Airy Phenomena. - Cyril Banderier; Philippe Flajolet; Gilles Schaeffer; Michèle Soria (ICALP, 2000)

Trade-Offs between Density and Robustness in Random Interconnection Graphs. - Philippe Flajolet; Kostas P. Hatzis; Sotiris E. Nikoletseas; Paul G. Spirakis (IFIP TCS, 2000)

Analytic Variations on Bucket Selection and Sorting. - Hosam M. Mahmoud; Philippe Flajolet; Philippe Jacquet; Mireille Régnier (Acta Informatica, 2000)

Hidden Pattern Statistics. - Philippe Flajolet; Yves Guivarc'h; Wojciech Szpankowski; Brigitte Vallée (ICALP, 2001)

Dynamical Sources in Information Theory: A General Analysis of Trie Structures. - Julien Clément 001; Philippe Flajolet; Brigitte Vallée (Algorithmica, 2001)

Analytic Variations on the Airy Distribution. - Philippe Flajolet; Guy Louchard (Algorithmica, 2001)

The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields. - Philippe Flajolet; Xavier Gourdon; Daniel Panario (J. Algorithms, 2001)

Random maps, coalescing saddles, singularity analysis, and Airy phenomena. - Cyril Banderier; Philippe Flajolet; Gilles Schaeffer; Michèle Soria (Random Struct. Algorithms, 2001)

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

Random Sampling from Boltzmann Principles. - Philippe Duchon; Philippe Flajolet; Guy Louchard; Gilles Schaeffer (ICALP, 2002)

Generating functions for generating trees. - Cyril Banderier; Mireille Bousquet-Mélou; Alain Denise; Philippe Flajolet; Danièle Gardy; Dominique Gouyou-Beauchamps (Discret. Math., 2002)

Basic analytic combinatorics of directed lattice paths. - Cyril Banderier; Philippe Flajolet (Theor. Comput. Sci., 2002)

On the robustness of interconnections in random graphs: a symbolic approach. - Philippe Flajolet; Kostas P. Hatzis; Sotiris E. Nikoletseas; Paul G. Spirakis (Theor. Comput. Sci., 2002)

Motif statistics. - Pierre Nicodème; Bruno Salvy; Philippe Flajolet (Theor. Comput. Sci., 2002)

Analytic variations on redundancy rates of renewal processes. - Philippe Flajolet; Wojciech Szpankowski (IEEE Trans. Inf. Theory, 2002)

Loglog Counting of Large Cardinalities (Extended Abstract). - Marianne Durand; Philippe Flajolet (ESA, 2003)

Theory and Practice of Probabilistic Counting Algorithms (Abstract of Invited Talk). - Philippe Flajolet (ALENEX/ANALC, 2004)

Counting by Coin Tossings. - Philippe Flajolet (ASIAN, 2004)

Airy Phenomena and Analytic Combinatorics of Connected Graphs. - Philippe Flajolet; Bruno Salvy; Gilles Schaeffer (Electron. J. Comb., 2004)

And/Or Trees Revisited. - Brigitte Chauvin; Philippe Flajolet; Danièle Gardy; Bernhard Gittenberger (Comb. Probab. Comput., 2004)

Boltzmann Samplers for the Random Generation of Combinatorial Structures. - Philippe Duchon; Philippe Flajolet; Guy Louchard; Gilles Schaeffer (Comb. Probab. Comput., 2004)

On the Non-Holonomic Character of Logarithms, Powers, and the nth Prime Function. - Philippe Flajolet; Stefan Gerhold; Bruno Salvy (Electron. J. Comb., 2005)

The Ubiquitous Digital Tree. - Philippe Flajolet (STACS, 2006)

A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics. - Philippe Flajolet; Éric Fusy; Xavier Gourdon; Daniel Panario; Nicolas Pouyanne (Electron. J. Comb., 2006)

Combinatorial aspects of continued fractions. - Philippe Flajolet (Discret. Math., 2006)

Hidden word statistics. - Philippe Flajolet; Wojciech Szpankowski; Brigitte Vallée (J. ACM, 2006)

Fast computation of special resultants. - Alin Bostan; Philippe Flajolet; Bruno Salvy; Éric Schost (J. Symb. Comput., 2006)

The scientific works of Rainer Kemp (1949-2004). - Philippe Flajolet; Markus E. Nebel; Helmut Prodinger (Theor. Comput. Sci., 2006)

Boltzmann Sampling of Unlabeled Structures. - Philippe Flajolet; Éric Fusy; Carine Pivoteau (ANALCO, 2007)

Analytic combinatorics: a calculus of discrete structures. - Philippe Flajolet (SODA, 2007)

Analytic Combinatorics. - Philippe Flajolet; Robert Sedgewick (Cambridge University Press, 2009)

Multidimensional Divide-and-Conquer and Weighted Digital Sums. - Yun Kuen Cheung; Philippe Flajolet; Mordecai J. Golin; C. Y. James Lee (ANALCO, 2009)

The Number of Symbol Comparisons in QuickSort and QuickSelect. - Brigitte Vallée; Julien Clément 001; James Allen Fill; Philippe Flajolet (ICALP (1), 2009)

Lindelöf Representations and (Non-)Holonomic Sequences. - Philippe Flajolet; Stefan Gerhold; Bruno Salvy (Electron. J. Comb., 2010)

On Buffon Machines and Numbers. - Philippe Flajolet; Maryse Pelletier; Michèle Soria (SODA, 2011)

Universal Lossless Data Compression Via Binary Decision Diagrams - John C. Kieffer; Philippe Flajolet; En-Hui Yang (CoRR, 2011)

The enumeration of prudent polygons by area and its unusual asymptotics. - Nicholas R. Beaton; Philippe Flajolet; Anthony J. Guttmann (J. Comb. Theory A, 2011)

Some New Self-avoiding Walk and Polygon Models. - Nicholas R. Beaton; Philippe Flajolet; Timothy M. Garoni; Anthony J. Guttmann (Fundam. Informaticae, 2012)

The distribution of height and diameter in random non-plane binary trees. - Nicolas Broutin; Philippe Flajolet (Random Struct. Algorithms, 2012)