Philippe Flajolet

Random Struct. Algorithms, 2012

Some New Self-avoiding Walk and Polygon Models.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

2011

The enumeration of prudent polygons by area and its unusual asymptotics.

[BibT_eX]

[DOI]

Nicholas R. Beaton

Anthony J. Guttmann

J. Comb. Theory, Ser. A, 2011

Universal Lossless Data Compression Via Binary Decision Diagrams

[BibT_eX]

[DOI]

John C. Kieffer

En-Hui Yang

CoRR, 2011

On Buffon Machines and Numbers.

[BibT_eX]

[DOI]

Maryse Pelletier

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010

Lindelöf Representations and (Non-)Holonomic Sequences.

[BibT_eX]

[DOI]

Stefan Gerhold

Electron. J. Comb., 2010

2009

The Number of Symbol Comparisons in QuickSort and QuickSelect.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

Multidimensional Divide-and-Conquer and Weighted Digital Sums.

[BibT_eX]

[DOI]

Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, 2009

Analytic Combinatorics.

[BibT_eX]

[DOI]

Cambridge University Press, ISBN: 978-0-521-89806-5, 2009

2007

Analytic combinatorics: a calculus of discrete structures.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Boltzmann Sampling of Unlabeled Structures.

[BibT_eX]

[DOI]

Éric Fusy

Carine Pivoteau

Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics, 2007

2006

The scientific works of Rainer Kemp (1949-2004).

[BibT_eX]

[DOI]

Markus E. Nebel

Theor. Comput. Sci., 2006

Fast computation of special resultants.

[BibT_eX]

[DOI]

J. Symb. Comput., 2006

Hidden word statistics.

[BibT_eX]

[DOI]

Wojciech Szpankowski

J. ACM, 2006

Combinatorial aspects of continued fractions.

[BibT_eX]

[DOI]

Discret. Math., 2006

A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

The Ubiquitous Digital Tree.

[BibT_eX]

[DOI]

Proceedings of the STACS 2006, 2006

2005

On the Non-Holonomic Character of Logarithms, Powers, and the nth Prime Function.

[BibT_eX]

[DOI]

Stefan Gerhold

Electron. J. Comb., 2005

2004

Boltzmann Samplers for the Random Generation of Combinatorial Structures.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2004

And/Or Trees Revisited.

[BibT_eX]

[DOI]

Brigitte Chauvin

Bernhard Gittenberger

Comb. Probab. Comput., 2004

Airy Phenomena and Analytic Combinatorics of Connected Graphs.

[BibT_eX]

[DOI]

Gilles Schaeffer

Electron. J. Comb., 2004

Counting by Coin Tossings.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computer Science, 2004

Theory and Practice of Probabilistic Counting Algorithms (Abstract of Invited Talk).

[BibT_eX]

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003

Loglog Counting of Large Cardinalities (Extended Abstract).

[BibT_eX]

[DOI]

Marianne Durand

Proceedings of the Algorithms, 2003

2002

Analytic variations on redundancy rates of renewal processes.

[BibT_eX]

[DOI]

Wojciech Szpankowski

IEEE Trans. Inf. Theory, 2002

Motif statistics.

[BibT_eX]

[DOI]

Pierre Nicodème

Theor. Comput. Sci., 2002

On the robustness of interconnections in random graphs: a symbolic approach.

[BibT_eX]

[DOI]

Kostas P. Hatzis

Sotiris E. Nikoletseas

Paul G. Spirakis

Theor. Comput. Sci., 2002

Basic analytic combinatorics of directed lattice paths.

[BibT_eX]

[DOI]

Cyril Banderier

Theor. Comput. Sci., 2002

Generating functions for generating trees.

[BibT_eX]

[DOI]

Cyril Banderier

Mireille Bousquet-Mélou

Alain Denise

Dominique Gouyou-Beauchamps

Discret. Math., 2002

Random Sampling from Boltzmann Principles.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001

D·E·K=(1000)<sub>8</sub>.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2001

Random maps, coalescing saddles, singularity analysis, and Airy phenomena.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2001

The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields.

[BibT_eX]

[DOI]

Daniel Panario

J. Algorithms, 2001

Analytic Variations on the Airy Distribution.

[BibT_eX]

[DOI]

Guy Louchard

Algorithmica, 2001

Dynamical Sources in Information Theory: A General Analysis of Trie Structures.

[BibT_eX]

[DOI]

Julien Clément

Algorithmica, 2001

Hidden Pattern Statistics.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000

Analytic Variations on Bucket Selection and Sorting.

[BibT_eX]

[DOI]

Acta Informatica, 2000

Trade-Offs between Density and Robustness in Random Interconnection Graphs.

[BibT_eX]

[DOI]

Kostas P. Hatzis

Sotiris E. Nikoletseas

Paul G. Spirakis

Proceedings of the Theoretical Computer Science, 2000

Planar Maps and Airy Phenomena.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999

Singularity Analysis and Asymptotics of Bernoulli Sums.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

On Stirling Numbers for Complex Arguments and Hankel Contours.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1999

Analytic combinatorics of non-crossing configurations.

[BibT_eX]

[DOI]

Marc Noy

Discret. Math., 1999

Properties of Random Triangulations and Trees.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1999

1998

Continued Fraction Algorithms, Functional Operators, and Structure Constants.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Euler Sums and Contour Integral Representations.

[BibT_eX]

[DOI]

Exp. Math., 1998

On the Analysis of Linear Probing Hashing.

[BibT_eX]

[DOI]

Patricio V. Poblete

Alfredo Viola

Algorithmica, 1998

The Analysis of Hybrid Trie Structures.

[BibT_eX]

[DOI]

Julien Clément

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

An Analytic Approach to Smooth Polynominals over Finite Fields.

[BibT_eX]

[DOI]

Daniel Panario

Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998

1997

Analysis of algorithms.

[BibT_eX]

[DOI]

Wojciech Szpankowski

Random Struct. Algorithms, 1997

Patterns in random binary search trees.

[BibT_eX]

[DOI]

Conrado Martinez

Random Struct. Algorithms, 1997

An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction.

[BibT_eX]

[DOI]

Hervé Daudé

Comb. Probab. Comput., 1997

The SIGSAM challenges: symbolic asymptotics in practice.

[BibT_eX]

[DOI]

SIGSAM Bull., 1997

1996

Random Polynomials and Polynomial Factorization.

[BibT_eX]

[DOI]

Daniel Panario

Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

An introduction to the analysis of algorithms.

[BibT_eX]

Addison-Wesley-Longman, ISBN: 978-0-201-40009-0, 1996

1995

Mellin Transforms and Asymptotics: Finite Differences and Rice's Integrals.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Mellin Transforms and Asymptotics: Harmonic Sums.

[BibT_eX]

[DOI]

Philippe Dumas

Theor. Comput. Sci., 1995

Hypergeometrics and the Cost Structure of Quadtrees.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1995

Computer Algebra Libraries for Combinatorial Structures.

[BibT_eX]

[DOI]

J. Symb. Comput., 1995

1994

A Calculus for the Random Generation of Labelled Combinatorial Structures.

[BibT_eX]

[DOI]

Bernard Van Cutsem

Theor. Comput. Sci., 1994

Mellin Transforms and Asymptotics: Digital Sums.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Search Costs in Quadtrees and Singularity Perturbation Asymptotics.

[BibT_eX]

[DOI]

T. Lafforgue

Discret. Comput. Geom., 1994

Mellin Transforms and Asymptotics: The Mergesort Recurrence.

[BibT_eX]

[DOI]

Mordecai J. Golin

Acta Informatica, 1994

An analysis of the Gaussian algorithm for lattice reduction.

[BibT_eX]

[DOI]

Hervé Daudé

Proceedings of the Algorithmic Number Theory, First International Symposium, 1994

1993

A Finite Sum of Products of Binomial Coefficients (C. C. Grosjean).

[BibT_eX]

[DOI]

SIAM Rev., 1993

General combinatorial schemas: Gaussian limit distributions and exponential tails.

[BibT_eX]

[DOI]

Discret. Math., 1993

The Distribution of Heights of Binary Trees and Other Simple Trees.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1993

Analytic Variations on Quadtrees.

[BibT_eX]

[DOI]

Algorithmica, 1993

Exact Asymptotics of Divide-and-Conquer Recurrences.

[BibT_eX]

[DOI]

Mordecai J. Golin

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

A Calculus of Random Generation.

[BibT_eX]

[DOI]

Bernard Van Cutsem

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992

Generalized Digital Trees and Their Difference-Differential Equations.

[BibT_eX]

[DOI]

L. Bruce Richmond

Random Struct. Algorithms, 1992

Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search.

[BibT_eX]

[DOI]

Loÿs Thimonier

Discret. Appl. Math., 1992

Page Usage in a Quadtree Index.

[BibT_eX]

[DOI]

Mamoru Hoshi

BIT, 1992

Analytic Analysis of Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

Varieties of Increasing Trees.

[BibT_eX]

[DOI]

François Bergeron

Proceedings of the CAAP '92, 1992

1991

Automatic Average-Case Analysis of Algorithm.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

The Cycle Construction.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1991

The Analysis of Multidimensional Searching in Quad-Trees.

[BibT_eX]

[DOI]

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1990

Singularity Analysis of Generating Functions.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1990

Gaussian limiting distributions for the number of components in combinatorial structures.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1990

Non-overlapping Partitions, Continued Fractions, Bessel Functions and a Divergent Series.

[BibT_eX]

[DOI]

René Schott

Eur. J. Comb., 1990

On adaptive sampling.

[BibT_eX]

[DOI]

Computing, 1990

Analytic Variations on the Common Subexpression Problem.

[BibT_eX]

[DOI]

Paolo Sipala

Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

The Lattice Reduction Algorithm of Gauss: An Average Case Analysis

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Average-Case Analysis of Algorithms and Data Structures.

[BibT_eX]

Jeffrey Scott Vitter

Proceedings of the Handbook of Theoretical Computer Science, 1990

1989

Average cost of orthogonal range queries in multiattribute trees.

[BibT_eX]

[DOI]

Inf. Syst., 1989

Elliptic Functions, Continued Fractions and Doubled Permutations.

[BibT_eX]

[DOI]

Eur. J. Comb., 1989

The first cycles in an evolving graph.

[BibT_eX]

[DOI]

Donald E. Knuth

Boris G. Pittel

Discret. Math., 1989

On the Performance of Orthogonal Range Queries in Multiattribute and Doubly Chained Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 1989

Analysis of KDT-Trees: KD-Trees Improved by Local Reogranisations.

[BibT_eX]

[DOI]

Walter Cunto

Gustavo Lau

Proceedings of the Algorithms and Data Structures, 1989

Random Mapping Statistics.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1989

1988

Random Allocations and Probabilistic Languages.

[BibT_eX]

[DOI]

Loÿs Thimonier

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

Lambda - Upsilon - Omega: An Assistant Algorithms Analyzer.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1988

1987

Analytic Models and Ambiguity of Context-Free Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

A Complexity Calculus for Recursive Tree Algorithms.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1987

Estimating the multiplicities of conflicts to speed their resolution in multiple access channels.

[BibT_eX]

[DOI]

Albert G. Greenberg

Richard E. Ladner

J. ACM, 1987

Prefixes of Infinite Words and Ambiguous Context-Free Languages.

[BibT_eX]

[DOI]

Jean-Michel Autebert

Joaquim Gabarró

Inf. Process. Lett., 1987

Level number sequences for trees.

[BibT_eX]

[DOI]

Discret. Math., 1987

Random Tree Models in the Analysis of Algorithms.

[BibT_eX]

Proceedings of the Performance '87, 1987

1986

Digital Search Trees Revisited.

[BibT_eX]

[DOI]

SIAM J. Comput., 1986

[BibT_eX]

[DOI]

SIAM J. Comput., 1986

The Complexity of Generating an Exponentially Distributed Variate.

[BibT_eX]

[DOI]

Nasser Saheb

J. Algorithms, 1986

Partial match retrieval of multidimensional data.

[BibT_eX]

[DOI]

J. ACM, 1986

The analysis of simple list structures.

[BibT_eX]

[DOI]

Inf. Sci., 1986

The Evolution of Two Stacks in Bounded Space and Random Walks in a Triangle.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1985

Q -ary collision resolution algorithms in random-access systems with free or blocked channel access.

[BibT_eX]

[DOI]

Peter Mathys

IEEE Trans. Inf. Theory, 1985

Analysis of a stack algorithm for random multiple-access communication.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1985

Probabilistic Counting Algorithms for Data Base Applications.

[BibT_eX]

[DOI]

G. Nigel Martin

J. Comput. Syst. Sci., 1985

Search Trees and Bubble Memories.

[BibT_eX]

[DOI]

Thomas Ottmann

Derick Wood

RAIRO Theor. Informatics Appl., 1985

Approximate Counting: A Detailed Analysis.

[BibT_eX]

[DOI]

BIT, 1985

Ambiguity and Transcendence.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1985

Elements of a general theory of combinatorial structures.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1985

1983

Patterns and Pattern-Matching in Trees: An Analysis

[BibT_eX]

[DOI]

Inf. Control., 1983

On the Performance Evaluation of Extendible Hashing and Trie Searching.

[BibT_eX]

[DOI]

Acta Informatica, 1983

Tree Structures for Partial Match Retrieval

[BibT_eX]

[DOI]

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

Probabilistic Counting

[BibT_eX]

[DOI]

G. Nigel Martin

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

Methods in the Analysis of Algorithms: Evaluations of a Recursive Partitioning Process.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1983

Digital Search Trees and the Generation of an Exponentially Distributed Variate.

[BibT_eX]

[DOI]

Nasser Saheb

Proceedings of the CAAP'83, 1983

1982

The Average Height of Binary Trees and Other Simple Trees.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1982

On congruences and continued fractions for some classical combinatorial quantities.

[BibT_eX]

[DOI]

Discret. Math., 1982

A Branching Process Arising in Dynamic Hashing, Trie Searching and Polynomial Factorization.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1982

1981

A Complexity Calculus for Classes of Recursive Search Programs over Tree Structures

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980

A Note on Gray Code and Odd-Even Merge.

[BibT_eX]

[DOI]

Lyle Ramshaw

SIAM J. Comput., 1980

Sequence of Operations Analysis for Dynamic Data Structures.

[BibT_eX]

[DOI]

J. Algorithms, 1980

On the Analysis of Tree-Matching Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1980

Exploring Binary Trees and Other Simple Trees

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979

The Number of Registers Required for Evaluating Arithmetic Expressions.

[BibT_eX]

[DOI]

Jean-Claude Raoult

Theor. Comput. Sci., 1979

Computing Integrated Costs of Sequences of Operations with Application to Dictionaries

[BibT_eX]

[DOI]

Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

Towards Analysing Sequences of Operations for Dynamic Data Structures (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1977

On the Average Number of Registers Required for Evaluating Arithmetic Expressions

[BibT_eX]

[DOI]

Jean-Claude Raoult

Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October, 1977

1974

Une généralisation de la notion d'ensemble immune.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1974

On Sets Having Only Hard Subsets.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

1973

Decision Problems for Multihead Finite Automata.

[BibT_eX]

Proceedings of the Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, 1973

1972

Complexité des problèmes de décision relatifs aux algorithmes de tri.

[BibT_eX]