The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Philippe Flajolet: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  116. On the analysis of tree-matching algorithms. [Citation Graph (, )][DBLP]


  117. The Number of Symbol Comparisons in QuickSort and QuickSelect. [Citation Graph (, )][DBLP]


  118. A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics. [Citation Graph (, )][DBLP]


  119. Multidimensional Divide-and-Conquer and Weighted Digital Sums [Citation Graph (, )][DBLP]


Search in 0.158secs, Finished in 0.166secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002