Michael Drmota

Benedikt Stufler

Electron. J. Comb., 2023

Random Cubic Planar Maps.

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

2022

Universal singular exponents in catalytic variable equations.

[BibT_eX]

[DOI]

Guan-Ru Yu

J. Comb. Theory A, 2022

Universal asymptotic properties of positive functional equations with one catalytic variable.

[BibT_eX]

[DOI]

Eva-Maria Hainzl

CoRR, 2022

Sequential universal modeling for non-binary sequences with constrained distributions.

[BibT_eX]

[DOI]

Gil I. Shamir

Commun. Inf. Syst., 2022

Linear-sized independent sets in random cographs and increasing subsequences in separable permutations.

[BibT_eX]

[DOI]

Comb. Theory, 2022

Universal Properties of Catalytic Variable Equations.

[BibT_eX]

[DOI]

Eva-Maria Hainzl

Proceedings of the 33rd International Conference on Probabilistic, 2022

2021

Node profiles of symmetric digital search trees: Concentration properties.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2021

2020

(Logarithmic) densities for automatic sequences along primes and squares.

[BibT_eX]

[DOI]

Boris Adamczewski

Clemens Müllner

CoRR, 2020

Maximal Independent Sets and Maximal Matchings in Series-Parallel and Related Graph Classes.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

2019

Graph limits of random graphs from a subset of connected k-trees.

[BibT_eX]

[DOI]

Emma Yu Jin

Benedikt Stufler

Random Struct. Algorithms, 2019

Asymmetric Rényi Problem.

[BibT_eX]

[DOI]

Abram Magner

Comb. Probab. Comput., 2019

Limit laws of planar maps with prescribed vertex degrees.

[BibT_eX]

[DOI]

G. Collet

Lukas Daniel Klausner

Comb. Probab. Comput., 2019

2018

The Number of Double Triangles in Random Planar Maps.

[BibT_eX]

[DOI]

Guan-Ru Yu

Proceedings of the 29th International Conference on Probabilistic, 2018

2017

Subgraph statistics in subcritical graph classes.

[BibT_eX]

[DOI]

Lander Ramos

Juanjo Rué

Random Struct. Algorithms, 2017

Redundancy of Lossless Data Compression for Known Sources by Analytic Methods.

[BibT_eX]

[DOI]

Found. Trends Commun. Inf. Theory, 2017

Preface.

[BibT_eX]

[DOI]

Mihyun Kang

Christian Krattenthaler

Jaroslav Nesetril

Electron. Notes Discret. Math., 2017

External Profile of Symmetric Digital Search Trees (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

2016

On a Conjecture of Cusick Concerning the Sum of Digits of n and n+t.

[BibT_eX]

[DOI]

Manuel Kauers

Lukas Spiegelhofer

SIAM J. Discret. Math., 2016

Asymmetric Rényi Problem and PATRICIA Tries.

[BibT_eX]

[DOI]

Abram Magner

CoRR, 2016

An Asymptotic Analysis of Labeled and Unlabeled k-Trees.

[BibT_eX]

[DOI]

Emma Yu Jin

Algorithmica, 2016

Scaling limit of random k-trees.

[BibT_eX]

[DOI]

Emma Yu Jin

Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics, 2016

2015

Formulae and Asymptotics for Coefficients of Algebraic Functions.

[BibT_eX]

[DOI]

Cyril Banderier

Comb. Probab. Comput., 2015

2014

Extremal statistics on non-crossing configurations.

[BibT_eX]

[DOI]

Anna de Mier

Discret. Math., 2014

Almost Every Tree With m Edges Decomposes K 2m, 2m .

[BibT_eX]

[DOI]

Anna S. Lladó

Comb. Probab. Comput., 2014

Subsequences of automatic sequences and uniform distribution.

[BibT_eX]

[DOI]

Proceedings of the Uniform Distribution and Quasi-Monte Carlo Methods, 2014

2013

A Master Theorem for Discrete Divide and Conquer Recurrences.

[BibT_eX]

[DOI]

J. ACM, 2013

Embedded trees and the support of the ISE.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps.

[BibT_eX]

[DOI]

Konstantinos Panagiotou

Algorithmica, 2013

Extremal Parameters in Sub-Critical Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, 2013

2012

A precise analysis of Cuckoo hashing.

[BibT_eX]

[DOI]

Reinhard Kutzelnigg

ACM Trans. Algorithms, 2012

Asymptotic enumeration of reversible maps regardless of genus.

[BibT_eX]

[DOI]

Roman Nedela

Ars Math. Contemp., 2012

The maximum degree of random planar graphs.

[BibT_eX]

[DOI]

Konstantinos Panagiotou

Angelika Steger

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Mutual information for a deletion channel.

[BibT_eX]

[DOI]

Krishnamurthy Viswanathan

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

Asymptotic Study of Subcritical Graph Classes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

The sum-of-digits function of polynomial sequences.

[BibT_eX]

[DOI]

Christian Mauduit

Joël Rivat

J. Lond. Math. Soc., 2011

The expected profile of digital search trees.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2011

Degree distribution in random planar graphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2011

Universal exponents and tail estimates in the enumeration of planar maps.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

The Maximum Degree of Series-Parallel Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2011

Analysis of a Block Arithmetic Coding: Discrete divide and conquer recurrences.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

Tunstall code, Khodak variations, and random walks.

[BibT_eX]

[DOI]

Yuriy A. Reznik

IEEE Trans. Inf. Theory, 2010

Vertices of given degree in series-parallel graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2010

The shape of unlabeled rooted random trees.

[BibT_eX]

[DOI]

Eur. J. Comb., 2010

2009

A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2009

(Un)expected behavior of digital search tree profile.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Combinatorial Models for Cooperation Networks.

[BibT_eX]

[DOI]

Reinhard Kutzelnigg

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

On the Construction of (Explicit) Khodak's Code and Its Analysis.

[BibT_eX]

[DOI]

Yann Bugeaud

IEEE Trans. Inf. Theory, 2008

Newman's phenomenon for generalized Thue-Morse sequences.

[BibT_eX]

[DOI]

Thomas Stoll

Discret. Math., 2008

The Distribution of Patterns in Random Trees.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2008

2006

The register function for t-ary trees.

[BibT_eX]

[DOI]

Helmut Prodinger

ACM Trans. Algorithms, 2006

The Random Multisection Problem, Travelling Waves and the Distribution of the Height of m-Ary Search Trees.

[BibT_eX]

[DOI]

Brigitte Chauvin

Algorithmica, 2006

Precise Asymptotic Analysis of the Tunstall Code.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005

Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees.

[BibT_eX]

[DOI]

Hsien-Kuei Hwang

SIAM J. Discret. Math., 2005

Extended admissible functions and Gaussian limiting distributions.

[BibT_eX]

[DOI]

Thomas Klausner

Math. Comput., 2005

2004

Precise minimax redundancy and regret.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

On Robson's convergence and boundedness conjectures concerning the height of binary search trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

General urn models with several types of balls and Gaussian limiting fields.

[BibT_eX]

[DOI]

Danièle Gardy

Random Struct. Algorithms, 2004

The Width of Galton-Watson Trees Conditioned by the Size.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2004

Special Issue on Analysis of Algorithms.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2004

Variable-to-variable codes with small redundancy rates.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003

An analytic approach to the height of binary search trees II.

[BibT_eX]

[DOI]

J. ACM, 2003

Analysis of Algorithms (AofA) Part II: 1998-2000 ("Princeton-Barcelona-Gdansk").

[BibT_eX]

Bull. EATCS, 2003

Discrete Random Walks on One-Sided "Periodic" Graphs.

[BibT_eX]

[DOI]

Proceedings of the Discrete Random Walks, 2003

2002

The Variance of the height of binary search trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

The height of q-Binary Search Trees.

[BibT_eX]

[DOI]

Helmut Prodinger

Discret. Math. Theor. Comput. Sci., 2002

A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem.

[BibT_eX]

Daniel Panario

Des. Codes Cryptogr., 2002

The variance of the height of digital search trees.

[BibT_eX]

[DOI]

Acta Informatica, 2002

Generalized Shannon Code Minimizes the Maximal Redundancy.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Precise Average Redundancy Of An Idealized Arithmetic Codin.

[BibT_eX]

[DOI]

Hsien-Kuei Hwang

Proceedings of the 2002 Data Compression Conference (DCC 2002), 2002

2001

A Unified Presentation of Some Urn Models.

[BibT_eX]

[DOI]

Danièle Gardy

Algorithmica, 2001

The Asymptotic Number of Leftist Trees.

[BibT_eX]

[DOI]

Algorithmica, 2001

An Analytic Approach to the Height of Binary Search Trees.

[BibT_eX]

[DOI]

Algorithmica, 2001

1999

The distribution of nodes of given degree in random trees.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

1998

The Complete Solution of the Competitive Rank Selection Problem.

[BibT_eX]

[DOI]

F. Thomas Bruss

Guy Louchard

Algorithmica, 1998

1997

Images and Preimages in Random Mappings.

[BibT_eX]

[DOI]

Michèle Soria

SIAM J. Discret. Math., 1997

On the profile of random trees.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1997

Systems of functional equations.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1997

1996

Predecessors in Random Mappings.

[BibT_eX]

[DOI]

Gerd Baron

Ljuben R. Mutafchiev

Comb. Probab. Comput., 1996

1995

Marking in Combinatorial Constructions: Generating Functions and Limiting Distributions.

[BibT_eX]

[DOI]

Michèle Soria

Theor. Comput. Sci., 1995

Correlations on the Strata of a Random Mapping.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1995

1994

The Instability Time Distribution Behavior of Slotted ALOHA.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1994

Asymptotic Distributions and a Multivariate Darboux Method in Enumeration Problems.

[BibT_eX]

J. Comb. Theory A, 1994

A Bivariate Asymptotic Expansion of Coefficients of Powers of Generating Functions.

[BibT_eX]

[DOI]

Eur. J. Comb., 1994

1993

The analysis of the expected successful operation time of slotted Aloha.

[BibT_eX]

[DOI]

Ulrich Schmid

IEEE Trans. Inf. Theory, 1993

Exponential Limiting Distributions in Queueing Systems with Deadlines.

[BibT_eX]

[DOI]

Ulrich Schmid

SIAM J. Appl. Math., 1993

1991

On Generalized Independent Subsets of Trees.

[BibT_eX]

[DOI]