| 2007 |
|---|
| 118 | EE | Philippe Flajolet:
Analytic combinatorics: a calculus of discrete structures.
SODA 2007: 137-148 |
| 2006 |
|---|
| 117 | EE | Philippe Flajolet:
The Ubiquitous Digital Tree.
STACS 2006: 1-22 |
| 116 | EE | Philippe Flajolet:
Combinatorial aspects of continued fractions.
Discrete Mathematics 306(10-11): 992-1021 (2006) |
| 115 | EE | Philippe Flajolet,
Éric Fusy,
Xavier Gourdon,
Daniel Panario,
Nicolas Pouyanne:
A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics.
Electr. J. Comb. 13(1): (2006) |
| 114 | EE | Philippe Flajolet,
Wojciech Szpankowski,
Brigitte Vallée:
Hidden word statistics.
J. ACM 53(1): 147-183 (2006) |
| 113 | EE | Alin Bostan,
Philippe Flajolet,
Bruno Salvy,
Éric Schost:
Fast computation of special resultants.
J. Symb. Comput. 41(1): 1-29 (2006) |
| 112 | EE | Philippe Flajolet,
Markus E. Nebel,
Helmut Prodinger:
The scientific works of Rainer Kemp (1949-2004).
Theor. Comput. Sci. 355(3): 371-381 (2006) |
| 2004 |
|---|
| 111 | | Philippe Flajolet:
Theory and Practice of Probabilistic Counting Algorithms (Abstract of Invited Talk).
ALENEX/ANALC 2004: 152 |
| 110 | EE | Philippe Flajolet:
Counting by Coin Tossings.
ASIAN 2004: 1-12 |
| 109 | EE | Cyril Banderier,
Philippe Flajolet,
Danièle Gardy,
Mireille Bousquet-Mélou,
Alain Denise,
Dominique Gouyou-Beauchamps:
Generating functions for generating trees
CoRR math.CO/0411250: (2004) |
| 108 | EE | Brigitte Chauvin,
Philippe Flajolet,
Danièle Gardy,
Bernhard Gittenberger:
And/Or Trees Revisited.
Combinatorics, Probability & Computing 13(4-5): 475-497 (2004) |
| 107 | EE | Philippe Duchon,
Philippe Flajolet,
Guy Louchard,
Gilles Schaeffer:
Boltzmann Samplers for the Random Generation of Combinatorial Structures.
Combinatorics, Probability & Computing 13(4-5): 577-625 (2004) |
| 106 | EE | Philippe Flajolet,
Bruno Salvy,
Gilles Schaeffer:
Airy Phenomena and Analytic Combinatorics of Connected Graphs.
Electr. J. Comb. 11(1): (2004) |
| 2003 |
|---|
| 105 | EE | Marianne Durand,
Philippe Flajolet:
Loglog Counting of Large Cardinalities (Extended Abstract).
ESA 2003: 605-617 |
| 2002 |
|---|
| 104 | EE | Philippe Duchon,
Philippe Flajolet,
Guy Louchard,
Gilles Schaeffer:
Random Sampling from Boltzmann Principles.
ICALP 2002: 501-513 |
| 103 | EE | Cyril Banderier,
Mireille Bousquet-Mélou,
Alain Denise,
Philippe Flajolet,
Danièle Gardy,
Dominique Gouyou-Beauchamps:
Generating functions for generating trees.
Discrete Mathematics 246(1-3): 29-55 (2002) |
| 102 | | Philippe Flajolet,
Wojciech Szpankowski:
Analytic variations on redundancy rates of renewal processes.
IEEE Transactions on Information Theory 48(11): 2911-2921 (2002) |
| 101 | EE | Cyril Banderier,
Philippe Flajolet:
Basic analytic combinatorics of directed lattice paths.
Theor. Comput. Sci. 281(1-2): 37-80 (2002) |
| 100 | | Philippe Flajolet,
Kostas P. Hatzis,
Sotiris E. Nikoletseas,
Paul G. Spirakis:
On the robustness of interconnections in random graphs: a symbolic approach.
Theor. Comput. Sci. 287(2): 515-534 (2002) |
| 99 | | Pierre Nicodème,
Bruno Salvy,
Philippe Flajolet:
Motif statistics.
Theor. Comput. Sci. 287(2): 593-617 (2002) |
| 2001 |
|---|
| 98 | EE | Philippe Flajolet,
Yves Guivarc'h,
Wojciech Szpankowski,
Brigitte Vallée:
Hidden Pattern Statistics.
ICALP 2001: 152-165 |
| 97 | EE | Julien Clément,
Philippe Flajolet,
Brigitte Vallée:
Dynamical Sources in Information Theory: A General Analysis of Trie Structures.
Algorithmica 29(1): 307-369 (2001) |
| 96 | EE | Philippe Flajolet,
Guy Louchard:
Analytic Variations on the Airy Distribution.
Algorithmica 31(3): 361-377 (2001) |
| 95 | | Philippe Flajolet,
Xavier Gourdon,
Daniel Panario:
The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields.
J. Algorithms 40(1): 37-81 (2001) |
| 94 | | Philippe Flajolet:
D·E·K=(1000)8.
Random Struct. Algorithms 19(3-4): 150-162 (2001) |
| 93 | | Cyril Banderier,
Philippe Flajolet,
Gilles Schaeffer,
Michèle Soria:
Random maps, coalescing saddles, singularity analysis, and Airy phenomena.
Random Struct. Algorithms 19(3-4): 194-246 (2001) |
| 2000 |
|---|
| 92 | EE | Cyril Banderier,
Philippe Flajolet,
Gilles Schaeffer,
Michèle Soria:
Planar Maps and Airy Phenomena.
ICALP 2000: 388-402 |
| 91 | EE | Philippe Flajolet,
Kostas P. Hatzis,
Sotiris E. Nikoletseas,
Paul G. Spirakis:
Trade-Offs between Density and Robustness in Random Interconnection Graphs.
IFIP TCS 2000: 152-168 |
| 90 | EE | Hosam M. Mahmoud,
Philippe Flajolet,
Philippe Jacquet,
Mireille Régnier:
Analytic Variations on Bucket Selection and Sorting.
Acta Inf. 36(9/10): 735-760 (2000) |
| 1999 |
|---|
| 89 | EE | Pierre Nicodème,
Bruno Salvy,
Philippe Flajolet:
Motif Statistics.
ESA 1999: 194-211 |
| 88 | EE | Luc Devroye,
Philippe Flajolet,
Ferran Hurtado,
Marc Noy,
William L. Steiger:
Properties of Random Triangulations and Trees.
Discrete & Computational Geometry 22(1): 105-117 (1999) |
| 87 | EE | Philippe Flajolet,
Marc Noy:
Analytic combinatorics of non-crossing configurations.
Discrete Mathematics 204(1-3): 203-229 (1999) |
| 86 | EE | Philippe Flajolet,
Helmut Prodinger:
On Stirling Numbers for Complex Arguments and Hankel Contours.
SIAM J. Discrete Math. 12(2): 155-159 (1999) |
| 85 | EE | Philippe Flajolet:
Singularity Analysis and Asymptotics of Bernoulli Sums.
Theor. Comput. Sci. 215(1-2): 371-381 (1999) |
| 1998 |
|---|
| 84 | EE | Daniel Panario,
Xavier Gourdon,
Philippe Flajolet:
An Analytic Approach to Smooth Polynominals over Finite Fields.
ANTS 1998: 226-236 |
| 83 | | Julien Clément,
Philippe Flajolet,
Brigitte Vallée:
The Analysis of Hybrid Trie Structures.
SODA 1998: 531-539 |
| 82 | EE | Philippe Flajolet,
Patricio V. Poblete,
Alfredo Viola:
On the Analysis of Linear Probing Hashing.
Algorithmica 22(4): 490-515 (1998) |
| 81 | EE | Philippe Flajolet,
Brigitte Vallée:
Continued Fraction Algorithms, Functional Operators, and Structure Constants.
Theor. Comput. Sci. 194(1-2): 1-34 (1998) |
| 1997 |
|---|
| 80 | | Hervé Daudé,
Philippe Flajolet,
Brigitte Vallée:
An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction.
Combinatorics, Probability & Computing 6(4): 397-433 (1997) |
| 79 | | Philippe Flajolet,
Wojciech Szpankowski:
Analysis of algorithms.
Random Struct. Algorithms 10(1-2): 1-3 (1997) |
| 78 | | Philippe Flajolet,
Xavier Gourdon,
Conrado Martinez:
Patterns in random binary search trees.
Random Struct. Algorithms 11(3): 223-244 (1997) |
| 1996 |
|---|
| 77 | | Philippe Flajolet,
Xavier Gourdon,
Daniel Panario:
Random Polynomials and Polynomial Factorization.
ICALP 1996: 232-243 |
| 1995 |
|---|
| 76 | | Philippe Flajolet,
Bruno Salvy:
Computer Algebra Libraries for Combinatorial Structures.
J. Symb. Comput. 20(5/6): 653-671 (1995) |
| 75 | | Philippe Flajolet,
Gilbert Labelle,
Louise Laforest,
Bruno Salvy:
Hypergeometrics and the Cost Structure of Quadtrees.
Random Struct. Algorithms 7(2): 117-144 (1995) |
| 74 | EE | Philippe Flajolet,
Robert Sedgewick:
Mellin Transforms and Asymptotics: Finite Differences and Rice's Integrals.
Theor. Comput. Sci. 144(1&2): 101-124 (1995) |
| 73 | EE | Philippe Flajolet,
Xavier Gourdon,
Philippe Dumas:
Mellin Transforms and Asymptotics: Harmonic Sums.
Theor. Comput. Sci. 144(1&2): 3-58 (1995) |
| 1994 |
|---|
| 72 | | Hervé Daudé,
Philippe Flajolet,
Brigitte Vallée:
An analysis of the Gaussian algorithm for lattice reduction.
ANTS 1994: 144-158 |
| 71 | | Philippe Flajolet,
Mordecai J. Golin:
Mellin Transforms and Asymptotics: The Mergesort Recurrence.
Acta Inf. 31(7): 673-696 (1994) |
| 70 | | Philippe Flajolet,
T. Lafforgue:
Search Costs in Quadtrees and Singularity Perturbation Asymptotics.
Discrete & Computational Geometry 12: 151-175 (1994) |
| 69 | | Philippe Flajolet,
Peter J. Grabner,
Peter Kirschenhofer,
Helmut Prodinger,
Robert F. Tichy:
Mellin Transforms and Asymptotics: Digital Sums.
Theor. Comput. Sci. 123(2): 291-314 (1994) |
| 68 | | Philippe Flajolet,
Paul Zimmermann,
Bernard Van Cutsem:
A Calculus for the Random Generation of Labelled Combinatorial Structures.
Theor. Comput. Sci. 132(2): 1-35 (1994) |
| 1993 |
|---|
| 67 | | Philippe Flajolet,
Paul Zimmermann,
Bernard Van Cutsem:
A Calculus of Random Generation.
ESA 1993: 169-180 |
| 66 | | Philippe Flajolet,
Mordecai J. Golin:
Exact Asymptotics of Divide-and-Conquer Recurrences.
ICALP 1993: 137-149 |
| 65 | | Philippe Flajolet,
Gaston H. Gonnet,
Claude Puech,
J. M. Robson:
Analytic Variations on Quadtrees.
Algorithmica 10(6): 473-500 (1993) |
| 64 | | Philippe Flajolet,
Zhicheng Gao,
Andrew M. Odlyzko,
L. Bruce Richmond:
The Distribution of Heights of Binary Trees and Other Simple Trees.
Combinatorics, Probability & Computing 2: 145-156 (1993) |
| 63 | EE | Philippe Flajolet,
Michèle Soria:
General combinatorial schemas: Gaussian limit distributions and exponential tails.
Discrete Mathematics 114(1-3): 159-180 (1993) |
| 1992 |
|---|
| 62 | | François Bergeron,
Philippe Flajolet,
Bruno Salvy:
Varieties of Increasing Trees.
CAAP 1992: 24-48 |
| 61 | | Philippe Flajolet:
Analytic Analysis of Algorithms.
ICALP 1992: 186-210 |
| 60 | | Mamoru Hoshi,
Philippe Flajolet:
Page Usage in a Quadtree Index.
BIT 32(3): 384-402 (1992) |
| 59 | EE | Philippe Flajolet,
Danièle Gardy,
Loÿs Thimonier:
Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search.
Discrete Applied Mathematics 39(3): 207-229 (1992) |
| 58 | | Philippe Flajolet,
L. Bruce Richmond:
Generalized Digital Trees and Their Difference-Differential Equations.
Random Struct. Algorithms 3(3): 305-320 (1992) |
| 1991 |
|---|
| 57 | | Philippe Flajolet,
Gaston H. Gonnet,
Claude Puech,
J. M. Robson:
The Analysis of Multidimensional Searching in Quad-Trees.
SODA 1991: 100-109 |
| 56 | | Philippe Flajolet,
Michèle Soria:
The Cycle Construction.
SIAM J. Discrete Math. 4(1): 58-60 (1991) |
| 55 | | Philippe Flajolet,
Bruno Salvy,
Paul Zimmermann:
Automatic Average-Case Analysis of Algorithm.
Theor. Comput. Sci. 79(1): 37-109 (1991) |
| 1990 |
|---|
| 54 | | Brigitte Vallée,
Philippe Flajolet:
The Lattice Reduction Algorithm of Gauss: An Average Case Analysis
FOCS 1990: 830-839 |
| 53 | | Philippe Flajolet,
Paolo Sipala,
Jean-Marc Steyaert:
Analytic Variations on the Common Subexpression Problem.
ICALP 1990: 220-234 |
| 52 | | Jeffrey Scott Vitter,
Philippe Flajolet:
Average-Case Analysis of Algorithms and Data Structures.
Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 431-524 |
| 51 | EE | Philippe Flajolet,
Michèle Soria:
Gaussian limiting distributions for the number of components in combinatorial structures.
J. Comb. Theory, Ser. A 53(2): 165-182 (1990) |
| 50 | | Philippe Flajolet,
Andrew M. Odlyzko:
Singularity Analysis of Generating Functions.
SIAM J. Discrete Math. 3(2): 216-240 (1990) |
| 1989 |
|---|
| 49 | EE | Philippe Flajolet,
Andrew M. Odlyzko:
Random Mapping Statistics.
EUROCRYPT 1989: 329-354 |
| 48 | | Danièle Gardy,
Philippe Flajolet,
Claude Puech:
On the Performance of Orthogonal Range Queries in Multiattribute and Doubly Chained Trees.
WADS 1989: 218-229 |
| 47 | | Walter Cunto,
Gustavo Lau,
Philippe Flajolet:
Analysis of KDT-Trees: KD-Trees Improved by Local Reogranisations.
WADS 1989: 24-38 |
| 46 | EE | Philippe Flajolet,
Donald E. Knuth,
Boris Pittel:
The first cycles in an evolving graph.
Discrete Mathematics 75(1-3): 167-215 (1989) |
| 45 | | Danièle Gardy,
Philippe Flajolet,
Claude Puech:
Average cost of orthogonal range queries in multiattribute trees.
Inf. Syst. 14(4): 341-350 (1989) |
| 1988 |
|---|
| 44 | | Philippe Flajolet,
Bruno Salvy,
Paul Zimmermann:
Lambda - Upsilon - Omega: An Assistant Algorithms Analyzer.
AAECC 1988: 201-212 |
| 43 | | Philippe Flajolet,
Danièle Gardy,
Loÿs Thimonier:
Random Allocations and Probabilistic Languages.
ICALP 1988: 239-253 |
| 1987 |
|---|
| 42 | | Philippe Flajolet:
Random Tree Models in the Analysis of Algorithms.
Performance 1987: 171-187 |
| 41 | EE | Philippe Flajolet,
Helmut Prodinger:
Level number sequences for trees.
Discrete Mathematics 65(2): 149-156 (1987) |
| 40 | | Jean-Michel Autebert,
Philippe Flajolet,
Joaquim Gabarró:
Prefixes of Infinite Words and Ambiguous Context-Free Languages.
Inf. Process. Lett. 25(4): 211-216 (1987) |
| 39 | EE | Albert G. Greenberg,
Philippe Flajolet,
Richard E. Ladner:
Estimating the multiplicities of conflicts to speed their resolution in multiple access channels.
J. ACM 34(2): 289-325 (1987) |
| 38 | | Philippe Flajolet,
Jean-Marc Steyaert:
A Complexity Calculus for Recursive Tree Algorithms.
Mathematical Systems Theory 19(4): 301-331 (1987) |
| 37 | | Philippe Flajolet:
Analytic Models and Ambiguity of Context-Free Languages.
Theor. Comput. Sci. 49: 283-309 (1987) |
| 1986 |
|---|
| 36 | | Philippe Flajolet:
The Evolution of Two Stacks in Bounded Space and Random Walks in a Triangle.
MFCS 1986: 325-340 |
| 35 | EE | Philippe Flajolet,
Claude Puech,
Jean Vuillemin:
The analysis of simple list structures.
Inf. Sci. 38(2): 121-146 (1986) |
| 34 | EE | Philippe Flajolet,
Claude Puech:
Partial match retrieval of multidimensional data.
J. ACM 33(2): 371-407 (1986) |
| 33 | | Philippe Flajolet,
Nasser Saheb:
The Complexity of Generating an Exponentially Distributed Variate.
J. Algorithms 7(4): 463-488 (1986) |
| 32 | | Philippe Flajolet,
Helmut Prodinger:
Register Allocation for Unary-Binary Trees.
SIAM J. Comput. 15(3): 629-640 (1986) |
| 31 | | Philippe Flajolet,
Robert Sedgewick:
Digital Search Trees Revisited.
SIAM J. Comput. 15(3): 748-767 (1986) |
| 1985 |
|---|
| 30 | | Philippe Flajolet:
Elements of a general theory of combinatorial structures.
FCT 1985: 112-127 |
| 29 | | Philippe Flajolet:
Ambiguity and Transcendence.
ICALP 1985: 179-188 |
| 28 | | Philippe Flajolet:
Approximate Counting: A Detailed Analysis.
BIT 25(1): 113-134 (1985) |
| 27 | | Peter Mathys,
Philippe Flajolet:
Q -ary collision resolution algorithms in random-access systems with free or blocked channel access.
IEEE Transactions on Information Theory 31(2): 217-243 (1985) |
| 26 | | Guy Fayolle,
Philippe Flajolet,
Micha Hofri,
Philippe Jacquet:
Analysis of a stack algorithm for random multiple-access communication.
IEEE Transactions on Information Theory 31(2): 244-254 (1985) |
| 25 | | Philippe Flajolet,
Thomas Ottmann,
Derick Wood:
Search Trees and Bubble Memories.
ITA 19(2): 137-164 (1985) |
| 24 | | Philippe Flajolet,
G. Nigel Martin:
Probabilistic Counting Algorithms for Data Base Applications.
J. Comput. Syst. Sci. 31(2): 182-209 (1985) |
| 1983 |
|---|
| 23 | | Philippe Flajolet,
Nasser Saheb:
Digital Search Trees and the Generation of an Exponentially Distributed Variate.
CAAP 1983: 221-235 |
| 22 | | Philippe Flajolet:
Methods in the Analysis of Algorithms: Evaluations of a Recursive Partitioning Process.
FCT 1983: 141-158 |
| 21 | | Philippe Flajolet,
Claude Puech:
Tree Structures for Partial Match Retrieval
FOCS 1983: 282-288 |
| 20 | | Philippe Flajolet,
G. Nigel Martin:
Probabilistic Counting
FOCS 1983: 76-82 |
| 19 | | Philippe Flajolet:
On the Performance Evaluation of Extendible Hashing and Trie Searching.
Acta Inf. 20: 345-369 (1983) |
| 18 | | Jean-Marc Steyaert,
Philippe Flajolet:
Patterns and Pattern-Matching in Trees: An Analysis
Information and Control 58(1-3): 19-58 (1983) |
| 1982 |
|---|
| 17 | | Philippe Flajolet,
Jean-Marc Steyaert:
A Branching Process Arising in Dynamic Hashing, Trie Searching and Polynomial Factorization.
ICALP 1982: 239-251 |
| 16 | EE | Philippe Flajolet:
On congruences and continued fractions for some classical combinatorial quantities.
Discrete Mathematics 41(2): 145-153 (1982) |
| 15 | | Philippe Flajolet,
Andrew M. Odlyzko:
The Average Height of Binary Trees and Other Simple Trees.
J. Comput. Syst. Sci. 25(2): 171-213 (1982) |
| 1981 |
|---|
| 14 | | Philippe Flajolet,
Jean-Marc Steyaert:
A Complexity Calculus for Classes of Recursive Search Programs over Tree Structures
FOCS 1981: 386-393 |
| 1980 |
|---|
| 13 | | Philippe Flajolet,
Jean-Marc Steyaert:
On the analysis of tree-matching algorithms.
CLAAP 1980: 22-40 |
| 12 | | Philippe Flajolet,
Andrew M. Odlyzko:
Exploring Binary Trees and Other Simple Trees
FOCS 1980: 207-216 |
| 11 | | Philippe Flajolet,
Jean-Marc Steyaert:
On the Analysis of Tree-Matching Algorithms.
ICALP 1980: 208-219 |
| 10 | EE | Philippe Flajolet:
Combinatorial aspects of continued fractions.
Discrete Mathematics 32(2): 125-161 (1980) |
| 9 | | Philippe Flajolet,
Jean Françon,
Jean Vuillemin:
Sequence of Operations Analysis for Dynamic Data Structures.
J. Algorithms 1(2): 111-141 (1980) |
| 8 | | Philippe Flajolet,
Lyle Ramshaw:
A Note on Gray Code and Odd-Even Merge.
SIAM J. Comput. 9(1): 142-158 (1980) |
| 1979 |
|---|
| 7 | | Philippe Flajolet,
Jean Françon,
Jean Vuillemin:
Towards Analysing Sequences of Operations for Dynamic Data Structures (Preliminary Version)
FOCS 1979: 183-195 |
| 6 | | Philippe Flajolet,
Jean Françon,
Jean Vuillemin:
Computing Integrated Costs of Sequences of Operations with Application to Dictionaries
STOC 1979: 49-61 |
| 5 | | Philippe Flajolet,
Jean-Claude Raoult,
Jean Vuillemin:
The Number of Registers Required for Evaluating Arithmetic Expressions.
Theor. Comput. Sci. 9: 99-125 (1979) |
| 1977 |
|---|
| 4 | | Philippe Flajolet,
Jean-Claude Raoult,
Jean Vuillemin:
On the Average Number of Registers Required for Evaluating Arithmetic Expressions
FOCS 1977: 196-205 |
| 1974 |
|---|
| 3 | | Philippe Flajolet,
Jean-Marc Steyaert:
On Sets Having Only Hard Subsets.
ICALP 1974: 446-457 |
| 1973 |
|---|
| 2 | | Philippe Flajolet,
Jean-Marc Steyaert:
Decision Problems for Multihead Finite Automata.
MFCS 1973: 225-230 |
| 1972 |
|---|
| 1 | | Philippe Flajolet,
Jean-Marc Steyaert:
Complexité des problèmes de décision relatifs aux algorithmes de tri.
ICALP 1972: 537-548 |
