default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Drmota
Person information
- affiliation: TU Wien, Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j69]Jordi Castellví, Michael Drmota, Marc Noy, Clément Requilé:
Chordal graphs with bounded tree-width. Adv. Appl. Math. 157: 102700 (2024)- [c21]Michael Drmota, Philippe Jacquet, Changlong Wu, Wojciech Szpankowski:
Minimax Regret with Unbounded Weights. ISIT 2024: 2305-2310 - [i7]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 abs/2403.03235 (2024) - 2023
- [j68]Michael Drmota, Marc Noy, Clément Requilé, Juanjo Rué:
Random Cubic Planar Maps. Electron. J. Comb. 30(2) (2023) - [j67]Michael Drmota, Marc Noy, Benedikt Stufler:
Cut Vertices in Random Planar Maps. Electron. J. Comb. 30(3) (2023) - 2022
- [j66]Michael Drmota, Gil I. Shamir, Wojciech Szpankowski:
Sequential universal modeling for non-binary sequences with constrained distributions. Commun. Inf. Syst. 22(1): 1-38 (2022) - [j65]Michael Drmota, Marc Noy, Guan-Ru Yu:
Universal singular exponents in catalytic variable equations. J. Comb. Theory A 185: 105522 (2022) - [c20]Michael Drmota, Eva-Maria Hainzl:
Universal Properties of Catalytic Variable Equations. AofA 2022: 7:1-7:15 - [i6]Michael Drmota, Eva-Maria Hainzl:
Universal asymptotic properties of positive functional equations with one catalytic variable. CoRR abs/2212.07741 (2022) - 2021
- [j64]Michael Drmota, Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger:
Node profiles of symmetric digital search trees: Concentration properties. Random Struct. Algorithms 58(3): 430-467 (2021) - 2020
- [j63]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): 1 (2020) - [j62]Michael Drmota, Mihyun Kang, Christian Krattenthaler, Jaroslav Nesetril:
Preface. Eur. J. Comb. 88: 103169 (2020) - [c19]Michael Drmota, Marc Noy, Benedikt Stufler:
Cut Vertices in Random Planar Maps. AofA 2020: 10:1-10:18 - [e3]Michael Drmota, Clemens Heuberger:
31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2020, June 15-19, 2020, Klagenfurt, Austria (Virtual Conference). LIPIcs 159, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-147-4 [contents] - [i5]Michael Drmota, Gil I. Shamir, Wojciech Szpankowski:
Sequential Universal Modeling for Non-Binary Sequences with Constrained Distributions. CoRR abs/2005.10320 (2020) - [i4]Boris Adamczewski, Michael Drmota, Clemens Müllner:
(Logarithmic) densities for automatic sequences along primes and squares. CoRR abs/2009.14773 (2020)
2010 – 2019
- 2019
- [j61]G. Collet, Michael Drmota, Lukas Daniel Klausner:
Limit laws of planar maps with prescribed vertex degrees. Comb. Probab. Comput. 28(4): 519-541 (2019) - [j60]Michael Drmota, Abram Magner, Wojciech Szpankowski:
Asymmetric Rényi Problem. Comb. Probab. Comput. 28(4): 542-573 (2019) - [j59]Michael Drmota, Emma Yu Jin, Benedikt Stufler:
Graph limits of random graphs from a subset of connected k-trees. Random Struct. Algorithms 55(1): 125-152 (2019) - 2018
- [c18]Michael Drmota, Lander Ramos, Clément Requilé, Juanjo Rué:
Maximal Independent Sets and Maximal Matchings in Series-Parallel and Related Graph Classes. AofA 2018: 18:1-18:15 - [c17]Michael Drmota, Guan-Ru Yu:
The Number of Double Triangles in Random Planar Maps. AofA 2018: 19:1-19:18 - 2017
- [j58]Michael Drmota, Mihyun Kang, Christian Krattenthaler, Jaroslav Nesetril:
Preface. Electron. Notes Discret. Math. 61: 1-3 (2017) - [j57]Michael Drmota, Wojciech Szpankowski:
Redundancy of Lossless Data Compression for Known Sources by Analytic Methods. Found. Trends Commun. Inf. Theory 13(4): 277-417 (2017) - [j56]Michael Drmota, Lander Ramos, Juanjo Rué:
Subgraph statistics in subcritical graph classes. Random Struct. Algorithms 51(4): 631-673 (2017) - [c16]Michael Drmota, Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger:
External Profile of Symmetric Digital Search Trees (Extended Abstract). ANALCO 2017: 124-130 - 2016
- [j55]Michael Drmota, Emma Yu Jin:
An Asymptotic Analysis of Labeled and Unlabeled k-Trees. Algorithmica 75(4): 579-605 (2016) - [j54]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): 621-649 (2016) - [c15]Michael Drmota, Emma Yu Jin:
Scaling limit of random k-trees. ANALCO 2016: 56-65 - [i3]Michael Drmota, Abram Magner, Wojciech Szpankowski:
Asymmetric Rényi Problem and PATRICIA Tries. CoRR abs/1605.01814 (2016) - 2015
- [j53]Cyril Banderier, Michael Drmota:
Formulae and Asymptotics for Coefficients of Algebraic Functions. Comb. Probab. Comput. 24(1): 1-53 (2015) - [i2]Michael Drmota, Manuel Kauers, Lukas Spiegelhofer:
On a Conjecture of Cusick Concerning the Sum of Digits of n and n + t. CoRR abs/1509.08623 (2015) - 2014
- [j52]Michael Drmota, Anna S. Lladó:
Almost Every Tree With m Edges Decomposes K 2m, 2m . Comb. Probab. Comput. 23(1): 50-65 (2014) - [j51]Michael Drmota, Anna de Mier, Marc Noy:
Extremal statistics on non-crossing configurations. Discret. Math. 327: 103-117 (2014) - [p1]Michael Drmota:
Subsequences of automatic sequences and uniform distribution. Uniform Distribution and Quasi-Monte Carlo Methods 2014: 87-104 - [e2]Michael Drmota, Mark Daniel Ward:
2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2014, Portland, Oregon, USA, January 6, 2014. SIAM 2014, ISBN 978-1-61197-320-4 [contents] - 2013
- [j50]Michael Drmota, Konstantinos Panagiotou:
A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps. Algorithmica 66(4): 741-761 (2013) - [j49]Michael Drmota:
Embedded trees and the support of the ISE. Eur. J. Comb. 34(1): 123-137 (2013) - [j48]Michael Drmota, Wojciech Szpankowski:
A Master Theorem for Discrete Divide and Conquer Recurrences. J. ACM 60(3): 16:1-16:49 (2013) - [c14]Michael Drmota, Marc Noy:
Extremal Parameters in Sub-Critical Graph Classes. ANALCO 2013: 1-7 - 2012
- [j47]Michael Drmota, Roman Nedela:
Asymptotic enumeration of reversible maps regardless of genus. Ars Math. Contemp. 5(1): 77-97 (2012) - [j46]Michael Drmota, Reinhard Kutzelnigg:
A precise analysis of Cuckoo hashing. ACM Trans. Algorithms 8(2): 11:1-11:36 (2012) - [c13]Michael Drmota, Konstantinos Panagiotou:
A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps. ANALCO 2012: 9-15 - [c12]Michael Drmota, Wojciech Szpankowski, Krishnamurthy Viswanathan:
Mutual information for a deletion channel. ISIT 2012: 2561-2565 - [c11]Michael Drmota, Omer Giménez, Marc Noy, Konstantinos Panagiotou, Angelika Steger:
The maximum degree of random planar graphs. SODA 2012: 281-287 - 2011
- [j45]Michael Drmota, Omer Giménez, Marc Noy:
The Maximum Degree of Series-Parallel Graphs. Comb. Probab. Comput. 20(4): 529-570 (2011) - [j44]Michael Drmota, Marc Noy:
Universal exponents and tail estimates in the enumeration of planar maps. Electron. Notes Discret. Math. 38: 309-317 (2011) - [j43]Michael Drmota, Wojciech Szpankowski:
The expected profile of digital search trees. J. Comb. Theory A 118(7): 1939-1965 (2011) - [j42]Michael Drmota, Omer Giménez, Marc Noy:
Degree distribution in random planar graphs. J. Comb. Theory A 118(7): 2102-2130 (2011) - [j41]Michael Drmota, Christian Mauduit, Joël Rivat:
The sum-of-digits function of polynomial sequences. J. Lond. Math. Soc. 84(1): 81-102 (2011) - [j40]Michael Drmota, Éric Fusy, Mihyun Kang, Veronika Kraus, Juanjo Rué:
Asymptotic Study of Subcritical Graph Classes. SIAM J. Discret. Math. 25(4): 1615-1651 (2011) - [c10]Michael Drmota, Wojciech Szpankowski:
Analysis of a Block Arithmetic Coding: Discrete divide and conquer recurrences. ISIT 2011: 1317-1321 - [c9]Michael Drmota, Wojciech Szpankowski:
A Master Theorem for Discrete Divide and Conquer Recurrences. SODA 2011: 342-361 - 2010
- [j39]Michael Drmota, Bernhard Gittenberger:
The shape of unlabeled rooted random trees. Eur. J. Comb. 31(8): 2028-2063 (2010) - [j38]Michael Drmota, Omer Giménez, Marc Noy:
Vertices of given degree in series-parallel graphs. Random Struct. Algorithms 36(3): 273-314 (2010) - [j37]Michael Drmota, Yuriy A. Reznik, Wojciech Szpankowski:
Tunstall code, Khodak variations, and random walks. IEEE Trans. Inf. Theory 56(6): 2928-2937 (2010)
2000 – 2009
- 2009
- [j36]Michael Drmota, Alexander Iksanov, Martin Möhle, 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) - [c8]Michael Drmota:
Embedded Trees and the Support of the ISE. IWOCA 2009: 194-205 - [c7]Michael Drmota, Bernhard Gittenberger, Reinhard Kutzelnigg:
Combinatorial Models for Cooperation Networks. IWOCA 2009: 206-217 - [c6]Michael Drmota, Wojciech Szpankowski:
(Un)expected behavior of digital search tree profile. SODA 2009: 130-138 - 2008
- [j35]Frédéric Chyzak, Michael Drmota, Thomas Klausner, Gerard Kok:
The Distribution of Patterns in Random Trees. Comb. Probab. Comput. 17(1): 21-59 (2008) - [j34]Michael Drmota, Thomas Stoll:
Newman's phenomenon for generalized Thue-Morse sequences. Discret. Math. 308(7): 1191-1208 (2008) - [j33]Yann Bugeaud, Michael Drmota, Wojciech Szpankowski:
On the Construction of (Explicit) Khodak's Code and Its Analysis. IEEE Trans. Inf. Theory 54(11): 5073-5086 (2008) - [e1]Matthias Dehmer, Michael Drmota, Frank Emmert-Streib:
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 [contents] - 2006
- [j32]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) - [j31]Michael Drmota, Helmut Prodinger:
The register function for t-ary trees. ACM Trans. Algorithms 2(3): 318-334 (2006) - [c5]Michael Drmota, Yuriy A. Reznik, Serap A. Savari, Wojciech Szpankowski:
Precise Asymptotic Analysis of the Tunstall Code. ISIT 2006: 2334-2337 - [i1]Frédéric Chyzak, Michael Drmota, Thomas Klausner, Gerard Kok:
The Distribution of Patterns in Random Trees. CoRR abs/cs/0605019 (2006) - 2005
- [j30]Michael Drmota, Bernhard Gittenberger, Thomas Klausner:
Extended admissible functions and Gaussian limiting distributions. Math. Comput. 74(252): 1953-1966 (2005) - [j29]Michael Drmota, Hsien-Kuei Hwang:
Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees. SIAM J. Discret. Math. 19(1): 19-45 (2005) - 2004
- [j28]Michael Drmota, Wojciech Szpankowski:
Special Issue on Analysis of Algorithms. Comb. Probab. Comput. 13(4-5): 415-417 (2004) - [j27]Michael Drmota, Bernhard Gittenberger:
The Width of Galton-Watson Trees Conditioned by the Size. Discret. Math. Theor. Comput. Sci. 6(2): 387-400 (2004) - [j26]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) - [j25]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) - [j24]Michael Drmota, Wojciech Szpankowski:
Precise minimax redundancy and regret. IEEE Trans. Inf. Theory 50(11): 2686-2707 (2004) - [c4]Michael Drmota, Wojciech Szpankowski:
Variable-to-variable codes with small redundancy rates. ISIT 2004: 91 - 2003
- [j23]Michael Drmota, Wojciech Szpankowski:
Analysis of Algorithms (AofA) Part II: 1998-2000 ("Princeton-Barcelona-Gdansk"). Bull. EATCS 80: 61-76 (2003) - [j22]Michael Drmota:
An analytic approach to the height of binary search trees II. J. ACM 50(3): 333-374 (2003) - [c3]Michael Drmota:
Discrete Random Walks on One-Sided "Periodic" Graphs. DRW 2003: 83-94 - 2002
- [j21]Michael Drmota:
The variance of the height of digital search trees. Acta Informatica 38(4): 261-276 (2002) - [j20]Michael Drmota, Daniel Panario:
A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem. Des. Codes Cryptogr. 26(1-3): 229-241 (2002) - [j19]Michael Drmota, Helmut Prodinger:
The height of q-Binary Search Trees. Discret. Math. Theor. Comput. Sci. 5(1): 97-108 (2002) - [j18]Michael Drmota:
The Variance of the height of binary search trees. Theor. Comput. Sci. 270(1-2): 913-919 (2002) - [c2]Michael Drmota, Hsien-Kuei Hwang, Wojciech Szpankowski:
Precise Average Redundancy Of An Idealized Arithmetic Codin. DCC 2002: 222- - [c1]Michael Drmota, Wojciech Szpankowski:
Generalized Shannon Code Minimizes the Maximal Redundancy. LATIN 2002: 306-318 - 2001
- [j17]Michael Drmota:
An Analytic Approach to the Height of Binary Search Trees. Algorithmica 29(1): 89-119 (2001) - [j16]Michael Drmota, Danièle Gardy, Bernhard Gittenberger:
A Unified Presentation of Some Urn Models. Algorithmica 29(1): 120-147 (2001) - [j15]Michael Drmota:
The Asymptotic Number of Leftist Trees. Algorithmica 31(3): 304-317 (2001)
1990 – 1999
- 1999
- [j14]Michael Drmota, Bernhard Gittenberger:
The distribution of nodes of given degree in random trees. J. Graph Theory 31(3): 227-253 (1999) - 1998
- [j13]F. Thomas Bruss, Michael Drmota, Guy Louchard:
The Complete Solution of the Competitive Rank Selection Problem. Algorithmica 22(4): 413-447 (1998) - 1997
- [j12]Michael Drmota:
Systems of functional equations. Random Struct. Algorithms 10(1-2): 103-124 (1997) - [j11]Michael Drmota, Bernhard Gittenberger:
On the profile of random trees. Random Struct. Algorithms 10(4): 421-451 (1997) - [j10]Michael Drmota, Michèle Soria:
Images and Preimages in Random Mappings. SIAM J. Discret. Math. 10(2): 246-269 (1997) - 1996
- [j9]Gerd Baron, Michael Drmota, Ljuben R. Mutafchiev:
Predecessors in Random Mappings. Comb. Probab. Comput. 5: 317-335 (1996) - 1995
- [j8]Michael Drmota:
Correlations on the Strata of a Random Mapping. Random Struct. Algorithms 6(2/3): 357-366 (1995) - [j7]Michael Drmota, Michèle Soria:
Marking in Combinatorial Constructions: Generating Functions and Limiting Distributions. Theor. Comput. Sci. 144(1&2): 67-99 (1995) - 1994
- [j6]Michael Drmota:
A Bivariate Asymptotic Expansion of Coefficients of Powers of Generating Functions. Eur. J. Comb. 15(2): 139-152 (1994) - [j5]Michael Drmota:
Asymptotic Distributions and a Multivariate Darboux Method in Enumeration Problems. J. Comb. Theory A 67(2): 169-184 (1994) - [j4]Michael Drmota:
The Instability Time Distribution Behavior of Slotted ALOHA. Random Struct. Algorithms 5(1): 33-44 (1994) - 1993
- [j3]Michael Drmota, Ulrich Schmid:
Exponential Limiting Distributions in Queueing Systems with Deadlines. SIAM J. Appl. Math. 53(1): 301-318 (1993) - [j2]Michael Drmota, Ulrich Schmid:
The analysis of the expected successful operation time of slotted Aloha. IEEE Trans. Inf. Theory 39(5): 1567-1577 (1993) - 1991
- [j1]Michael Drmota, Peter Kirschenhofer:
On Generalized Independent Subsets of Trees. Random Struct. Algorithms 2(2): 187-208 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-12 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
