| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Michael Drmota, Reinhard Kutzelnigg |
A precise analysis of Cuckoo hashing.  |
ACM Transactions on Algorithms  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Omer Giménez, Marc Noy, Konstantinos Panagiotou, Angelika Steger |
The maximum degree of random planar graphs. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Michael Drmota, Wojciech Szpankowski |
The expected profile of digital search trees. |
J. Comb. Theory, Ser. A |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Omer Giménez, Marc Noy |
Degree distribution in random planar graphs. |
J. Comb. Theory, Ser. A |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Marc Noy |
Universal exponents and tail estimates in the enumeration of planar maps. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Omer Giménez, Marc Noy |
The Maximum Degree of Series-Parallel Graphs. |
Combinatorics, Probability & Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Éric Fusy, Mihyun Kang, Veronika Kraus, Juanjo Rué |
Asymptotic Study of Subcritical Graph Classes. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Wojciech Szpankowski |
A Master Theorem for Discrete Divide and Conquer Recurrences. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Michael Drmota, Wojciech Szpankowski |
Analysis of a Block Arithmetic Coding: Discrete divide and conquer recurrences. |
ISIT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Bernhard Gittenberger |
The shape of unlabeled rooted random trees. |
Eur. J. Comb. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Omer Giménez, Marc Noy |
Vertices of given degree in series-parallel graphs. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Yuriy A. Reznik, Wojciech Szpankowski |
Tunstall code, Khodak variations, and random walks. |
IEEE Transactions on Information Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Wojciech Szpankowski |
(Un)expected behavior of digital search tree profile. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Bernhard Gittenberger, Reinhard Kutzelnigg |
Combinatorial Models for Cooperation Networks. |
IWOCA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota |
Embedded Trees and the Support of the ISE. |
IWOCA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Th. Stoll |
Newman's phenomenon for generalized Thue-Morse sequences. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Chyzak, Michael Drmota, Thomas Klausner, Gerard Kok |
The Distribution of Patterns in Random Trees. |
Combinatorics, Probability & Computing |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yann Bugeaud, Michael Drmota, Wojciech Szpankowski |
On the Construction of (Explicit) Khodak's Code and Its Analysis. |
IEEE Transactions on Information Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
ITSL |
2008 |
DBLP BibTeX RDF |
|
| 1 | Brigitte Chauvin, Michael Drmota |
The Random Multisection Problem, Travelling Waves and the Distribution of the Height of m-Ary Search Trees. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Helmut Prodinger |
The register function for t-ary trees. |
ACM Transactions on Algorithms |
2006 |
DBLP DOI BibTeX RDF |
Horton-Strahler numbers, Register function, generating functions, asymptotics |
| 1 | Frédéric Chyzak, Michael Drmota, Thomas Klausner, Gerard Kok |
The Distribution of Patterns in Random Trees |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Michael Drmota, Hsien-Kuei Hwang |
Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees. |
SIAM J. Discrete Math. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Bernhard Gittenberger, Thomas Klausner |
Extended admissible functions and Gaussian limiting distributions. |
Math. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota |
On Robson's convergence and boundedness conjectures concerning the height of binary search trees. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Bernhard Gittenberger |
The Width of Galton-Watson Trees Conditioned by the Size. |
Discrete Mathematics & Theoretical Computer Science |
2004 |
DBLP BibTeX RDF |
|
| 1 | Michael Drmota, Danièle Gardy, Bernhard Gittenberger |
General urn models with several types of balls and Gaussian limiting fields. |
Random Struct. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Wojciech Szpankowski |
Special Issue on Analysis of Algorithms. |
Combinatorics, Probability & Computing |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Wojciech Szpankowski |
Precise minimax redundancy and regret. |
IEEE Transactions on Information Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota |
An analytic approach to the height of binary search trees II. |
J. ACM |
2003 |
DBLP DOI BibTeX RDF |
saturation level, generating functions, average case analysis, Binary search tree, height |
| 1 | Michael Drmota, Wojciech Szpankowski |
Analysis of Algorithms (AofA) Part II: 1998-2000 ("Princeton-Barcelona-Gdansk"). |
Bulletin of the EATCS |
2003 |
DBLP BibTeX RDF |
|
| 1 | Michael Drmota |
Discrete Random Walks on One-Sided "Periodic" Graphs. |
DRW |
2003 |
DBLP BibTeX RDF |
|
| 1 | Michael Drmota |
The Variance of the height of binary search trees. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota |
The variance of the height of digital search trees. |
Acta Inf. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Helmut Prodinger |
The height of q-Binary Search Trees. |
Discrete Mathematics & Theoretical Computer Science |
2002 |
DBLP BibTeX RDF |
|
| 1 | Michael Drmota, Daniel Panario |
A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem. |
Des. Codes Cryptography |
2002 |
DBLP BibTeX RDF |
|
| 1 | Michael Drmota, Wojciech Szpankowski |
Generalized Shannon Code Minimizes the Maximal Redundancy. |
LATIN |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Hsien-Kuei Hwang, Wojciech Szpankowski |
Precise Average Redundancy Of An Idealized Arithmetic Codin. |
DCC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Danièle Gardy, Bernhard Gittenberger |
A Unified Presentation of Some Urn Models. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota |
An Analytic Approach to the Height of Binary Search Trees. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
Leftist trees, Generating functions, Asymptotic expansions |
| 1 | Michael Drmota |
The Asymptotic Number of Leftist Trees. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | F. Thomas Bruss, Michael Drmota, Guy Louchard |
The Complete Solution of the Competitive Rank Selection Problem. |
Algorithmica |
1998 |
DBLP DOI BibTeX RDF |
Competitive secretary problem, No-information case, Relative ranks, Recursive sequences, Convergence of recursive solutions, Discrepancy problems, Nash equilibrium, Algorithm analysis, Minimax optimal |
| 1 | Michael Drmota |
Systems of functional equations. |
Random Struct. Algorithms |
1997 |
DBLP BibTeX RDF |
|
| 1 | Michael Drmota, Bernhard Gittenberger |
On the profile of random trees. |
Random Struct. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Michèle Soria |
Images and Preimages in Random Mappings. |
SIAM J. Discrete Math. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerd Baron, Michael Drmota, Ljuben R. Mutafchiev |
Predecessors in Random Mappings. |
Combinatorics, Probability & Computing |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Michèle Soria |
Marking in Combinatorial Constructions: Generating Functions and Limiting Distributions. |
Theor. Comput. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota |
Correlations on the Strata of a Random Mapping. |
Random Struct. Algorithms |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota |
Asymptotic Distributions and a Multivariate Darboux Method in Enumeration Problems. |
J. Comb. Theory, Ser. A |
1994 |
DBLP BibTeX RDF |
|
| 1 | Michael Drmota |
A Bivariate Asymptotic Expansion of Coefficients of Powers of Generating Functions. |
Eur. J. Comb. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota |
The Instability Time Distribution Behavior of Slotted ALOHA. |
Random Struct. Algorithms |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Ulrich Schmid |
The analysis of the expected successful operation time of slotted Aloha. |
IEEE Transactions on Information Theory |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Peter Kirschenhofer |
On Generalized Independent Subsets of Trees. |
Random Struct. Algorithms |
1991 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")