Michael Drmota

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 29

Top Topics

Computationally Challenging

Digital Circuits

Extended Abstract

Top Venues

Comb. Probab. Comput.

Electron. J. Comb.

Publications

Arman Ferdowsi, Matthias Függer, Thomas Nowak, Michael Drmota, Ulrich Schmid
Faithful Dynamic Timing Analysis of Digital Circuits Using Continuous Thresholded Mode-Switched ODEs. CoRR (2024)
Jordi Castellví, Michael Drmota, Marc Noy, Clément Requilé
Chordal graphs with bounded tree-width. Adv. Appl. Math. 157 (2024)
Michael Drmota, Marc Noy, Benedikt Stufler
Cut Vertices in Random Planar Maps. Electron. J. Comb. 30 (3) (2023)
Michael Drmota, Marc Noy, Clément Requilé, Juanjo Rué
Random Cubic Planar Maps. Electron. J. Comb. 30 (2) (2023)
Michael Drmota, Marc Noy, Guan-Ru Yu
Universal singular exponents in catalytic variable equations. J. Comb. Theory, Ser. A 185 (2022)
Michael Drmota, Eva-Maria Hainzl
Universal Properties of Catalytic Variable Equations. AofA (2022)
Michael Drmota, Eva-Maria Hainzl
Universal asymptotic properties of positive functional equations with one catalytic variable. CoRR (2022)
Michael Drmota, Gil I. Shamir, Wojciech Szpankowski
Sequential universal modeling for non-binary sequences with constrained distributions. Commun. Inf. Syst. 22 (1) (2022)
Michael Drmota, Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger
Node profiles of symmetric digital search trees: Concentration properties. Random Struct. Algorithms 58 (3) (2021)
Michael Drmota, Gil I. Shamir, Wojciech Szpankowski
Sequential Universal Modeling for Non-Binary Sequences with Constrained Distributions. CoRR (2020)
Michael Drmota, Lander Ramos, Clément Requilé, Juanjo Rué
Maximal Independent Sets and Maximal Matchings in Series-Parallel and Related Graph Classes. Electron. J. Comb. 27 (1) (2020)
Michael Drmota, Mihyun Kang, Christian Krattenthaler, Jaroslav Nesetril
Preface. Eur. J. Comb. 88 (2020)
Michael Drmota, Marc Noy, Benedikt Stufler
Cut Vertices in Random Planar Maps. AofA (2020)
Boris Adamczewski, Michael Drmota, Clemens Müllner
(Logarithmic) densities for automatic sequences along primes and squares. CoRR (2020)
Michael Drmota, Emma Yu Jin, Benedikt Stufler
Graph limits of random graphs from a subset of connected k-trees. Random Struct. Algorithms 55 (1) (2019)
Michael Drmota, Abram Magner, Wojciech Szpankowski
Asymmetric Rényi Problem. Comb. Probab. Comput. 28 (4) (2019)
G. Collet, Michael Drmota, Lukas Daniel Klausner
Limit laws of planar maps with prescribed vertex degrees. Comb. Probab. Comput. 28 (4) (2019)
Michael Drmota, Lander Ramos, Clément Requilé, Juanjo Rué
Maximal Independent Sets and Maximal Matchings in Series-Parallel and Related Graph Classes. AofA (2018)
Michael Drmota, Guan-Ru Yu
The Number of Double Triangles in Random Planar Maps. AofA (2018)
Michael Drmota, Mihyun Kang, Christian Krattenthaler, Jaroslav Nesetril
Preface. Electron. Notes Discret. Math. 61 (2017)
Michael Drmota, Wojciech Szpankowski
Redundancy of Lossless Data Compression for Known Sources by Analytic Methods. Found. Trends Commun. Inf. Theory 13 (4) (2017)
Michael Drmota, Lander Ramos, Juanjo Rué
Subgraph statistics in subcritical graph classes. Random Struct. Algorithms 51 (4) (2017)
Michael Drmota, Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger
External Profile of Symmetric Digital Search Trees (Extended Abstract). ANALCO (2017)
Michael Drmota, Emma Yu Jin
An Asymptotic Analysis of Labeled and Unlabeled k-Trees. Algorithmica 75 (4) (2016)
Michael Drmota, Manuel Kauers, Lukas Spiegelhofer
On a Conjecture of Cusick Concerning the Sum of Digits of n and n+t. SIAM J. Discret. Math. 30 (2) (2016)
Michael Drmota, Emma Yu Jin
-trees. ANALCO (2016)
Michael Drmota, Abram Magner, Wojciech Szpankowski
Asymmetric Rényi Problem and PATRICIA Tries. CoRR (2016)
Cyril Banderier, Michael Drmota
Formulae and Asymptotics for Coefficients of Algebraic Functions. Comb. Probab. Comput. 24 (1) (2015)
Michael Drmota, Manuel Kauers, Lukas Spiegelhofer
On a Conjecture of Cusick Concerning the Sum of Digits of n and n + t. CoRR (2015)
Michael Drmota, Anna de Mier, Marc Noy
Extremal statistics on non-crossing configurations. Discret. Math. 327 (2014)
Michael Drmota, Anna S. Lladó
. Comb. Probab. Comput. 23 (1) (2014)
Michael Drmota, Konstantinos Panagiotou
A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps. Algorithmica 66 (4) (2013)
Michael Drmota, Wojciech Szpankowski
A Master Theorem for Discrete Divide and Conquer Recurrences. J. ACM 60 (3) (2013)
Michael Drmota, Marc Noy
Extremal Parameters in Sub-Critical Graph Classes. ANALCO (2013)
Michael Drmota
Embedded trees and the support of the ISE. Eur. J. Comb. 34 (1) (2013)
Michael Drmota, Konstantinos Panagiotou
A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps. ANALCO (2012)
Michael Drmota, Reinhard Kutzelnigg
A precise analysis of Cuckoo hashing. ACM Trans. Algorithms 8 (2) (2012)
Michael Drmota, Wojciech Szpankowski, Krishnamurthy Viswanathan
Mutual information for a deletion channel. ISIT (2012)
Michael Drmota, Roman Nedela
Asymptotic enumeration of reversible maps regardless of genus. Ars Math. Contemp. 5 (1) (2012)
Michael Drmota, Omer Giménez, Marc Noy, Konstantinos Panagiotou, Angelika Steger
The maximum degree of random planar graphs. SODA (2012)
Michael Drmota, Marc Noy
Universal exponents and tail estimates in the enumeration of planar maps. Electron. Notes Discret. Math. 38 (2011)
Michael Drmota, Omer Giménez, Marc Noy
The Maximum Degree of Series-Parallel Graphs. Comb. Probab. Comput. 20 (4) (2011)
Michael Drmota, Christian Mauduit, Joël Rivat
The sum-of-digits function of polynomial sequences. J. Lond. Math. Soc. 84 (1) (2011)
Michael Drmota, Wojciech Szpankowski
The expected profile of digital search trees. J. Comb. Theory, Ser. A 118 (7) (2011)
Michael Drmota, Omer Giménez, Marc Noy
Degree distribution in random planar graphs. J. Comb. Theory, Ser. A 118 (7) (2011)
Michael Drmota, Wojciech Szpankowski
Analysis of a Block Arithmetic Coding: Discrete divide and conquer recurrences. ISIT (2011)
Michael Drmota, Éric Fusy, Mihyun Kang, Veronika Kraus, Juanjo Rué
Asymptotic Study of Subcritical Graph Classes. SIAM J. Discret. Math. 25 (4) (2011)
Michael Drmota, Wojciech Szpankowski
A Master Theorem for Discrete Divide and Conquer Recurrences. SODA (2011)
Michael Drmota, Omer Giménez, Marc Noy
Vertices of given degree in series-parallel graphs. Random Struct. Algorithms 36 (3) (2010)
Michael Drmota, Bernhard Gittenberger
The shape of unlabeled rooted random trees. Eur. J. Comb. 31 (8) (2010)
Michael Drmota, Yuriy A. Reznik, Wojciech Szpankowski
Tunstall code, Khodak variations, and random walks. IEEE Trans. Inf. Theory 56 (6) (2010)
Michael Drmota, Alexander Iksanov, Martin Moehle, Uwe Roesler
A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree. Random Struct. Algorithms 34 (3) (2009)
Michael Drmota, Wojciech Szpankowski
(Un)expected behavior of digital search tree profile. SODA (2009)
Michael Drmota, Bernhard Gittenberger, Reinhard Kutzelnigg
Combinatorial Models for Cooperation Networks. IWOCA (2009)
Michael Drmota
Embedded Trees and the Support of the ISE. IWOCA (2009)
Frédéric Chyzak, Michael Drmota, Thomas Klausner, Gerard Kok
The Distribution of Patterns in Random Trees. Comb. Probab. Comput. 17 (1) (2008)
Yann Bugeaud, Michael Drmota, Wojciech Szpankowski
On the Construction of (Explicit) Khodak's Code and Its Analysis. IEEE Trans. Inf. Theory 54 (11) (2008)
Michael Drmota, Thomas Stoll
Newman's phenomenon for generalized Thue-Morse sequences. Discret. Math. 308 (7) (2008)
Michael Drmota, Helmut Prodinger
-ary trees. ACM Trans. Algorithms 2 (3) (2006)
Frédéric Chyzak, Michael Drmota, Thomas Klausner, Gerard Kok
The Distribution of Patterns in Random Trees CoRR (2006)
Michael Drmota, Yuriy A. Reznik, Serap A. Savari, Wojciech Szpankowski
Precise Asymptotic Analysis of the Tunstall Code. ISIT (2006)
Brigitte Chauvin, Michael Drmota
The Random Multisection Problem, Travelling Waves and the Distribution of the Height of m-Ary Search Trees. Algorithmica 46 (3-4) (2006)
Michael Drmota, Bernhard Gittenberger, Thomas Klausner
Extended admissible functions and Gaussian limiting distributions. Math. Comput. 74 (252) (2005)
Michael Drmota, Hsien-Kuei Hwang
Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees. SIAM J. Discret. Math. 19 (1) (2005)
Michael Drmota, Bernhard Gittenberger
The Width of Galton-Watson Trees Conditioned by the Size. Discret. Math. Theor. Comput. Sci. 6 (2) (2004)
Michael Drmota
On Robson's convergence and boundedness conjectures concerning the height of binary search trees. Theor. Comput. Sci. 329 (1-3) (2004)
Michael Drmota, Wojciech Szpankowski
Variable-to-variable codes with small redundancy rates. ISIT (2004)
Michael Drmota, Wojciech Szpankowski
Special Issue on Analysis of Algorithms. Comb. Probab. Comput. 13 (4-5) (2004)
Michael Drmota, Wojciech Szpankowski
Precise minimax redundancy and regret. IEEE Trans. Inf. Theory 50 (11) (2004)
Michael Drmota, Danièle Gardy, Bernhard Gittenberger
General urn models with several types of balls and Gaussian limiting fields. Random Struct. Algorithms 24 (1) (2004)
Michael Drmota, Wojciech Szpankowski
Analysis of Algorithms (AofA) Part II: 1998-2000 ("Princeton-Barcelona-Gdansk"). Bull. EATCS 80 (2003)
Michael Drmota
An analytic approach to the height of binary search trees II. J. ACM 50 (3) (2003)
Michael Drmota
Discrete Random Walks on One-Sided "Periodic" Graphs. DRW (2003)
Michael Drmota
The variance of the height of digital search trees. Acta Informatica 38 (4) (2002)
Michael Drmota
The Variance of the height of binary search trees. Theor. Comput. Sci. 270 (1-2) (2002)
Michael Drmota, Hsien-Kuei Hwang, Wojciech Szpankowski
Precise Average Redundancy Of An Idealized Arithmetic Codin. DCC (2002)
Michael Drmota, Daniel Panario
A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem. Des. Codes Cryptogr. 26 (1-3) (2002)
Michael Drmota, Wojciech Szpankowski
Generalized Shannon Code Minimizes the Maximal Redundancy. LATIN (2002)
Michael Drmota, Helmut Prodinger
The height of q-Binary Search Trees. Discret. Math. Theor. Comput. Sci. 5 (1) (2002)
Michael Drmota, Danièle Gardy, Bernhard Gittenberger
A Unified Presentation of Some Urn Models. Algorithmica 29 (1) (2001)
Michael Drmota
The Asymptotic Number of Leftist Trees. Algorithmica 31 (3) (2001)
Michael Drmota
An Analytic Approach to the Height of Binary Search Trees. Algorithmica 29 (1) (2001)
Michael Drmota, Bernhard Gittenberger
The distribution of nodes of given degree in random trees. J. Graph Theory 31 (3) (1999)
F. Thomas Bruss, Michael Drmota, Guy Louchard
The Complete Solution of the Competitive Rank Selection Problem. Algorithmica 22 (4) (1998)
Michael Drmota
Systems of functional equations. Random Struct. Algorithms 10 (1-2) (1997)
Michael Drmota, Bernhard Gittenberger
On the profile of random trees. Random Struct. Algorithms 10 (4) (1997)
Michael Drmota, Michèle Soria
Images and Preimages in Random Mappings. SIAM J. Discret. Math. 10 (2) (1997)
Gerd Baron, Michael Drmota, Ljuben R. Mutafchiev
Predecessors in Random Mappings. Comb. Probab. Comput. 5 (1996)
Michael Drmota, Michèle Soria
Marking in Combinatorial Constructions: Generating Functions and Limiting Distributions. Theor. Comput. Sci. 144 (1&2) (1995)
Michael Drmota
Correlations on the Strata of a Random Mapping. Random Struct. Algorithms 6 (2/3) (1995)
Michael Drmota
A Bivariate Asymptotic Expansion of Coefficients of Powers of Generating Functions. Eur. J. Comb. 15 (2) (1994)
Michael Drmota
The Instability Time Distribution Behavior of Slotted ALOHA. Random Struct. Algorithms 5 (1) (1994)
Michael Drmota
Asymptotic Distributions and a Multivariate Darboux Method in Enumeration Problems. J. Comb. Theory, Ser. A 67 (2) (1994)
Michael Drmota, Ulrich Schmid
Exponential Limiting Distributions in Queueing Systems with Deadlines. SIAM J. Appl. Math. 53 (1) (1993)
Michael Drmota, Ulrich Schmid
The analysis of the expected successful operation time of slotted Aloha. IEEE Trans. Inf. Theory 39 (5) (1993)
Michael Drmota, Peter Kirschenhofer
On Generalized Independent Subsets of Trees. Random Struct. Algorithms 2 (2) (1991)