Michael Drmota

According to our database1, Michael Drmota
  • authored at least 74 papers between 1991 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

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

Redundancy of Lossless Data Compression for Known Sources by Analytic Methods.
Foundations and Trends in Communications and Information Theory, 2017

Preface.
Electronic Notes in Discrete Mathematics, 2017

External Profile of Symmetric Digital Search Trees (Extended Abstract).
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.
SIAM J. Discrete 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 k-trees.
Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics, 2016

2015
Formulae and Asymptotics for Coefficients of Algebraic Functions.
Combinatorics, Probability & Computing, 2015

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

2014
Extremal statistics on non-crossing configurations.
Discrete Mathematics, 2014

Almost Every Tree With m Edges Decomposes K 2m, 2m .
Combinatorics, Probability & Computing, 2014

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

2013
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

2012
A precise analysis of Cuckoo hashing.
ACM Trans. Algorithms, 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

A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps.
Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics, 2012

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

The sum-of-digits function of polynomial sequences.
J. London Math. Society, 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.
Electronic Notes in Discrete Mathematics, 2011

The Maximum Degree of Series-Parallel Graphs.
Combinatorics, Probability & Computing, 2011

A Master Theorem for Discrete Divide and Conquer Recurrences.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

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

2010
Tunstall code, Khodak variations, and random walks.
IEEE Trans. Information 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

2009
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

Embedded Trees and the Support of the ISE.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

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

Newman's phenomenon for generalized Thue-Morse sequences.
Discrete Mathematics, 2008

The Distribution of Patterns in Random Trees.
Combinatorics, Probability & Computing, 2008

2006
The register function for t-ary trees.
ACM Trans. Algorithms, 2006

The Distribution of Patterns in Random Trees
CoRR, 2006

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

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

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

2004
Precise minimax redundancy and regret.
IEEE Trans. Information 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.
Discrete Mathematics & Theoretical Computer Science, 2004

Special Issue on Analysis of Algorithms.
Combinatorics, Probability & Computing, 2004

2003
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").
Bulletin of the EATCS, 2003

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

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

The height of q-Binary Search Trees.
Discrete Mathematics & Theoretical Computer Science, 2002

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

The variance of the height of digital search trees.
Acta Inf., 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

2001
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

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

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

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

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

Systems of functional equations.
Random Struct. Algorithms, 1997

1996
Predecessors in Random Mappings.
Combinatorics, Probability & Computing, 1996

1995
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

1994
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

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

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


  Loading...