Michael Drmota

Michael Drmota: Embedded trees and the support of the ISE. Eur. J. Comb. 34(1): 123-137 (2013)

Michael Drmota, Marc Noy: Extremal Parameters in Sub-Critical Graph Classes. ANALCO 2013: 1-7

Michael Drmota, Reinhard Kutzelnigg: A precise analysis of Cuckoo hashing. ACM Transactions on Algorithms 8(2): 11 (2012)

Michael Drmota, Konstantinos Panagiotou: A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps. ANALCO 2012: 9-17

Michael Drmota, Wojciech Szpankowski, Krishnamurthy Viswanathan: Mutual information for a deletion channel. ISIT 2012: 2561-2565

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

Michael Drmota, Omer Giménez, Marc Noy: The Maximum Degree of Series-Parallel Graphs. Combinatorics, Probability & Computing 20(4): 529-570 (2011)

Michael Drmota, Marc Noy: Universal exponents and tail estimates in the enumeration of planar maps. Electronic Notes in Discrete Mathematics 38: 309-317 (2011)

Michael Drmota, Wojciech Szpankowski: The expected profile of digital search trees. J. Comb. Theory, Ser. A 118(7): 1939-1965 (2011)

Michael Drmota, Omer Giménez, Marc Noy: Degree distribution in random planar graphs. J. Comb. Theory, Ser. A 118(7): 2102-2130 (2011)

Michael Drmota, Christian Mauduit, Joël Rivat: The sum-of-digits function of polynomial sequences. J. London Math. Society 84(1): 81-102 (2011)

Michael Drmota, Éric Fusy, Mihyun Kang, Veronika Kraus, Juanjo Rué: Asymptotic Study of Subcritical Graph Classes. SIAM J. Discrete Math. 25(4): 1615-1651 (2011)

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

Michael Drmota, Wojciech Szpankowski: A Master Theorem for Discrete Divide and Conquer Recurrences. SODA 2011: 342-361

Michael Drmota, Bernhard Gittenberger: The shape of unlabeled rooted random trees. Eur. J. Comb. 31(8): 2028-2063 (2010)

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

Michael Drmota, Yuriy A. Reznik, Wojciech Szpankowski: Tunstall code, Khodak variations, and random walks. IEEE Transactions on Information Theory 56(6): 2928-2937 (2010)

Michael Drmota, Alex 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): 319-336 (2009)

Michael Drmota: Embedded Trees and the Support of the ISE. IWOCA 2009: 194-205

Michael Drmota, Bernhard Gittenberger, Reinhard Kutzelnigg: Combinatorial Models for Cooperation Networks. IWOCA 2009: 206-217

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

Frédéric Chyzak, Michael Drmota, Thomas Klausner, Gerard Kok: The Distribution of Patterns in Random Trees. Combinatorics, Probability & Computing 17(1): 21-59 (2008)

Michael Drmota, Th. Stoll: Newman's phenomenon for generalized Thue-Morse sequences. Discrete Mathematics 308(7): 1191-1208 (2008)

Yann Bugeaud, Michael Drmota, Wojciech Szpankowski: On the Construction of (Explicit) Khodak's Code and Its Analysis. IEEE Transactions on Information Theory 54(11): 5073-5086 (2008)

Matthias Dehmer, Michael Drmota, Frank Emmert-Streib (Eds.): Proceedings of the 2008 International Conference on Information Theory and Statistical Learning, ITSL 2008, Las Vegas, Nevada, USA, July 14-17, 2008. CSREA Press 2008, isbn 1-60132-079-5

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): 299-327 (2006)

Michael Drmota, Helmut Prodinger: The register function for t-ary trees. ACM Transactions on Algorithms 2(3): 318-334 (2006)

Frédéric Chyzak, Michael Drmota, Thomas Klausner, Gerard Kok: The Distribution of Patterns in Random Trees. CoRR abs/cs/0605019 (2006)

Michael Drmota, Bernhard Gittenberger, Thomas Klausner: Extended admissible functions and Gaussian limiting distributions. Math. Comput. 74(252): 1953-1966 (2005)

Michael Drmota, Hsien-Kuei Hwang: Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees. SIAM J. Discrete Math. 19(1): 19-45 (2005)

Michael Drmota, Wojciech Szpankowski: Special Issue on Analysis of Algorithms. Combinatorics, Probability & Computing 13(4-5): 415-417 (2004)

Michael Drmota, Bernhard Gittenberger: The Width of Galton-Watson Trees Conditioned by the Size. Discrete Mathematics & Theoretical Computer Science 6(2): 387-400 (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): 75-103 (2004)

Michael Drmota: On Robson's convergence and boundedness conjectures concerning the height of binary search trees. Theor. Comput. Sci. 329(1-3): 47-70 (2004)

Michael Drmota, Wojciech Szpankowski: Precise minimax redundancy and regret. IEEE Transactions on Information Theory 50(11): 2686-2707 (2004)

Michael Drmota, Wojciech Szpankowski: Analysis of Algorithms (AofA) Part II: 1998-2000 ("Princeton-Barcelona-Gdansk"). Bulletin of the EATCS 80: 61-76 (2003)

Michael Drmota: An analytic approach to the height of binary search trees II. J. ACM 50(3): 333-374 (2003)

Michael Drmota: Discrete Random Walks on One-Sided "Periodic" Graphs. DRW 2003: 83-94

Michael Drmota: The variance of the height of digital search trees. Acta Inf. 38(4): 261-276 (2002)

Michael Drmota, Daniel Panario: A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem. Des. Codes Cryptography 26(1-3): 229-241 (2002)

Michael Drmota, Helmut Prodinger: The height of q-Binary Search Trees. Discrete Mathematics & Theoretical Computer Science 5(1): 97-108 (2002)

Michael Drmota: The Variance of the height of binary search trees. Theor. Comput. Sci. 270(1-2): 913-919 (2002)

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

Michael Drmota, Wojciech Szpankowski: Generalized Shannon Code Minimizes the Maximal Redundancy. LATIN 2002: 306-318

Michael Drmota: An Analytic Approach to the Height of Binary Search Trees. Algorithmica 29(1): 89-119 (2001)

Michael Drmota, Danièle Gardy, Bernhard Gittenberger: A Unified Presentation of Some Urn Models. Algorithmica 29(1): 120-147 (2001)

Michael Drmota: The Asymptotic Number of Leftist Trees. Algorithmica 31(3): 304-317 (2001)

Michael Drmota, Bernhard Gittenberger: The distribution of nodes of given degree in random trees. Journal of Graph Theory 31(3): 227-253 (1999)

F. Thomas Bruss, Michael Drmota, Guy Louchard: The Complete Solution of the Competitive Rank Selection Problem. Algorithmica 22(4): 413-447 (1998)

Michael Drmota: Systems of functional equations. Random Struct. Algorithms 10(1-2): 103-124 (1997)

Michael Drmota, Bernhard Gittenberger: On the profile of random trees. Random Struct. Algorithms 10(4): 421-451 (1997)

Michael Drmota, Michèle Soria: Images and Preimages in Random Mappings. SIAM J. Discrete Math. 10(2): 246-269 (1997)

Gerd Baron, Michael Drmota, Ljuben R. Mutafchiev: Predecessors in Random Mappings. Combinatorics, Probability & Computing 5: 317-335 (1996)

Michael Drmota: Correlations on the Strata of a Random Mapping. Random Struct. Algorithms 6(2/3): 357-366 (1995)

Michael Drmota, Michèle Soria: Marking in Combinatorial Constructions: Generating Functions and Limiting Distributions. Theor. Comput. Sci. 144(1&2): 67-99 (1995)

Michael Drmota: A Bivariate Asymptotic Expansion of Coefficients of Powers of Generating Functions. Eur. J. Comb. 15(2): 139-152 (1994)

Michael Drmota: Asymptotic Distributions and a Multivariate Darboux Method in Enumeration Problems. J. Comb. Theory, Ser. A 67(2): 169-184 (1994)

Michael Drmota: The Instability Time Distribution Behavior of Slotted ALOHA. Random Struct. Algorithms 5(1): 33-44 (1994)

Michael Drmota, Ulrich Schmid: The analysis of the expected successful operation time of slotted Aloha. IEEE Transactions on Information Theory 39(5): 1567-1577 (1993)

Michael Drmota, Peter Kirschenhofer: On Generalized Independent Subsets of Trees. Random Struct. Algorithms 2(2): 187-208 (1991)