Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilippe Flajolet
Person information
- affiliation: INRIA, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2012
[j83]Nicholas R. Beaton
, Philippe Flajolet, Timothy M. Garoni, Anthony J. Guttmann:
Some New Self-avoiding Walk and Polygon Models. Fundam. Informaticae 117(1-4): 19-33 (2012)- [j82]Nicolas Broutin, Philippe Flajolet:
The distribution of height and diameter in random non-plane binary trees. Random Struct. Algorithms 41(2): 215-252 (2012) - 2011
- [j81]Nicholas R. Beaton, Philippe Flajolet, Anthony J. Guttmann:
The enumeration of prudent polygons by area and its unusual asymptotics. J. Comb. Theory, Ser. A 118(8): 2261-2290 (2011) - [c49]Philippe Flajolet, Maryse Pelletier, Michèle Soria:
On Buffon Machines and Numbers. SODA 2011: 172-183 - [e1]Philippe Flajolet, Daniel Panario:
Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2011, San Francisco, California, USA, January 22, 2011. SIAM 2011, ISBN 978-1-61197-301-3 [contents] - [i3]John C. Kieffer, Philippe Flajolet, En-Hui Yang:
Universal Lossless Data Compression Via Binary Decision Diagrams. CoRR abs/1111.1432 (2011) - 2010
- [j80]Philippe Flajolet, Stefan Gerhold, Bruno Salvy:
Lindelöf Representations and (Non-)Holonomic Sequences. Electron. J. Comb. 17(1) (2010) - [i2]Yun Kuen Cheung, Philippe Flajolet, Mordecai J. Golin, C. Y. James Lee:
Multidimensional Divide-and-Conquer and Weighted Digital Sums. CoRR abs/1003.0150 (2010)
2000 – 2009
- 2009
- [b2]Philippe Flajolet, Robert Sedgewick:
Analytic Combinatorics. Cambridge University Press 2009, ISBN 978-0-521-89806-5, pp. I-XIII, 1-810 - [c48]Yun Kuen Cheung, Philippe Flajolet, Mordecai J. Golin, C. Y. James Lee:
Multidimensional Divide-and-Conquer and Weighted Digital Sums. ANALCO 2009: 58-74 - [c47]Brigitte Vallée, Julien Clément, James Allen Fill, Philippe Flajolet:
The Number of Symbol Comparisons in QuickSort and QuickSelect. ICALP (1) 2009: 750-763 - 2007
- [c46]Philippe Flajolet, Éric Fusy, Carine Pivoteau:
Boltzmann Sampling of Unlabeled Structures. ANALCO 2007: 201-211 - [c45]Philippe Flajolet:
Analytic combinatorics: a calculus of discrete structures. SODA 2007: 137-148 - 2006
- [j79]Philippe Flajolet, Éric Fusy, Xavier Gourdon, Daniel Panario, Nicolas Pouyanne:
A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics. Electron. J. Comb. 13(1) (2006) - [j78]Philippe Flajolet:
Combinatorial aspects of continued fractions. Discret. Math. 306(10-11): 992-1021 (2006) - [j77]Philippe Flajolet, Wojciech Szpankowski, Brigitte Vallée:
Hidden word statistics. J. ACM 53(1): 147-183 (2006) - [j76]Alin Bostan, Philippe Flajolet, Bruno Salvy, Éric Schost:
Fast computation of special resultants. J. Symb. Comput. 41(1): 1-29 (2006) - [j75]Philippe Flajolet, Markus E. Nebel, Helmut Prodinger:
The scientific works of Rainer Kemp (1949-2004). Theor. Comput. Sci. 355(3): 371-381 (2006) - [c44]Philippe Flajolet:
The Ubiquitous Digital Tree. STACS 2006: 1-22 - 2005
- [j74]Philippe Flajolet, Stefan Gerhold, Bruno Salvy:
On the Non-Holonomic Character of Logarithms, Powers, and the nth Prime Function. Electron. J. Comb. 11(2) (2005) - 2004
- [j73]Philippe Flajolet, Bruno Salvy, Gilles Schaeffer:
Airy Phenomena and Analytic Combinatorics of Connected Graphs. Electron. J. Comb. 11(1) (2004) - [j72]Brigitte Chauvin, Philippe Flajolet, Danièle Gardy, Bernhard Gittenberger:
And/Or Trees Revisited. Comb. Probab. Comput. 13(4-5): 475-497 (2004) - [j71]Philippe Duchon, Philippe Flajolet, Guy Louchard, Gilles Schaeffer:
Boltzmann Samplers for the Random Generation of Combinatorial Structures. Comb. Probab. Comput. 13(4-5): 577-625 (2004) - [c43]Philippe Flajolet:
Theory and Practice of Probabilistic Counting Algorithms (Abstract of Invited Talk). ALENEX/ANALC 2004: 152 - [c42]Philippe Flajolet:
Counting by Coin Tossings. ASIAN 2004: 1-12 - [i1]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) - 2003
- [c41]Marianne Durand, Philippe Flajolet:
Loglog Counting of Large Cardinalities (Extended Abstract). ESA 2003: 605-617 - 2002
- [j70]Cyril Banderier, Mireille Bousquet-Mélou, Alain Denise, Philippe Flajolet, Danièle Gardy, Dominique Gouyou-Beauchamps:
Generating functions for generating trees. Discret. Math. 246(1-3): 29-55 (2002) - [j69]Cyril Banderier, Philippe Flajolet:
Basic analytic combinatorics of directed lattice paths. Theor. Comput. Sci. 281(1-2): 37-80 (2002) - [j68]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) - [j67]Pierre Nicodème, Bruno Salvy, Philippe Flajolet:
Motif statistics. Theor. Comput. Sci. 287(2): 593-617 (2002) - [j66]Philippe Flajolet, Wojciech Szpankowski:
Analytic variations on redundancy rates of renewal processes. IEEE Trans. Inf. Theory 48(11): 2911-2921 (2002) - [c40]Philippe Duchon, Philippe Flajolet, Guy Louchard, Gilles Schaeffer:
Random Sampling from Boltzmann Principles. ICALP 2002: 501-513 - 2001
- [j65]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) - [j64]Philippe Flajolet, Guy Louchard:
Analytic Variations on the Airy Distribution. Algorithmica 31(3): 361-377 (2001) - [j63]Philippe Flajolet, Xavier Gourdon, Daniel Panario:
The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields. J. Algorithms 40(1): 37-81 (2001) - [j62]Philippe Flajolet:
D·E·K=(1000)8. Random Struct. Algorithms 19(3-4): 150-162 (2001) - [j61]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) - [c39]Philippe Flajolet, Yves Guivarc'h, Wojciech Szpankowski, Brigitte Vallée:
Hidden Pattern Statistics. ICALP 2001: 152-165 - 2000
- [j60]Hosam M. Mahmoud, Philippe Flajolet, Philippe Jacquet, Mireille Régnier:
Analytic Variations on Bucket Selection and Sorting. Acta Informatica 36(9/10): 735-760 (2000) - [c38]Cyril Banderier, Philippe Flajolet, Gilles Schaeffer, Michèle Soria:
Planar Maps and Airy Phenomena. ICALP 2000: 388-402 - [c37]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
1990 – 1999
- 1999
- [j59]Luc Devroye, Philippe Flajolet, Ferran Hurtado, Marc Noy, William L. Steiger:
Properties of Random Triangulations and Trees. Discret. Comput. Geom. 22(1): 105-117 (1999) - [j58]Philippe Flajolet, Marc Noy:
Analytic combinatorics of non-crossing configurations. Discret. Math. 204(1-3): 203-229 (1999) - [j57]Philippe Flajolet, Helmut Prodinger:
On Stirling Numbers for Complex Arguments and Hankel Contours. SIAM J. Discret. Math. 12(2): 155-159 (1999) - [j56]Philippe Flajolet:
Singularity Analysis and Asymptotics of Bernoulli Sums. Theor. Comput. Sci. 215(1-2): 371-381 (1999) - [c36]Pierre Nicodème, Bruno Salvy, Philippe Flajolet:
Motif Statistics. ESA 1999: 194-211 - 1998
- [j55]Philippe Flajolet, Patricio V. Poblete, Alfredo Viola:
On the Analysis of Linear Probing Hashing. Algorithmica 22(4): 490-515 (1998) - [j54]Philippe Flajolet, Bruno Salvy:
Euler Sums and Contour Integral Representations. Exp. Math. 7(1): 15-35 (1998) - [j53]Philippe Flajolet, Brigitte Vallée:
Continued Fraction Algorithms, Functional Operators, and Structure Constants. Theor. Comput. Sci. 194(1-2): 1-34 (1998) - [c35]Daniel Panario, Xavier Gourdon, Philippe Flajolet:
An Analytic Approach to Smooth Polynominals over Finite Fields. ANTS 1998: 226-236 - [c34]Julien Clément, Philippe Flajolet, Brigitte Vallée:
The Analysis of Hybrid Trie Structures. SODA 1998: 531-539 - 1997
- [j52]Philippe Flajolet, Bruno Salvy:
The SIGSAM challenges: symbolic asymptotics in practice. SIGSAM Bull. 31(4): 36-47 (1997) - [j51]Hervé Daudé, Philippe Flajolet, Brigitte Vallée:
An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction. Comb. Probab. Comput. 6(4): 397-433 (1997) - [j50]Philippe Flajolet, Wojciech Szpankowski:
Analysis of algorithms. Random Struct. Algorithms 10(1-2): 1-3 (1997) - [j49]Philippe Flajolet, Xavier Gourdon, Conrado Martinez:
Patterns in random binary search trees. Random Struct. Algorithms 11(3): 223-244 (1997) - 1996
- [b1]Robert Sedgewick, Philippe Flajolet:
An introduction to the analysis of algorithms. Addison-Wesley-Longman 1996, ISBN 978-0-201-40009-0, pp. I-XV, 1-492 - [c33]Philippe Flajolet, Xavier Gourdon, Daniel Panario:
Random Polynomials and Polynomial Factorization. ICALP 1996: 232-243 - 1995
- [j48]Philippe Flajolet, Bruno Salvy:
Computer Algebra Libraries for Combinatorial Structures. J. Symb. Comput. 20(5/6): 653-671 (1995) - [j47]Philippe Flajolet, Gilbert Labelle, Louise Laforest, Bruno Salvy:
Hypergeometrics and the Cost Structure of Quadtrees. Random Struct. Algorithms 7(2): 117-144 (1995) - [j46]Philippe Flajolet, Xavier Gourdon, Philippe Dumas:
Mellin Transforms and Asymptotics: Harmonic Sums. Theor. Comput. Sci. 144(1&2): 3-58 (1995) - [j45]Philippe Flajolet, Robert Sedgewick:
Mellin Transforms and Asymptotics: Finite Differences and Rice's Integrals. Theor. Comput. Sci. 144(1&2): 101-124 (1995) - 1994
- [j44]Philippe Flajolet, Mordecai J. Golin:
Mellin Transforms and Asymptotics: The Mergesort Recurrence. Acta Informatica 31(7): 673-696 (1994) - [j43]Philippe Flajolet, T. Lafforgue:
Search Costs in Quadtrees and Singularity Perturbation Asymptotics. Discret. Comput. Geom. 12: 151-175 (1994) - [j42]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) - [j41]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) - [c32]Hervé Daudé, Philippe Flajolet, Brigitte Vallée:
An analysis of the Gaussian algorithm for lattice reduction. ANTS 1994: 144-158 - 1993
- [j40]Philippe Flajolet, Gaston H. Gonnet, Claude Puech, J. M. Robson:
Analytic Variations on Quadtrees. Algorithmica 10(6): 473-500 (1993) - [j39]Philippe Flajolet, Zhicheng Gao, Andrew M. Odlyzko, L. Bruce Richmond:
The Distribution of Heights of Binary Trees and Other Simple Trees. Comb. Probab. Comput. 2: 145-156 (1993) - [j38]Philippe Flajolet, Michèle Soria:
General combinatorial schemas: Gaussian limit distributions and exponential tails. Discret. Math. 114(1-3): 159-180 (1993) - [j37]Philippe Flajolet, Bruno Salvy, Helmut Prodinger:
A Finite Sum of Products of Binomial Coefficients (C. C. Grosjean). SIAM Rev. 35(4): 645-647 (1993) - [c31]Philippe Flajolet, Paul Zimmermann, Bernard Van Cutsem:
A Calculus of Random Generation. ESA 1993: 169-180 - [c30]Philippe Flajolet, Mordecai J. Golin:
Exact Asymptotics of Divide-and-Conquer Recurrences. ICALP 1993: 137-149 - 1992
- [j36]Mamoru Hoshi, Philippe Flajolet:
Page Usage in a Quadtree Index. BIT 32(3): 384-402 (1992) - [j35]Philippe Flajolet, Danièle Gardy, Loÿs Thimonier:
Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search. Discret. Appl. Math. 39(3): 207-229 (1992) - [j34]Philippe Flajolet, L. Bruce Richmond:
Generalized Digital Trees and Their Difference-Differential Equations. Random Struct. Algorithms 3(3): 305-320 (1992) - [c29]François Bergeron, Philippe Flajolet, Bruno Salvy:
Varieties of Increasing Trees. CAAP 1992: 24-48 - [c28]Philippe Flajolet:
Analytic Analysis of Algorithms. ICALP 1992: 186-210 - 1991
- [j33]Philippe Flajolet, Michèle Soria:
The Cycle Construction. SIAM J. Discret. Math. 4(1): 58-60 (1991) - [j32]Philippe Flajolet, Bruno Salvy, Paul Zimmermann:
Automatic Average-Case Analysis of Algorithm. Theor. Comput. Sci. 79(1): 37-109 (1991) - [c27]Philippe Flajolet, Gaston H. Gonnet, Claude Puech, J. M. Robson:
The Analysis of Multidimensional Searching in Quad-Trees. SODA 1991: 100-109 - 1990
- [j31]Philippe Flajolet:
On adaptive sampling. Computing 43(4): 391-400 (1990) - [j30]Philippe Flajolet, René Schott:
Non-overlapping Partitions, Continued Fractions, Bessel Functions and a Divergent Series. Eur. J. Comb. 11(5): 421-432 (1990) - [j29]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) - [j28]Philippe Flajolet, Andrew M. Odlyzko:
Singularity Analysis of Generating Functions. SIAM J. Discret. Math. 3(2): 216-240 (1990) - [c26]Brigitte Vallée, Philippe Flajolet:
The Lattice Reduction Algorithm of Gauss: An Average Case Analysis. FOCS 1990: 830-839 - [c25]Philippe Flajolet, Paolo Sipala, Jean-Marc Steyaert:
Analytic Variations on the Common Subexpression Problem. ICALP 1990: 220-234 - [p1]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
1980 – 1989
- 1989
- [j27]Philippe Flajolet, Donald E. Knuth, Boris G. Pittel:
The first cycles in an evolving graph. Discret. Math. 75(1-3): 167-215 (1989) - [j26]Philippe Flajolet, Jean Françon:
Elliptic Functions, Continued Fractions and Doubled Permutations. Eur. J. Comb. 10(3): 235-241 (1989) - [j25]Danièle Gardy, Philippe Flajolet, Claude Puech:
Average cost of orthogonal range queries in multiattribute trees. Inf. Syst. 14(4): 341-350 (1989) - [c24]Philippe Flajolet, Andrew M. Odlyzko:
Random Mapping Statistics. EUROCRYPT 1989: 329-354 - [c23]Walter Cunto, Gustavo Lau, Philippe Flajolet:
Analysis of KDT-Trees: KD-Trees Improved by Local Reogranisations. WADS 1989: 24-38 - [c22]Danièle Gardy, Philippe Flajolet, Claude Puech:
On the Performance of Orthogonal Range Queries in Multiattribute and Doubly Chained Trees. WADS 1989: 218-229 - 1988
- [c21]Philippe Flajolet, Bruno Salvy, Paul Zimmermann:
Lambda - Upsilon - Omega: An Assistant Algorithms Analyzer. AAECC 1988: 201-212 - [c20]Philippe Flajolet, Danièle Gardy, Loÿs Thimonier:
Random Allocations and Probabilistic Languages. ICALP 1988: 239-253 - 1987
- [j24]Philippe Flajolet, Helmut Prodinger:
Level number sequences for trees. Discret. Math. 65(2): 149-156 (1987) - [j23]Jean-Michel Autebert, Philippe Flajolet, Joaquim Gabarró:
Prefixes of Infinite Words and Ambiguous Context-Free Languages. Inf. Process. Lett. 25(4): 211-216 (1987) - [j22]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) - [j21]Philippe Flajolet, Jean-Marc Steyaert:
A Complexity Calculus for Recursive Tree Algorithms. Math. Syst. Theory 19(4): 301-331 (1987) - [j20]Philippe Flajolet:
Analytic Models and Ambiguity of Context-Free Languages. Theor. Comput. Sci. 49: 283-309 (1987) - [c19]Philippe Flajolet:
Random Tree Models in the Analysis of Algorithms. Performance 1987: 171-187 - 1986
- [j19]Philippe Flajolet, Claude Puech, Jean Vuillemin:
The analysis of simple list structures. Inf. Sci. 38(2): 121-146 (1986) - [j18]Philippe Flajolet, Claude Puech:
Partial match retrieval of multidimensional data. J. ACM 33(2): 371-407 (1986) - [j17]Philippe Flajolet, Nasser Saheb:
The Complexity of Generating an Exponentially Distributed Variate. J. Algorithms 7(4): 463-488 (1986) - [j16]Philippe Flajolet, Helmut Prodinger:
Register Allocation for Unary-Binary Trees. SIAM J. Comput. 15(3): 629-640 (1986) - [j15]Philippe Flajolet, Robert Sedgewick:
Digital Search Trees Revisited. SIAM J. Comput. 15(3): 748-767 (1986) - [c18]Philippe Flajolet:
The Evolution of Two Stacks in Bounded Space and Random Walks in a Triangle. MFCS 1986: 325-340 - 1985
- [j14]Philippe Flajolet:
Approximate Counting: A Detailed Analysis. BIT 25(1): 113-134 (1985) - [j13]Philippe Flajolet, Thomas Ottmann, Derick Wood:
Search Trees and Bubble Memories. RAIRO Theor. Informatics Appl. 19(2): 137-164 (1985) - [j12]Philippe Flajolet, G. Nigel Martin:
Probabilistic Counting Algorithms for Data Base Applications. J. Comput. Syst. Sci. 31(2): 182-209 (1985) - [j11]Peter Mathys, Philippe Flajolet:
Q -ary collision resolution algorithms in random-access systems with free or blocked channel access. IEEE Trans. Inf. Theory 31(2): 217-243 (1985) - [j10]Guy Fayolle, Philippe Flajolet, Micha Hofri, Philippe Jacquet:
Analysis of a stack algorithm for random multiple-access communication. IEEE Trans. Inf. Theory 31(2): 244-254 (1985) - [c17]Philippe Flajolet:
Elements of a general theory of combinatorial structures. FCT 1985: 112-127 - [c16]Philippe Flajolet:
Ambiguity and Transcendence. ICALP 1985: 179-188 - 1983
- [j9]Philippe Flajolet:
On the Performance Evaluation of Extendible Hashing and Trie Searching. Acta Informatica 20: 345-369 (1983) - [j8]Jean-Marc Steyaert, Philippe Flajolet:
Patterns and Pattern-Matching in Trees: An Analysis. Inf. Control. 58(1-3): 19-58 (1983) - [c15]Philippe Flajolet, Nasser Saheb:
Digital Search Trees and the Generation of an Exponentially Distributed Variate. CAAP 1983: 221-235 - [c14]Philippe Flajolet:
Methods in the Analysis of Algorithms: Evaluations of a Recursive Partitioning Process. FCT 1983: 141-158 - [c13]