Michael Drmota

103 papers A* 3B 7C 7Journal 78Unranked 5
YearRankTypeTitle / Venue / Authors
2025 J jnl
Precise Regularized Minimax Regret With Unbounded Weights.
IEEE Trans. Inf. Theory
Michael Drmota, Philippe Jacquet, Changlong Wu, Wojciech Szpankowski
2024 J jnl
Chordal graphs with bounded tree-width.
Adv. Appl. Math.
Jordi Castellví, Michael Drmota, Marc Noy, Clément Requilé
2024 J jnl
Faithful Dynamic Timing Analysis of Digital Circuits Using Continuous Thresholded Mode-Switched ODEs.
CoRR
Arman Ferdowsi, Matthias Függer, Thomas Nowak, Michael Drmota, Ulrich Schmid
2024 B conf
Minimax Regret with Unbounded Weights.
ISIT
Michael Drmota, Philippe Jacquet, Changlong Wu, Wojciech Szpankowski
2023 J jnl
Cut Vertices in Random Planar Maps.
Electron. J. Comb.
Michael Drmota, Marc Noy, Benedikt Stufler
2023 J jnl
Random Cubic Planar Maps.
Electron. J. Comb.
Michael Drmota, Marc Noy, Clément Requilé, Juanjo Rué
2022 J jnl
Linear-sized independent sets in random cographs and increasing subsequences in separable permutations.
Comb. Theory
Frédérique Bassino, Mathilde Bouvel, Michael Drmota, Valentin Féray, Lucas Gerin, Mickaël Maazoun, Adeline Pierrot
2022 J jnl
Sequential universal modeling for non-binary sequences with constrained distributions.
Commun. Inf. Syst.
Michael Drmota, Gil I. Shamir, Wojciech Szpankowski
2022 C conf
Universal Properties of Catalytic Variable Equations.
AofA
Michael Drmota, Eva-Maria Hainzl
2022 J jnl
Universal asymptotic properties of positive functional equations with one catalytic variable.
CoRR
Michael Drmota, Eva-Maria Hainzl
2022 J jnl
Universal singular exponents in catalytic variable equations.
J. Comb. Theory A
Michael Drmota, Marc Noy, Guan-Ru Yu
2021 J jnl
Node profiles of symmetric digital search trees: Concentration properties.
Random Struct. Algorithms
Michael Drmota, Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger
2020 J jnl
(Logarithmic) densities for automatic sequences along primes and squares.
CoRR
Boris Adamczewski, Michael Drmota, Clemens Müllner
2020 C ed.
31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2020, Klagenfurt, Austria (Virtual Conference), June 15-19, 2020
AofA
Michael Drmota, Clemens Heuberger
2020 C conf
Cut Vertices in Random Planar Maps.
AofA
Michael Drmota, Marc Noy, Benedikt Stufler
2020 J jnl
Maximal Independent Sets and Maximal Matchings in Series-Parallel and Related Graph Classes.
Electron. J. Comb.
Michael Drmota, Lander Ramos, Clément Requilé, Juanjo Rué
2020 J jnl
Preface.
Eur. J. Comb.
Michael Drmota, Mihyun Kang, Christian Krattenthaler, Jaroslav Nesetril
2020 J jnl
Sequential Universal Modeling for Non-Binary Sequences with Constrained Distributions.
CoRR
Michael Drmota, Gil I. Shamir, Wojciech Szpankowski
2019 J jnl
Asymmetric Rényi Problem.
Comb. Probab. Comput.
Michael Drmota, Abram Magner, Wojciech Szpankowski
2019 J jnl
Graph limits of random graphs from a subset of connected k-trees.
Random Struct. Algorithms
Michael Drmota, Emma Yu Jin, Benedikt Stufler
2019 J jnl
Limit laws of planar maps with prescribed vertex degrees.
Comb. Probab. Comput.
G. Collet, Michael Drmota, Lukas Daniel Klausner
2018 C conf
Maximal Independent Sets and Maximal Matchings in Series-Parallel and Related Graph Classes.
AofA
Michael Drmota, Lander Ramos, Clément Requilé, Juanjo Rué
2018 C conf
The Number of Double Triangles in Random Planar Maps.
AofA
Michael Drmota, Guan-Ru Yu
2017 — conf
External Profile of Symmetric Digital Search Trees (Extended Abstract).
ANALCO
Michael Drmota, Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger
2017 J jnl
Preface.
Electron. Notes Discret. Math.
Michael Drmota, Mihyun Kang, Christian Krattenthaler, Jaroslav Nesetril
2017 J jnl
Redundancy of Lossless Data Compression for Known Sources by Analytic Methods.
Found. Trends Commun. Inf. Theory
Michael Drmota, Wojciech Szpankowski
2017 J jnl
Subgraph statistics in subcritical graph classes.
Random Struct. Algorithms
Michael Drmota, Lander Ramos, Juanjo Rué
2016 J jnl
An Asymptotic Analysis of Labeled and Unlabeled k-Trees.
Algorithmica
Michael Drmota, Emma Yu Jin
2016 J jnl
Asymmetric Rényi Problem and PATRICIA Tries.
CoRR
Michael Drmota, Abram Magner, Wojciech Szpankowski
2016 J jnl
On a Conjecture of Cusick Concerning the Sum of Digits of n and n+t.
SIAM J. Discret. Math.
Michael Drmota, Manuel Kauers, Lukas Spiegelhofer
2016 — conf
Scaling limit of random
ANALCO
Michael Drmota, Emma Yu Jin
2015 J jnl
Formulae and Asymptotics for Coefficients of Algebraic Functions.
Comb. Probab. Comput.
Cyril Banderier, Michael Drmota
2015 J jnl
On a Conjecture of Cusick Concerning the Sum of Digits of n and n + t.
CoRR
Michael Drmota, Manuel Kauers, Lukas Spiegelhofer
2014 — ed.
2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2014, Portland, Oregon, USA, January 6, 2014
ANALCO
Michael Drmota, Mark Daniel Ward
2014 J jnl
Almost Every Tree With
Comb. Probab. Comput.
Michael Drmota, Anna S. Lladó
2014 J jnl
Extremal statistics on non-crossing configurations.
Discret. Math.
Michael Drmota, Anna de Mier, Marc Noy
2014 — ch.
Subsequences of automatic sequences and uniform distribution.
Uniform Distribution and Quasi-Monte Carlo Methods
Michael Drmota
2013 J jnl
A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps.
Algorithmica
Michael Drmota, Konstantinos Panagiotou
2013 J jnl
A Master Theorem for Discrete Divide and Conquer Recurrences.
J. ACM
Michael Drmota, Wojciech Szpankowski
2013 J jnl
Embedded trees and the support of the ISE.
Eur. J. Comb.
Michael Drmota
2013 — conf
Extremal Parameters in Sub-Critical Graph Classes.
ANALCO
Michael Drmota, Marc Noy
2012 — conf
A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps.
ANALCO
Michael Drmota, Konstantinos Panagiotou
2012 J jnl
A precise analysis of Cuckoo hashing.
ACM Trans. Algorithms
Michael Drmota, Reinhard Kutzelnigg
2012 J jnl
Asymptotic enumeration of reversible maps regardless of genus.
Ars Math. Contemp.
Michael Drmota, Roman Nedela
2012 B conf
Mutual information for a deletion channel.
ISIT
Michael Drmota, Wojciech Szpankowski, Krishnamurthy Viswanathan
2012 A* conf
The maximum degree of random planar graphs.
SODA
Michael Drmota, Omer Giménez, Marc Noy, Konstantinos Panagiotou, Angelika Steger
2011 A* conf
A Master Theorem for Discrete Divide and Conquer Recurrences.
SODA
Michael Drmota, Wojciech Szpankowski
2011 B conf
Analysis of a Block Arithmetic Coding: Discrete divide and conquer recurrences.
ISIT
Michael Drmota, Wojciech Szpankowski
2011 J jnl
Asymptotic Study of Subcritical Graph Classes.
SIAM J. Discret. Math.
Michael Drmota, Éric Fusy, Mihyun Kang, Veronika Kraus, Juanjo Rué
2011 J jnl
Degree distribution in random planar graphs.
J. Comb. Theory A
Michael Drmota, Omer Giménez, Marc Noy
2011 J jnl
The Maximum Degree of Series-Parallel Graphs.
Comb. Probab. Comput.
Michael Drmota, Omer Giménez, Marc Noy
2011 J jnl
The expected profile of digital search trees.
J. Comb. Theory A
Michael Drmota, Wojciech Szpankowski
2011 J jnl
The sum-of-digits function of polynomial sequences.
J. Lond. Math. Soc.
Michael Drmota, Christian Mauduit, Joël Rivat
2011 J jnl
Universal exponents and tail estimates in the enumeration of planar maps.
Electron. Notes Discret. Math.
Michael Drmota, Marc Noy
2010 J jnl
The shape of unlabeled rooted random trees.
Eur. J. Comb.
Michael Drmota, Bernhard Gittenberger
2010 J jnl
Tunstall code, Khodak variations, and random walks.
IEEE Trans. Inf. Theory
Michael Drmota, Yuriy A. Reznik, Wojciech Szpankowski
2010 J jnl
Vertices of given degree in series-parallel graphs.
Random Struct. Algorithms
Michael Drmota, Omer Giménez, Marc Noy
2009 A* conf
(Un)expected behavior of digital search tree profile.
SODA
Michael Drmota, Wojciech Szpankowski
2009 J jnl
A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree.
Random Struct. Algorithms
Michael Drmota, Alexander Iksanov, Martin Möhle, Uwe Roesler
2009 C conf
Combinatorial Models for Cooperation Networks.
IWOCA
Michael Drmota, Bernhard Gittenberger, Reinhard Kutzelnigg
2009 C conf
Embedded Trees and the Support of the ISE.
IWOCA
Michael Drmota
2008 J jnl
Newman's phenomenon for generalized Thue-Morse sequences.
Discret. Math.
Michael Drmota, Thomas Stoll
2008 J jnl
On the Construction of (Explicit) Khodak's Code and Its Analysis.
IEEE Trans. Inf. Theory
Yann Bugeaud, Michael Drmota, Wojciech Szpankowski
2008 — ed.
Proceedings of the 2008 International Conference on Information Theory and Statistical Learning, ITSL 2008, Las Vegas, Nevada, USA, July 14-17, 2008
ITSL
Matthias Dehmer, Michael Drmota, Frank Emmert-Streib
2008 J jnl
The Distribution of Patterns in Random Trees.
Comb. Probab. Comput.
Frédéric Chyzak, Michael Drmota, Thomas Klausner, Gerard Kok
2006 B conf
Precise Asymptotic Analysis of the Tunstall Code.
ISIT
Michael Drmota, Yuriy A. Reznik, Serap A. Savari, Wojciech Szpankowski
2006 J jnl
The Distribution of Patterns in Random Trees
CoRR
Frédéric Chyzak, Michael Drmota, Thomas Klausner, Gerard Kok
2006 J jnl
The Random Multisection Problem, Travelling Waves and the Distribution of the Height of m-Ary Search Trees.
Algorithmica
Brigitte Chauvin, Michael Drmota
2006 J jnl
The register function for
ACM Trans. Algorithms
Michael Drmota, Helmut Prodinger
2005 J jnl
Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees.
SIAM J. Discret. Math.
Michael Drmota, Hsien-Kuei Hwang
2005 J jnl
Extended admissible functions and Gaussian limiting distributions.
Math. Comput.
Michael Drmota, Bernhard Gittenberger, Thomas Klausner
2004 J jnl
General urn models with several types of balls and Gaussian limiting fields.
Random Struct. Algorithms
Michael Drmota, Danièle Gardy, Bernhard Gittenberger
2004 J jnl
On Robson's convergence and boundedness conjectures concerning the height of binary search trees.
Theor. Comput. Sci.
Michael Drmota
2004 J jnl
Precise minimax redundancy and regret.
IEEE Trans. Inf. Theory
Michael Drmota, Wojciech Szpankowski
2004 J jnl
Special Issue on Analysis of Algorithms.
Comb. Probab. Comput.
Michael Drmota, Wojciech Szpankowski
2004 J jnl
The Width of Galton-Watson Trees Conditioned by the Size.
Discret. Math. Theor. Comput. Sci.
Michael Drmota, Bernhard Gittenberger
2004 B conf
Variable-to-variable codes with small redundancy rates.
ISIT
Michael Drmota, Wojciech Szpankowski
2003 J jnl
An analytic approach to the height of binary search trees II.
J. ACM
Michael Drmota
2003 J jnl
Analysis of Algorithms (AofA) Part II: 1998-2000 ("Princeton-Barcelona-Gdansk").
Bull. EATCS
Michael Drmota, Wojciech Szpankowski
2003 — conf
Discrete Random Walks on One-Sided "Periodic" Graphs.
DRW
Michael Drmota
2002 J jnl
A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem.
Des. Codes Cryptogr.
Michael Drmota, Daniel Panario
2002 B conf
Generalized Shannon Code Minimizes the Maximal Redundancy.
LATIN
Michael Drmota, Wojciech Szpankowski
2002 B conf
Precise Average Redundancy Of An Idealized Arithmetic Codin.
DCC
Michael Drmota, Hsien-Kuei Hwang, Wojciech Szpankowski
2002 J jnl
The Variance of the height of binary search trees.
Theor. Comput. Sci.
Michael Drmota
2002 J jnl
The height of q-Binary Search Trees.
Discret. Math. Theor. Comput. Sci.
Michael Drmota, Helmut Prodinger
2002 J jnl
The variance of the height of digital search trees.
Acta Informatica
Michael Drmota
2001 J jnl
A Unified Presentation of Some Urn Models.
Algorithmica
Michael Drmota, Danièle Gardy, Bernhard Gittenberger
2001 J jnl
An Analytic Approach to the Height of Binary Search Trees.
Algorithmica
Michael Drmota
2001 J jnl
The Asymptotic Number of Leftist Trees.
Algorithmica
Michael Drmota
1999 J jnl
The distribution of nodes of given degree in random trees.
J. Graph Theory
Michael Drmota, Bernhard Gittenberger
1998 J jnl
The Complete Solution of the Competitive Rank Selection Problem.
Algorithmica
F. Thomas Bruss, Michael Drmota, Guy Louchard
1997 J jnl
Images and Preimages in Random Mappings.
SIAM J. Discret. Math.
Michael Drmota, Michèle Soria
1997 J jnl
On the profile of random trees.
Random Struct. Algorithms
Michael Drmota, Bernhard Gittenberger
1997 J jnl
Systems of functional equations.
Random Struct. Algorithms
Michael Drmota
1996 J jnl
Predecessors in Random Mappings.
Comb. Probab. Comput.
Gerd Baron, Michael Drmota, Ljuben R. Mutafchiev
1995 J jnl
Correlations on the Strata of a Random Mapping.
Random Struct. Algorithms
Michael Drmota
1995 J jnl
Marking in Combinatorial Constructions: Generating Functions and Limiting Distributions.
Theor. Comput. Sci.
Michael Drmota, Michèle Soria
1994 J jnl
A Bivariate Asymptotic Expansion of Coefficients of Powers of Generating Functions.
Eur. J. Comb.
Michael Drmota
1994 J jnl
Asymptotic Distributions and a Multivariate Darboux Method in Enumeration Problems.
J. Comb. Theory A
Michael Drmota
1994 J jnl
The Instability Time Distribution Behavior of Slotted ALOHA.
Random Struct. Algorithms
Michael Drmota
1993 J jnl
Exponential Limiting Distributions in Queueing Systems with Deadlines.
SIAM J. Appl. Math.
Michael Drmota, Ulrich Schmid
1993 J jnl
The analysis of the expected successful operation time of slotted Aloha.
IEEE Trans. Inf. Theory
Michael Drmota, Ulrich Schmid
1991 J jnl
On Generalized Independent Subsets of Trees.
Random Struct. Algorithms
Michael Drmota, Peter Kirschenhofer