Michael Drmota

According to our database1, Michael Drmota authored at least 81 papers between 1991 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


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

Sequential Universal Modeling for Non-Binary Sequences with Constrained Distributions.
CoRR, 2020

Maximal Independent Sets and Maximal Matchings in Series-Parallel and Related Graph Classes.
Electron. J. Comb., 2020

Cut Vertices in Random Planar Maps.
Proceedings of the 31st International Conference on Probabilistic, 2020

Graph limits of random graphs from a subset of connected k-trees.
Random Struct. Algorithms, 2019

Asymmetric Rényi Problem.
Comb. Probab. Comput., 2019

Limit laws of planar maps with prescribed vertex degrees.
Comb. Probab. Comput., 2019

The Number of Double Triangles in Random Planar Maps.
Proceedings of the 29th International Conference on Probabilistic, 2018

Subgraph statistics in subcritical graph classes.
Random Struct. Algorithms, 2017

Redundancy of Lossless Data Compression for Known Sources by Analytic Methods.
Found. Trends Commun. Inf. Theory, 2017

Electron. Notes Discret. Math., 2017

External Profile of Symmetric Digital Search Trees (Extended Abstract).
Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

On a Conjecture of Cusick Concerning the Sum of Digits of n and n+t.
SIAM J. Discret. Math., 2016

Asymmetric Rényi Problem and PATRICIA Tries.
CoRR, 2016

An Asymptotic Analysis of Labeled and Unlabeled k-Trees.
Algorithmica, 2016

Scaling limit of random <i>k</i>-trees.
Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics, 2016

Formulae and Asymptotics for Coefficients of Algebraic Functions.
Comb. Probab. Comput., 2015

Extremal statistics on non-crossing configurations.
Discret. Math., 2014

Almost Every Tree With <i>m</i> Edges Decomposes <i>K</i> <sub>2<i>m</i>, 2<i>m</i> </sub>.
Comb. Probab. Comput., 2014

Subsequences of automatic sequences and uniform distribution.
Proceedings of the Uniform Distribution and Quasi-Monte Carlo Methods, 2014

A Master Theorem for Discrete Divide and Conquer Recurrences.
J. ACM, 2013

Embedded trees and the support of the ISE.
Eur. J. Comb., 2013

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

Extremal Parameters in Sub-Critical Graph Classes.
Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, 2013

A precise analysis of Cuckoo hashing.
ACM Trans. Algorithms, 2012

Asymptotic enumeration of reversible maps regardless of genus.
Ars Math. Contemp., 2012

The maximum degree of random planar graphs.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Mutual information for a deletion channel.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Asymptotic Study of Subcritical Graph Classes.
SIAM J. Discret. Math., 2011

The sum-of-digits function of polynomial sequences.
J. Lond. Math. Soc., 2011

The expected profile of digital search trees.
J. Comb. Theory, Ser. A, 2011

Degree distribution in random planar graphs.
J. Comb. Theory, Ser. A, 2011

Universal exponents and tail estimates in the enumeration of planar maps.
Electron. Notes Discret. Math., 2011

The Maximum Degree of Series-Parallel Graphs.
Comb. Probab. Comput., 2011

Analysis of a Block Arithmetic Coding: Discrete divide and conquer recurrences.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Tunstall code, Khodak variations, and random walks.
IEEE Trans. Inf. Theory, 2010

Vertices of given degree in series-parallel graphs.
Random Struct. Algorithms, 2010

The shape of unlabeled rooted random trees.
Eur. J. Comb., 2010

A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree.
Random Struct. Algorithms, 2009

(Un)expected behavior of digital search tree profile.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Combinatorial Models for Cooperation Networks.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

On the Construction of (Explicit) Khodak's Code and Its Analysis.
IEEE Trans. Inf. Theory, 2008

Newman's phenomenon for generalized Thue-Morse sequences.
Discret. Math., 2008

The Distribution of Patterns in Random Trees.
Comb. Probab. Comput., 2008

The register function for <i>t</i>-ary trees.
ACM Trans. Algorithms, 2006

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

Precise Asymptotic Analysis of the Tunstall Code.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees.
SIAM J. Discret. Math., 2005

Extended admissible functions and Gaussian limiting distributions.
Math. Comput., 2005

Precise minimax redundancy and regret.
IEEE Trans. Inf. Theory, 2004

On Robson's convergence and boundedness conjectures concerning the height of binary search trees.
Theor. Comput. Sci., 2004

General urn models with several types of balls and Gaussian limiting fields.
Random Struct. Algorithms, 2004

The Width of Galton-Watson Trees Conditioned by the Size.
Discret. Math. Theor. Comput. Sci., 2004

Special Issue on Analysis of Algorithms.
Comb. Probab. Comput., 2004

Variable-to-variable codes with small redundancy rates.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

An analytic approach to the height of binary search trees II.
J. ACM, 2003

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

Discrete Random Walks on One-Sided "Periodic" Graphs.
Proceedings of the Discrete Random Walks, 2003

The Variance of the height of binary search trees.
Theor. Comput. Sci., 2002

The height of q-Binary Search Trees.
Discret. Math. Theor. Comput. Sci., 2002

A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem.
Des. Codes Cryptogr., 2002

The variance of the height of digital search trees.
Acta Informatica, 2002

Generalized Shannon Code Minimizes the Maximal Redundancy.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Precise Average Redundancy Of An Idealized Arithmetic Codin.
Proceedings of the 2002 Data Compression Conference (DCC 2002), 2002

A Unified Presentation of Some Urn Models.
Algorithmica, 2001

The Asymptotic Number of Leftist Trees.
Algorithmica, 2001

An Analytic Approach to the Height of Binary Search Trees.
Algorithmica, 2001

The distribution of nodes of given degree in random trees.
J. Graph Theory, 1999

The Complete Solution of the Competitive Rank Selection Problem.
Algorithmica, 1998

Images and Preimages in Random Mappings.
SIAM J. Discret. Math., 1997

On the profile of random trees.
Random Struct. Algorithms, 1997

Systems of functional equations.
Random Struct. Algorithms, 1997

Predecessors in Random Mappings.
Comb. Probab. Comput., 1996

Marking in Combinatorial Constructions: Generating Functions and Limiting Distributions.
Theor. Comput. Sci., 1995

Correlations on the Strata of a Random Mapping.
Random Struct. Algorithms, 1995

The Instability Time Distribution Behavior of Slotted ALOHA.
Random Struct. Algorithms, 1994

Asymptotic Distributions and a Multivariate Darboux Method in Enumeration Problems.
J. Comb. Theory, Ser. A, 1994

A Bivariate Asymptotic Expansion of Coefficients of Powers of Generating Functions.
Eur. J. Comb., 1994

The analysis of the expected successful operation time of slotted Aloha.
IEEE Trans. Inf. Theory, 1993

Exponential Limiting Distributions in Queueing Systems with Deadlines.
SIAM J. Appl. Math., 1993

On Generalized Independent Subsets of Trees.
Random Struct. Algorithms, 1991