Philippe Flajolet

139 papers A* 26A 4B 6Misc 1Journal 86Unranked 12

Year	Rank	Type	Title / Venue / Authors
2012	J	`jnl`	Some New Self-avoiding Walk and Polygon Models. Fundam. Informaticae Nicholas R. Beaton, Philippe Flajolet, Timothy M. Garoni, Anthony J. Guttmann
2012	J	`jnl`	The distribution of height and diameter in random non-plane binary trees. Random Struct. Algorithms Nicolas Broutin, Philippe Flajolet
2011	A*	`conf`	On Buffon Machines and Numbers. SODA Philippe Flajolet, Maryse Pelletier, Michèle Soria
2011	—	`ed.`	Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2011, San Francisco, California, USA, January 22, 2011 ANALCO Philippe Flajolet, Daniel Panario
2011	J	`jnl`	The enumeration of prudent polygons by area and its unusual asymptotics. J. Comb. Theory A Nicholas R. Beaton, Philippe Flajolet, Anthony J. Guttmann
2011	J	`jnl`	Universal Lossless Data Compression Via Binary Decision Diagrams CoRR John C. Kieffer, Philippe Flajolet, En-Hui Yang
2010	J	`jnl`	Lindelöf Representations and (Non-)Holonomic Sequences. Electron. J. Comb. Philippe Flajolet, Stefan Gerhold, Bruno Salvy
2010	J	`jnl`	Multidimensional Divide-and-Conquer and Weighted Digital Sums CoRR Yun Kuen Cheung, Philippe Flajolet, Mordecai J. Golin, C. Y. James Lee
2009	—	`book`	Analytic Combinatorics. Philippe Flajolet, Robert Sedgewick
2009	—	`conf`	Multidimensional Divide-and-Conquer and Weighted Digital Sums. ANALCO Yun Kuen Cheung, Philippe Flajolet, Mordecai J. Golin, C. Y. James Lee
2009	—	`conf`	The Number of Symbol Comparisons in QuickSort and QuickSelect. ICALP (1) Brigitte Vallée, Julien Clément, James Allen Fill, Philippe Flajolet
2007	A*	`conf`	Analytic combinatorics: a calculus of discrete structures. SODA Philippe Flajolet
2007	—	`conf`	Boltzmann Sampling of Unlabeled Structures. ANALCO Philippe Flajolet, Éric Fusy, Carine Pivoteau
2006	J	`jnl`	A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics. Electron. J. Comb. Philippe Flajolet, Éric Fusy, Xavier Gourdon, Daniel Panario, Nicolas Pouyanne
2006	J	`jnl`	Combinatorial aspects of continued fractions. Discret. Math. Philippe Flajolet
2006	J	`jnl`	Fast computation of special resultants. J. Symb. Comput. Alin Bostan, Philippe Flajolet, Bruno Salvy, Éric Schost
2006	J	`jnl`	Hidden word statistics. J. ACM Philippe Flajolet, Wojciech Szpankowski, Brigitte Vallée
2006	A	`conf`	The Ubiquitous Digital Tree. STACS Philippe Flajolet
2006	J	`jnl`	The scientific works of Rainer Kemp (1949-2004). Theor. Comput. Sci. Philippe Flajolet, Markus E. Nebel, Helmut Prodinger
2005	J	`jnl`	On the Non-Holonomic Character of Logarithms, Powers, and the nth Prime Function. Electron. J. Comb. Philippe Flajolet, Stefan Gerhold, Bruno Salvy
2004	J	`jnl`	Airy Phenomena and Analytic Combinatorics of Connected Graphs. Electron. J. Comb. Philippe Flajolet, Bruno Salvy, Gilles Schaeffer
2004	J	`jnl`	And/Or Trees Revisited. Comb. Probab. Comput. Brigitte Chauvin, Philippe Flajolet, Danièle Gardy, Bernhard Gittenberger
2004	J	`jnl`	Boltzmann Samplers for the Random Generation of Combinatorial Structures. Comb. Probab. Comput. Philippe Duchon, Philippe Flajolet, Guy Louchard, Gilles Schaeffer
2004	—	`conf`	Counting by Coin Tossings. ASIAN Philippe Flajolet
2004	J	`jnl`	Generating functions for generating trees CoRR Cyril Banderier, Philippe Flajolet, Danièle Gardy, Mireille Bousquet-Mélou, Alain Denise, Dominique Gouyou-Beauchamps
2004	—	`conf`	Theory and Practice of Probabilistic Counting Algorithms (Abstract of Invited Talk). ALENEX/ANALC Philippe Flajolet
2003	A	`conf`	Loglog Counting of Large Cardinalities (Extended Abstract). ESA Marianne Durand, Philippe Flajolet
2002	J	`jnl`	Analytic variations on redundancy rates of renewal processes. IEEE Trans. Inf. Theory Philippe Flajolet, Wojciech Szpankowski
2002	J	`jnl`	Basic analytic combinatorics of directed lattice paths. Theor. Comput. Sci. Cyril Banderier, Philippe Flajolet
2002	J	`jnl`	Generating functions for generating trees. Discret. Math. Cyril Banderier, Mireille Bousquet-Mélou, Alain Denise, Philippe Flajolet, Danièle Gardy, Dominique Gouyou-Beauchamps
2002	J	`jnl`	Motif statistics. Theor. Comput. Sci. Pierre Nicodème, Bruno Salvy, Philippe Flajolet
2002	J	`jnl`	On the robustness of interconnections in random graphs: a symbolic approach. Theor. Comput. Sci. Philippe Flajolet, Kostas P. Hatzis, Sotiris E. Nikoletseas, Paul G. Spirakis
2002	A*	`conf`	Random Sampling from Boltzmann Principles. ICALP Philippe Duchon, Philippe Flajolet, Guy Louchard, Gilles Schaeffer
2001	J	`jnl`	Analytic Variations on the Airy Distribution. Algorithmica Philippe Flajolet, Guy Louchard
2001	J	`jnl`	Dynamical Sources in Information Theory: A General Analysis of Trie Structures. Algorithmica Julien Clément, Philippe Flajolet, Brigitte Vallée
2001	J	`jnl`	D·E·K=(1000) Random Struct. Algorithms Philippe Flajolet
2001	A*	`conf`	Hidden Pattern Statistics. ICALP Philippe Flajolet, Yves Guivarc'h, Wojciech Szpankowski, Brigitte Vallée
2001	J	`jnl`	Random maps, coalescing saddles, singularity analysis, and Airy phenomena. Random Struct. Algorithms Cyril Banderier, Philippe Flajolet, Gilles Schaeffer, Michèle Soria
2001	J	`jnl`	The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields. J. Algorithms Philippe Flajolet, Xavier Gourdon, Daniel Panario
2000	J	`jnl`	Analytic Variations on Bucket Selection and Sorting. Acta Informatica Hosam M. Mahmoud, Philippe Flajolet, Philippe Jacquet, Mireille Régnier
2000	A*	`conf`	Planar Maps and Airy Phenomena. ICALP Cyril Banderier, Philippe Flajolet, Gilles Schaeffer, Michèle Soria
2000	—	`conf`	Trade-Offs between Density and Robustness in Random Interconnection Graphs. IFIP TCS Philippe Flajolet, Kostas P. Hatzis, Sotiris E. Nikoletseas, Paul G. Spirakis
1999	J	`jnl`	Analytic combinatorics of non-crossing configurations. Discret. Math. Philippe Flajolet, Marc Noy
1999	A	`conf`	Motif Statistics. ESA Pierre Nicodème, Bruno Salvy, Philippe Flajolet
1999	J	`jnl`	On Stirling Numbers for Complex Arguments and Hankel Contours. SIAM J. Discret. Math. Philippe Flajolet, Helmut Prodinger
1999	J	`jnl`	Properties of Random Triangulations and Trees. Discret. Comput. Geom. Luc Devroye, Philippe Flajolet, Ferran Hurtado, Marc Noy, William L. Steiger
1999	J	`jnl`	Singularity Analysis and Asymptotics of Bernoulli Sums. Theor. Comput. Sci. Philippe Flajolet
1998	—	`conf`	An Analytic Approach to Smooth Polynominals over Finite Fields. ANTS Daniel Panario, Xavier Gourdon, Philippe Flajolet
1998	J	`jnl`	Continued Fraction Algorithms, Functional Operators, and Structure Constants. Theor. Comput. Sci. Philippe Flajolet, Brigitte Vallée
1998	J	`jnl`	Euler Sums and Contour Integral Representations. Exp. Math. Philippe Flajolet, Bruno Salvy
1998	J	`jnl`	On the Analysis of Linear Probing Hashing. Algorithmica Philippe Flajolet, Patricio V. Poblete, Alfredo Viola
1998	A*	`conf`	The Analysis of Hybrid Trie Structures. SODA Julien Clément, Philippe Flajolet, Brigitte Vallée
1997	J	`jnl`	An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction. Comb. Probab. Comput. Hervé Daudé, Philippe Flajolet, Brigitte Vallée
1997	J	`jnl`	Analysis of algorithms. Random Struct. Algorithms Philippe Flajolet, Wojciech Szpankowski
1997	J	`jnl`	Patterns in random binary search trees. Random Struct. Algorithms Philippe Flajolet, Xavier Gourdon, Conrado Martinez
1997	J	`jnl`	The SIGSAM challenges: symbolic asymptotics in practice. SIGSAM Bull. Philippe Flajolet, Bruno Salvy
1996	—	`book`	An introduction to the analysis of algorithms. Robert Sedgewick, Philippe Flajolet
1996	A*	`conf`	Random Polynomials and Polynomial Factorization. ICALP Philippe Flajolet, Xavier Gourdon, Daniel Panario
1995	J	`jnl`	Computer Algebra Libraries for Combinatorial Structures. J. Symb. Comput. Philippe Flajolet, Bruno Salvy
1995	J	`jnl`	Hypergeometrics and the Cost Structure of Quadtrees. Random Struct. Algorithms Philippe Flajolet, Gilbert Labelle, Louise Laforest, Bruno Salvy
1995	J	`jnl`	Mellin Transforms and Asymptotics: Finite Differences and Rice's Integrals. Theor. Comput. Sci. Philippe Flajolet, Robert Sedgewick
1995	J	`jnl`	Mellin Transforms and Asymptotics: Harmonic Sums. Theor. Comput. Sci. Philippe Flajolet, Xavier Gourdon, Philippe Dumas
1994	J	`jnl`	A Calculus for the Random Generation of Labelled Combinatorial Structures. Theor. Comput. Sci. Philippe Flajolet, Paul Zimmermann, Bernard Van Cutsem
1994	—	`conf`	An analysis of the Gaussian algorithm for lattice reduction. ANTS Hervé Daudé, Philippe Flajolet, Brigitte Vallée
1994	J	`jnl`	Mellin Transforms and Asymptotics: Digital Sums. Theor. Comput. Sci. Philippe Flajolet, Peter J. Grabner, Peter Kirschenhofer, Helmut Prodinger, Robert F. Tichy
1994	J	`jnl`	Mellin Transforms and Asymptotics: The Mergesort Recurrence. Acta Informatica Philippe Flajolet, Mordecai J. Golin
1994	J	`jnl`	Search Costs in Quadtrees and Singularity Perturbation Asymptotics. Discret. Comput. Geom. Philippe Flajolet, T. Lafforgue
1993	A	`conf`	A Calculus of Random Generation. ESA Philippe Flajolet, Paul Zimmermann, Bernard Van Cutsem
1993	J	`jnl`	A Finite Sum of Products of Binomial Coefficients (C. C. Grosjean). SIAM Rev. Philippe Flajolet, Bruno Salvy, Helmut Prodinger
1993	J	`jnl`	Analytic Variations on Quadtrees. Algorithmica Philippe Flajolet, Gaston H. Gonnet, Claude Puech, J. M. Robson
1993	A*	`conf`	Exact Asymptotics of Divide-and-Conquer Recurrences. ICALP Philippe Flajolet, Mordecai J. Golin
1993	J	`jnl`	General combinatorial schemas: Gaussian limit distributions and exponential tails. Discret. Math. Philippe Flajolet, Michèle Soria
1993	J	`jnl`	The Distribution of Heights of Binary Trees and Other Simple Trees. Comb. Probab. Comput. Philippe Flajolet, Zhicheng Gao, Andrew M. Odlyzko, L. Bruce Richmond
1992	A*	`conf`	Analytic Analysis of Algorithms. ICALP Philippe Flajolet
1992	J	`jnl`	Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search. Discret. Appl. Math. Philippe Flajolet, Danièle Gardy, Loÿs Thimonier
1992	J	`jnl`	Generalized Digital Trees and Their Difference-Differential Equations. Random Struct. Algorithms Philippe Flajolet, L. Bruce Richmond
1992	J	`jnl`	Page Usage in a Quadtree Index. BIT Mamoru Hoshi, Philippe Flajolet
1992	—	`conf`	Varieties of Increasing Trees. CAAP François Bergeron, Philippe Flajolet, Bruno Salvy
1991	J	`jnl`	Automatic Average-Case Analysis of Algorithm. Theor. Comput. Sci. Philippe Flajolet, Bruno Salvy, Paul Zimmermann
1991	A*	`conf`	The Analysis of Multidimensional Searching in Quad-Trees. SODA Philippe Flajolet, Gaston H. Gonnet, Claude Puech, J. M. Robson
1991	J	`jnl`	The Cycle Construction. SIAM J. Discret. Math. Philippe Flajolet, Michèle Soria
1990	A*	`conf`	Analytic Variations on the Common Subexpression Problem. ICALP Philippe Flajolet, Paolo Sipala, Jean-Marc Steyaert
1990	—	`ch.`	Average-Case Analysis of Algorithms and Data Structures. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) Jeffrey Scott Vitter, Philippe Flajolet
1990	J	`jnl`	Gaussian limiting distributions for the number of components in combinatorial structures. J. Comb. Theory A Philippe Flajolet, Michèle Soria
1990	J	`jnl`	Non-overlapping Partitions, Continued Fractions, Bessel Functions and a Divergent Series. Eur. J. Comb. Philippe Flajolet, René Schott
1990	J	`jnl`	On adaptive sampling. Computing Philippe Flajolet
1990	J	`jnl`	Singularity Analysis of Generating Functions. SIAM J. Discret. Math. Philippe Flajolet, Andrew M. Odlyzko
1990	A*	`conf`	The Lattice Reduction Algorithm of Gauss: An Average Case Analysis FOCS Brigitte Vallée, Philippe Flajolet
1989	B	`conf`	Analysis of KDT-Trees: KD-Trees Improved by Local Reogranisations. WADS Walter Cunto, Gustavo Lau, Philippe Flajolet
1989	J	`jnl`	Average cost of orthogonal range queries in multiattribute trees. Inf. Syst. Danièle Gardy, Philippe Flajolet, Claude Puech
1989	J	`jnl`	Elliptic Functions, Continued Fractions and Doubled Permutations. Eur. J. Comb. Philippe Flajolet, Jean Françon
1989	B	`conf`	On the Performance of Orthogonal Range Queries in Multiattribute and Doubly Chained Trees. WADS Danièle Gardy, Philippe Flajolet, Claude Puech
1989	A*	`conf`	Random Mapping Statistics. EUROCRYPT Philippe Flajolet, Andrew M. Odlyzko
1989	J	`jnl`	The first cycles in an evolving graph. Discret. Math. Philippe Flajolet, Donald E. Knuth, Boris G. Pittel
1988	—	`conf`	Lambda - Upsilon - Omega: An Assistant Algorithms Analyzer. AAECC Philippe Flajolet, Bruno Salvy, Paul Zimmermann
1988	A*	`conf`	Random Allocations and Probabilistic Languages. ICALP Philippe Flajolet, Danièle Gardy, Loÿs Thimonier
1987	J	`jnl`	A Complexity Calculus for Recursive Tree Algorithms. Math. Syst. Theory Philippe Flajolet, Jean-Marc Steyaert
1987	J	`jnl`	Analytic Models and Ambiguity of Context-Free Languages. Theor. Comput. Sci. Philippe Flajolet
1987	J	`jnl`	Estimating the multiplicities of conflicts to speed their resolution in multiple access channels. J. ACM Albert G. Greenberg, Philippe Flajolet, Richard E. Ladner
1987	J	`jnl`	Level number sequences for trees. Discret. Math. Philippe Flajolet, Helmut Prodinger
1987	J	`jnl`	Prefixes of Infinite Words and Ambiguous Context-Free Languages. Inf. Process. Lett. Jean-Michel Autebert, Philippe Flajolet, Joaquim Gabarró
1987	Misc	`conf`	Random Tree Models in the Analysis of Algorithms. Performance Philippe Flajolet
1986	J	`jnl`	Digital Search Trees Revisited. SIAM J. Comput. Philippe Flajolet, Robert Sedgewick
1986	J	`jnl`	Partial match retrieval of multidimensional data. J. ACM Philippe Flajolet, Claude Puech
1986	J	`jnl`	Register Allocation for Unary-Binary Trees. SIAM J. Comput. Philippe Flajolet, Helmut Prodinger
1986	J	`jnl`	The Complexity of Generating an Exponentially Distributed Variate. J. Algorithms Philippe Flajolet, Nasser Saheb
1986	B	`conf`	The Evolution of Two Stacks in Bounded Space and Random Walks in a Triangle. MFCS Philippe Flajolet
1986	J	`jnl`	The analysis of simple list structures. Inf. Sci. Philippe Flajolet, Claude Puech, Jean Vuillemin
1985	A*	`conf`	Ambiguity and Transcendence. ICALP Philippe Flajolet
1985	J	`jnl`	Analysis of a stack algorithm for random multiple-access communication. IEEE Trans. Inf. Theory Guy Fayolle, Philippe Flajolet, Micha Hofri, Philippe Jacquet
1985	J	`jnl`	Approximate Counting: A Detailed Analysis. BIT Philippe Flajolet
1985	B	`conf`	Elements of a general theory of combinatorial structures. FCT Philippe Flajolet
1985	J	`jnl`	Probabilistic Counting Algorithms for Data Base Applications. J. Comput. Syst. Sci. Philippe Flajolet, G. Nigel Martin
1985	J	`jnl`	Q -ary collision resolution algorithms in random-access systems with free or blocked channel access. IEEE Trans. Inf. Theory Peter Mathys, Philippe Flajolet
1985	J	`jnl`	Search Trees and Bubble Memories. RAIRO Theor. Informatics Appl. Philippe Flajolet, Thomas Ottmann, Derick Wood
1983	—	`conf`	Digital Search Trees and the Generation of an Exponentially Distributed Variate. CAAP Philippe Flajolet, Nasser Saheb
1983	B	`conf`	Methods in the Analysis of Algorithms: Evaluations of a Recursive Partitioning Process. FCT Philippe Flajolet
1983	J	`jnl`	On the Performance Evaluation of Extendible Hashing and Trie Searching. Acta Informatica Philippe Flajolet
1983	J	`jnl`	Patterns and Pattern-Matching in Trees: An Analysis Inf. Control. Jean-Marc Steyaert, Philippe Flajolet
1983	A*	`conf`	Probabilistic Counting FOCS Philippe Flajolet, G. Nigel Martin
1983	A*	`conf`	Tree Structures for Partial Match Retrieval FOCS Philippe Flajolet, Claude Puech
1982	A*	`conf`	A Branching Process Arising in Dynamic Hashing, Trie Searching and Polynomial Factorization. ICALP Philippe Flajolet, Jean-Marc Steyaert
1982	J	`jnl`	On congruences and continued fractions for some classical combinatorial quantities. Discret. Math. Philippe Flajolet
1982	J	`jnl`	The Average Height of Binary Trees and Other Simple Trees. J. Comput. Syst. Sci. Philippe Flajolet, Andrew M. Odlyzko
1981	A*	`conf`	A Complexity Calculus for Classes of Recursive Search Programs over Tree Structures FOCS Philippe Flajolet, Jean-Marc Steyaert
1980	J	`jnl`	A Note on Gray Code and Odd-Even Merge. SIAM J. Comput. Philippe Flajolet, Lyle Ramshaw
1980	J	`jnl`	Combinatorial aspects of continued fractions. Discret. Math. Philippe Flajolet
1980	A*	`conf`	Exploring Binary Trees and Other Simple Trees FOCS Philippe Flajolet, Andrew M. Odlyzko
1980	A*	`conf`	On the Analysis of Tree-Matching Algorithms. ICALP Philippe Flajolet, Jean-Marc Steyaert
1980	—	`conf`	On the analysis of tree-matching algorithms. CLAAP Philippe Flajolet, Jean-Marc Steyaert
1980	J	`jnl`	Sequence of Operations Analysis for Dynamic Data Structures. J. Algorithms Philippe Flajolet, Jean Françon, Jean Vuillemin
1979	A*	`conf`	Computing Integrated Costs of Sequences of Operations with Application to Dictionaries STOC Philippe Flajolet, Jean Françon, Jean Vuillemin
1979	J	`jnl`	The Number of Registers Required for Evaluating Arithmetic Expressions. Theor. Comput. Sci. Philippe Flajolet, Jean-Claude Raoult, Jean Vuillemin
1979	A*	`conf`	Towards Analysing Sequences of Operations for Dynamic Data Structures (Preliminary Version) FOCS Philippe Flajolet, Jean Françon, Jean Vuillemin
1977	A*	`conf`	On the Average Number of Registers Required for Evaluating Arithmetic Expressions FOCS Philippe Flajolet, Jean-Claude Raoult, Jean Vuillemin
1974	A*	`conf`	On Sets Having Only Hard Subsets. ICALP Philippe Flajolet, Jean-Marc Steyaert
1974	J	`jnl`	Une généralisation de la notion d'ensemble immune. RAIRO Theor. Informatics Appl. Philippe Flajolet, Jean-Marc Steyaert
1973	B	`conf`	Decision Problems for Multihead Finite Automata. MFCS Philippe Flajolet, Jean-Marc Steyaert
1972	A*	`conf`	Complexité des problèmes de décision relatifs aux algorithmes de tri. ICALP Philippe Flajolet, Jean-Marc Steyaert