On Generalized Independent Subsets of Trees. - Michael Drmota; Peter Kirschenhofer (Random Struct. Algorithms, 1991)

Exponential Limiting Distributions in Queueing Systems with Deadlines. - Michael Drmota; Ulrich Schmid 001 (SIAM J. Appl. Math., 1993)

The analysis of the expected successful operation time of slotted Aloha. - Michael Drmota; Ulrich Schmid 001 (IEEE Trans. Inf. Theory, 1993)

A Bivariate Asymptotic Expansion of Coefficients of Powers of Generating Functions. - Michael Drmota (Eur. J. Comb., 1994)

Asymptotic Distributions and a Multivariate Darboux Method in Enumeration Problems. - Michael Drmota (J. Comb. Theory A, 1994)

The Instability Time Distribution Behavior of Slotted ALOHA. - Michael Drmota (Random Struct. Algorithms, 1994)

Correlations on the Strata of a Random Mapping. - Michael Drmota (Random Struct. Algorithms, 1995)

Marking in Combinatorial Constructions: Generating Functions and Limiting Distributions. - Michael Drmota; Michèle Soria (Theor. Comput. Sci., 1995)

Predecessors in Random Mappings. - Gerd Baron; Michael Drmota; Ljuben R. Mutafchiev (Comb. Probab. Comput., 1996)

Systems of functional equations. - Michael Drmota (Random Struct. Algorithms, 1997)

On the profile of random trees. - Michael Drmota; Bernhard Gittenberger (Random Struct. Algorithms, 1997)

Images and Preimages in Random Mappings. - Michael Drmota; Michèle Soria (SIAM J. Discret. Math., 1997)

The Complete Solution of the Competitive Rank Selection Problem. - F. Thomas Bruss; Michael Drmota; Guy Louchard (Algorithmica, 1998)

The distribution of nodes of given degree in random trees. - Michael Drmota; Bernhard Gittenberger (J. Graph Theory, 1999)

An Analytic Approach to the Height of Binary Search Trees. - Michael Drmota (Algorithmica, 2001)

The Asymptotic Number of Leftist Trees. - Michael Drmota (Algorithmica, 2001)

A Unified Presentation of Some Urn Models. - Michael Drmota; Danièle Gardy; Bernhard Gittenberger (Algorithmica, 2001)

Precise Average Redundancy Of An Idealized Arithmetic Codin. - Michael Drmota; Hsien-Kuei Hwang; Wojciech Szpankowski (DCC, 2002)

Generalized Shannon Code Minimizes the Maximal Redundancy. - Michael Drmota; Wojciech Szpankowski (LATIN, 2002)

The variance of the height of digital search trees. - Michael Drmota (Acta Informatica, 2002)

A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem. - Michael Drmota; Daniel Panario (Des. Codes Cryptogr., 2002)

The height of q-Binary Search Trees. - Michael Drmota; Helmut Prodinger (Discret. Math. Theor. Comput. Sci., 2002)

The Variance of the height of binary search trees. - Michael Drmota (Theor. Comput. Sci., 2002)

Discrete Random Walks on One-Sided "Periodic" Graphs. - Michael Drmota (DRW, 2003)

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

An analytic approach to the height of binary search trees II. - Michael Drmota (J. ACM, 2003)

Variable-to-variable codes with small redundancy rates. - Michael Drmota; Wojciech Szpankowski (ISIT, 2004)

Special Issue on Analysis of Algorithms. - Michael Drmota; Wojciech Szpankowski (Comb. Probab. Comput., 2004)

The Width of Galton-Watson Trees Conditioned by the Size. - Michael Drmota; Bernhard Gittenberger (Discret. Math. Theor. Comput. Sci., 2004)

General urn models with several types of balls and Gaussian limiting fields. - Michael Drmota; Danièle Gardy; Bernhard Gittenberger (Random Struct. Algorithms, 2004)

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

Precise minimax redundancy and regret. - Michael Drmota; Wojciech Szpankowski (IEEE Trans. Inf. Theory, 2004)

Extended admissible functions and Gaussian limiting distributions. - Michael Drmota; Bernhard Gittenberger; Thomas Klausner (Math. Comput., 2005)

Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees. - Michael Drmota; Hsien-Kuei Hwang (SIAM J. Discret. Math., 2005)

Precise Asymptotic Analysis of the Tunstall Code. - Michael Drmota; Yuriy A. Reznik; Serap A. Savari; Wojciech Szpankowski (ISIT, 2006)

The Random Multisection Problem, Travelling Waves and the Distribution of the Height of m-Ary Search Trees. - Brigitte Chauvin; Michael Drmota (Algorithmica, 2006)

The register function for t-ary trees. - Michael Drmota; Helmut Prodinger (ACM Trans. Algorithms, 2006)

The Distribution of Patterns in Random Trees. - Frédéric Chyzak; Michael Drmota; Thomas Klausner; Gerard Kok (Comb. Probab. Comput., 2008)

Newman's phenomenon for generalized Thue-Morse sequences. - Michael Drmota; Thomas Stoll (Discret. Math., 2008)

On the Construction of (Explicit) Khodak's Code and Its Analysis. - Yann Bugeaud; Michael Drmota; Wojciech Szpankowski (IEEE Trans. Inf. Theory, 2008)

Combinatorial Models for Cooperation Networks. - Michael Drmota; Bernhard Gittenberger; Reinhard Kutzelnigg (IWOCA, 2009)

(Un)expected behavior of digital search tree profile. - Michael Drmota; Wojciech Szpankowski (SODA, 2009)

A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree. - Michael Drmota; Alexander Iksanov; Martin Möhle; Uwe Roesler (Random Struct. Algorithms, 2009)

The shape of unlabeled rooted random trees. - Michael Drmota; Bernhard Gittenberger (Eur. J. Comb., 2010)

Vertices of given degree in series-parallel graphs. - Michael Drmota; Omer Giménez; Marc Noy (Random Struct. Algorithms, 2010)

Tunstall code, Khodak variations, and random walks. - Michael Drmota; Yuriy A. Reznik; Wojciech Szpankowski (IEEE Trans. Inf. Theory, 2010)

Analysis of a Block Arithmetic Coding: Discrete divide and conquer recurrences. - Michael Drmota; Wojciech Szpankowski (ISIT, 2011)

The Maximum Degree of Series-Parallel Graphs. - Michael Drmota; Omer Giménez; Marc Noy (Comb. Probab. Comput., 2011)

Universal exponents and tail estimates in the enumeration of planar maps. - Michael Drmota; Marc Noy (Electron. Notes Discret. Math., 2011)

Degree distribution in random planar graphs. - Michael Drmota; Omer Giménez; Marc Noy (J. Comb. Theory A, 2011)

The expected profile of digital search trees. - Michael Drmota; Wojciech Szpankowski (J. Comb. Theory A, 2011)

The sum-of-digits function of polynomial sequences. - Michael Drmota; Christian Mauduit; Joël Rivat (J. Lond. Math. Soc., 2011)

Asymptotic Study of Subcritical Graph Classes. - Michael Drmota; Éric Fusy; Mihyun Kang; Veronika Kraus; Juanjo Rué (SIAM J. Discret. Math., 2011)

Mutual information for a deletion channel. - Michael Drmota; Wojciech Szpankowski; Krishnamurthy Viswanathan (ISIT, 2012)

The maximum degree of random planar graphs. - Michael Drmota; Omer Giménez; Marc Noy; Konstantinos Panagiotou; Angelika Steger (SODA, 2012)

Asymptotic enumeration of reversible maps regardless of genus. - Michael Drmota; Roman Nedela (Ars Math. Contemp., 2012)

A precise analysis of Cuckoo hashing. - Michael Drmota; Reinhard Kutzelnigg (ACM Trans. Algorithms, 2012)

Extremal Parameters in Sub-Critical Graph Classes. - Michael Drmota; Marc Noy (ANALCO, 2013)

A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps. - Michael Drmota; Konstantinos Panagiotou (Algorithmica, 2013)

Embedded trees and the support of the ISE. - Michael Drmota (Eur. J. Comb., 2013)

A Master Theorem for Discrete Divide and Conquer Recurrences. - Michael Drmota; Wojciech Szpankowski (J. ACM, 2013)

Subsequences of automatic sequences and uniform distribution. - Michael Drmota (Uniform Distribution and Quasi-Monte Carlo Methods, 2014)

Almost Every Tree With m Edges Decomposes K 2m, 2m . - Michael Drmota; Anna S. Lladó (Comb. Probab. Comput., 2014)

Extremal statistics on non-crossing configurations. - Michael Drmota; Anna de Mier; Marc Noy (Discret. Math., 2014)

Formulae and Asymptotics for Coefficients of Algebraic Functions. - Cyril Banderier; Michael Drmota (Comb. Probab. Comput., 2015)

Scaling limit of random k-trees. - Michael Drmota; Emma Yu Jin (ANALCO, 2016)

An Asymptotic Analysis of Labeled and Unlabeled k-Trees. - Michael Drmota; Emma Yu Jin (Algorithmica, 2016)

Asymmetric Rényi Problem and PATRICIA Tries. - Michael Drmota; Abram Magner; Wojciech Szpankowski (CoRR, 2016)

On a Conjecture of Cusick Concerning the Sum of Digits of n and n+t. - Michael Drmota; Manuel Kauers; Lukas Spiegelhofer (SIAM J. Discret. Math., 2016)

External Profile of Symmetric Digital Search Trees (Extended Abstract). - Michael Drmota; Michael Fuchs 001; Hsien-Kuei Hwang; Ralph Neininger (ANALCO, 2017)

Preface. - Michael Drmota; Mihyun Kang; Christian Krattenthaler; Jaroslav Nesetril (Electron. Notes Discret. Math., 2017)

Redundancy of Lossless Data Compression for Known Sources by Analytic Methods. - Michael Drmota; Wojciech Szpankowski (Found. Trends Commun. Inf. Theory, 2017)

Subgraph statistics in subcritical graph classes. - Michael Drmota; Lander Ramos; Juanjo Rué (Random Struct. Algorithms, 2017)

The Number of Double Triangles in Random Planar Maps. - Michael Drmota; Guan-Ru Yu (AofA, 2018)

Limit laws of planar maps with prescribed vertex degrees. - G. Collet; Michael Drmota; Lukas Daniel Klausner (Comb. Probab. Comput., 2019)

Asymmetric Rényi Problem. - Michael Drmota; Abram Magner; Wojciech Szpankowski (Comb. Probab. Comput., 2019)

Graph limits of random graphs from a subset of connected k-trees. - Michael Drmota; Emma Yu Jin; Benedikt Stufler (Random Struct. Algorithms, 2019)

Maximal Independent Sets and Maximal Matchings in Series-Parallel and Related Graph Classes. - Michael Drmota; Lander Ramos; Clément Requilé; Juanjo Rué (Electron. J. Comb., 2020)

(Logarithmic) densities for automatic sequences along primes and squares. - Boris Adamczewski; Michael Drmota; Clemens Müllner (CoRR, 2020)

Node profiles of symmetric digital search trees: Concentration properties. - Michael Drmota; Michael Fuchs 001; Hsien-Kuei Hwang; Ralph Neininger (Random Struct. Algorithms, 2021)

Universal Properties of Catalytic Variable Equations. - Michael Drmota; Eva-Maria Hainzl (AofA, 2022)

Linear-sized independent sets in random cographs and increasing subsequences in separable permutations. - Frédérique Bassino; Mathilde Bouvel; Michael Drmota; Valentin Féray; Lucas Gerin; Mickaël Maazoun; Adeline Pierrot (Comb. Theory, 2022)

Sequential universal modeling for non-binary sequences with constrained distributions. - Michael Drmota; Gil I. Shamir; Wojciech Szpankowski (Commun. Inf. Syst., 2022)

Universal asymptotic properties of positive functional equations with one catalytic variable. - Michael Drmota; Eva-Maria Hainzl (CoRR, 2022)

Universal singular exponents in catalytic variable equations. - Michael Drmota; Marc Noy; Guan-Ru Yu (J. Comb. Theory A, 2022)

Random Cubic Planar Maps. - Michael Drmota; Marc Noy; Clément Requilé; Juanjo Rué (Electron. J. Comb., 2023)

Cut Vertices in Random Planar Maps. - Michael Drmota; Marc Noy; Benedikt Stufler (Electron. J. Comb., 2023)

Minimax Regret with Unbounded Weights. - Michael Drmota; Philippe Jacquet; Changlong Wu; Wojciech Szpankowski (ISIT, 2024)

Chordal graphs with bounded tree-width. - Jordi Castellví; Michael Drmota; Marc Noy; Clément Requilé (Adv. Appl. Math., 2024)

Faithful Dynamic Timing Analysis of Digital Circuits Using Continuous Thresholded Mode-Switched ODEs. - Arman Ferdowsi; Matthias Függer; Thomas Nowak; Michael Drmota; Ulrich Schmid 001 (CoRR, 2024)