Publikationsliste für
Michael Drmota
als Autorin / Autor bzw. wesentlich beteiligte Person
308 Datensätze (1987 - 2021)
Die Publikationen der TU Wien sind erst ab dem Jahr 2002 vollzählig in der Publikationsdatenbank enthalten. Publikationen aus den Jahren vor 2002 können, müssen aber nicht in der Datenbank vorhanden sein.
Bücher und Buch-Herausgaben
M. Dehmer, M. Drmota, F. Emmert-Streib (Hrg.):
"Proceedings of the 2008 International Conference on Information Theory and Statistical Learning";
CSREA Press,
2008,
ISBN: 1-60132-079-5.
M. Drmota:
"Random Trees (An Interplay between Combinatorics and Probability)";
Springer,
2009,
ISBN: 978-3-211-75355-2;
454 S.
M. Drmota, P. Flajolet, D. Gardy, B. Gittenberger (Hrg.):
"Mathematics and Computer Science III";
Birkhäuser,
2004,
ISBN: 3-7643-7128-5.
M. Drmota, B. Gittenberger (Hrg.):
"Proceedings of the 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)";
Discrete Mathematics and Theoretical Computer Science,
2010,
602 S.
M. Drmota, B. Gittenberger, G. Karigl, A. Panholzer:
"Mathematik für Informatik";
Heldermann Verlag,
2007,
ISBN: 978-3-88538-117-4;
438 S.
M. Drmota, B. Gittenberger, G. Karigl, A. Panholzer:
"Mathematik für Informatik";
Heldermann Verlag,
2010,
ISBN: 978-3-88538-117-4;
438 S.
M. Drmota, B. Gittenberger, G. Karigl, A. Panholzer (Hrg.):
"Mathematik für Informatik. Vierte erweiterte Auflage";
Heldermann Verlag,
2014,
ISBN: 978-3-88538-117-4;
470 S.
M. Drmota, G. Larcher, R. Tichy, R. Winkler (Hrg.):
"Proceedings of the 2004 Number Theoretic Algorithms and Related Topics Workshop";
Editors: Melvyn Nathanson, Jaroslav Nesetril, Carl Pomerance,
2005,
ISSN: 1553-1732.
M. Drmota, W. Szpankowski (Hrg.):
"Combinatorics, Probability and Computing (Vol. 13, No. 4 & 5)";
Cambridge University Press,
Cambridge, UK,
2004,
ISSN: 0963-5483.
Zeitschriftenartikel
B. Adamczewski, M. Drmota, C. Müllner:
"(Logarithmic) densities for automatic sequences along primes and squares";
ArXiv,
Preprint
(2020).
B. Adamczewski, M. Drmota, C. Müllner:
"(Logarithmic) Densities for Automatic Sequences along Primes and Squares";
Transactions of the American Mathematical Society,
1900
(2021).
H. Albrecher, M. Drmota, M. Goldstern, R. Winkler:
"Robert F. Tichy: 50 years - The unreasonable effectiveness of a number theorist,";
Uniform Distribution Theory,
2
(2007),
1;
S. 151
- 160.
A. Arnold, M. Drmota, U. Schmock, R. Viertl:
"Mathematik in Wien: Technische Universität Wien";
Internationale Mathematische Nachrichten,
216
(2011),
S. 31
- 52.
C. Banderier, M. Drmota:
"Formulae and Asymptotics for Coefficients of Algebraic Functions";
Combinatorics, Probability and Computing,
24
(2015),
Special Issue 01;
S. 1
- 53.
Zusätzliche Informationen
Y. Bugeaud, M. Drmota, B. De Mathan:
"On a mixed Littlewood conjecture in Diophantine approximation";
Acta Arithmetica,
128.2
(2007),
S. 107
- 124.
Y. Bugeaud, M. Drmota, W. Szpankowski:
"On the construction of (explicit) Khodak´s code and its analysis";
IEEE Transactions on Information Theory,
54
(2008),
11;
S. 5073
- 5086.
C. Chyzak, M. Drmota, T. Klausner, G. Kok:
"The distribution of patterns in random trees";
Combinatorics, Probability and Computing,
17
(2008),
01;
S. 21
- 59.
J. Deshouillers, M. Drmota, C. Müllner:
"Automatic sequences generated by synchronizing automata fulfill the Sarnak conjecture";
Studia Mathematica,
231
(2015),
1;
S. 83
- 95.
Zusätzliche Informationen
M. Drmota:
"40 Jahre Mathematikolympiade";
Internationale Mathematische Nachrichten,
212
(2009),
S. 29
- 32.
M. Drmota:
"An Analytic Approach to the Height of Binary Search Trees II";
Journal of the ACM,
50
(2003),
S. 333
- 374.
M. Drmota:
"Asymptotic methods of enumeration and applications to Markov chain models";
Stochastic Models,
21
(2005),
S. 343
- 375.
M. Drmota:
"Combinatorics and asymptotics on trees";
CUBO A Mathematical Journal,
6
(2004),
2;
S. 105
- 136.
M. Drmota:
"Discrete Random Walks on One-Sided Periodic Graphs";
Discrete Mathematics & Theoretical Computer Science,
volAC
(2003),
S. 83
- 94.
M. Drmota:
"Embedded trees and the support of the ISE";
European Journal of Combinatorics,
34
(2012),
S. 123
- 137.
M. Drmota:
"On Robson´s convergence and boundednes conjecture concerning the height of binary search trees";
Theoretical Computer Science,
329
(2004),
S. 47
- 70.
M. Drmota:
"Profile and height of random binary search trees";
Journal of the Iranian Statistical Society,
3
(2004),
2;
S. 117
- 138.
M. Drmota:
"Stochastic analysis of tree-like data sturctures";
Proceedings of the Royal Society A - Mathematical, Physical and Engineering Sciences,
460
(2004),
S. 271
- 307.
M. Drmota:
"The discrepancy of generalized Van-der-Corput-Halton sequences";
Indagationes Mathematicae - New Series,
26
(2015),
5;
S. 748
- 759.
Zusätzliche Informationen
M. Drmota:
"The height of increasing trees";
Annals Of Combinatorics,
12
(2009),
4;
S. 373
- 402.
M. Drmota:
"The Variance of the height of Binary Search Trees";
Theoretical Computer Science,
270
(2002),
S. 913
- 919.
M. Drmota:
"The Variance of the height of digital search trees ";
Acta Informatica,
38
(2002),
S. 261
- 276.
M. Drmota, G. Collet, L. Klausner:
"Limit Laws of Planar Maps with Described Vertex Degrees";
Combinatorics, Probability and Computing,
28
(2019),
4, Special Issue (Analysis and Algorithms);
S. 519
- 541.
Zusätzliche Informationen
M. Drmota, F. Da Costa, M. Grinfield:
"Modelling silicosis: The structure of equilibria";
European Journal of Applied Mathematics,
31
(2020),
6;
S. 950
- 967.
Zusätzliche Informationen
M. Drmota, A. De Mier, M. Noy:
"Extremal statistics on non-crossing configurations";
Discrete Mathematics,
327
(2014),
S. 103
- 117.
M. Drmota, J. Deshouillers, L. Spiegelhofer, C. Müllner:
"Randomness and non-randomness properties of Piatetski-Shapiro sequences modulo m";
Mathematika,
65
(2019),
4;
S. 1051
- 1073.
Zusätzliche Informationen
M. Drmota, J. Deshoulliers, J. Morgenbesser:
"Subsequences of automatic sequences indexed by nc and correlations";
International Journal of Number Theory,
132
(2012),
S. 1837
- 1866.
M. Drmota, M. Fuchs, Y. Lee:
"Stochastic analysis of the extra clustering model for animal grouping";
Journal of Mathematical Biology,
online
(2015),
37 S.
Zusätzliche Informationen
M. Drmota, M. Fuchs, E. Mastavicius:
"Functional Limit Theorems for Digital Expansions";
Acta Mathematica Hungarica,
98
(2003),
S. 175
- 201.
M. Drmota, É. Fusy, M. Kang, V. Kraus, J. Rué:
"Asymptotic study of subcritical graph classes";
SIAM Journal on Discrete Mathematics,
25
(2011),
4;
S. 1615
- 1651.
M. Drmota, D. Gardy, B. Gittenberger:
"General urn models with several types of balls and Gaussian limiting fields";
Random Structures and Algorithms,
24/1
(2004),
S. 75
- 103.
M. Drmota, S. Gerhold:
"Disproof of a conjecture by Rademacher on partial fractions";
Proceedings of the American Mathematical Society, Series B,
1
(2014),
S. 121
- 134.
M. Drmota, O. Giménez, M. Koy, K. Panagiotou, A. Steger:
"The maximum degree of random planar graphs";
Proceedings of the London Mathematical Society,
London, UK
(2014),
109;
S. 892
- 920.
M. Drmota, O. Giménez, M. Noy:
"Degree distribution in random planar graphs";
Journal of Combinatorial Theory Series A,
118
(2011),
7;
S. 2102
- 2130.
M. Drmota, O. Giménez, M. Noy:
"The maximum degree of series-parallel graphs";
Combinatorics, Probability and Computing,
20
(2011),
4;
S. 529
- 570.
M. Drmota, O. Giménez, M. Noy:
"Vertices of given degree in series-parallel graphs";
Random Structures and Algorithms,
36
(2010),
3;
S. 273
- 314.
M. Drmota, B. Gittenberger:
"The shape of unlabeled rooted random trees";
European Journal of Combinatorics,
31
(2010),
S. 2028
- 2063.
M. Drmota, B. Gittenberger:
"The width of Galton-Watson trees conditioned by the size";
Discrete Mathematics & Theoretical Computer Science,
6/2
(2004),
S. 387
- 400.
M. Drmota, B. Gittenberger, T. Klausner:
"Extended Admissible Functions and Gaussian Limiting Distributions";
Mathematics of Computation,
74
(2005),
252;
S. 1953
- 1966.
M. Drmota, B. Gittenberger, A. Panholzer, H. Prodinger, M. Ward:
"On the shape of the fringe of various types of random trees";
Mathematical Methods in the Applied Sciences,
32
(2009),
S. 1207
- 1245.
M. Drmota, P. Grabner, P. Liardet:
"Block additive functions on the Gaussian integers";
Acta Arithmetica,
135
(2008),
S. 299
- 332.
M. Drmota, G. Gutenbrunner:
"The joint distribution of Q-additive functions on polynomial over finite fields";
Journal de Theorie des Nombres de Bordeaux,
17
(2005),
S. 135
- 159.
M. Drmota, H. Hwang:
"Bimodality and phase transitions in the profile variance of Random binary search trees";
SIAM Journal on Discrete Mathematics,
19
(2005),
1;
S. 19
- 45.
M. Drmota, H. Hwang:
"Profiles of Random trees: Correlation and width of Random recursive trees and binary search trees";
Advances in Applied Probability,
37
(2005),
S. 321
- 341.
M. Drmota, H. Hwang, W. Szpankowski:
"Precise Average Redundancy of an Idealized Arithmetic Coding";
Institute of Electrical and Electronics Engineers,
http://www.computer.org/proceedings/dcc/
(2002).
M. Drmota, A. Iksanov, M. Moehle, U. Roesler:
"A limiting distribution for the number of cuts needed to isolate the root of random recursive tree";
Random Structures and Algorithms,
34
(2009),
3;
S. 305
- 318.
M. Drmota, A. Iksanov, M. Moehle, U. Roesler:
"Asymptotic results concerning the total branch length of the Bolthausen-Sznitman coalescent";
Stochastic Processes and Their Applications,
117
(2007),
S. 1404
- 1421.
M. Drmota, S. Janson, N. Ralph:
"A functional limit theorem for the profile of search trees";
Annals of Applied Probability,
18
(2008),
1;
S. 288
- 333.
M. Drmota, Y. Jin:
"An Asymptotic Analysis of Labeled and Unlabeled k-Trees";
Algorithmica (online),
--
(2015),
online;
27 S.
Zusätzliche Informationen
M. Drmota, Y. Jin, B. Stufler:
"Graph limits of random graphs from a subset of connected sks-trees";
Random Structures and Algorithms,
## online first
(2018).
M. Drmota, M. Kauers, L. Spiegelhofer:
"On a Conjecture of Cusick Concerning the Sum of Digits of $n$ and $n+t$";
SIAM Journal on Discrete Mathematics,
30
(2016),
2;
S. 621
- 649.
Zusätzliche Informationen
M. Drmota, C. Krattenthaler:
"A joint central limit theorem for the sum-of-digits function, and asymptotic divisibility of Catalan-like sequences";
Proceedings of the American Mathematical Society,
147
(2019),
S. 4123
- 4133.
Zusätzliche Informationen
M. Drmota, R. Kutzelnigg:
"A precise analysis of Cuckoo hashing";
ACM Transactions on Algorithms,
8
(2012),
2;
S. 1
- 36.
M. Drmota, G. Larcher, F. Pillichshammer:
"Precise distribution properties of the van der Corput sequence and related sequences";
Manuscripta Mathematica,
118
(2005),
S. 11
- 41.
M. Drmota, A. Llado:
"Almost every tree with m edges decomposes K_2m,2m,";
Combinatorics, Probability and Computing,
23
(2014),
01;
S. 50
- 65.
M. Drmota, G. Louchard, N. Yanev:
"Analysis of a recurrence related to critical nonhomogeneous branching process";
Stochastic Analysis and Applications,
24
(2006),
S. 37
- 59.
M. Drmota, A. Magner, W. Szpankowski:
"Asymmetric Renyi Problem";
Combinatorics, Probability and Computing,
28
(2019),
4, Special Issue (Analysis and Algorithms);
S. 542
- 573.
Zusätzliche Informationen
M. Drmota, J.-F. Marckert:
"Reinforced weak convergence of stochastic processes";
Statistics & Probability Letters,
71
(2005),
S. 283
- 294.
M. Drmota, I. Maria:
"On the discrepancy of some generalized Kakutani's sequences of partitions";
Uniform Distribution Theory,
7
(2012),
S. 75
- 104.
M. Drmota, C. Mauduit:
"Weyl sums over integers with affine digit restrictions";
Journal of Number Theory,
130
(2010),
S. 2404
- 2427.
M. Drmota, C. Mauduit, J. Rivat:
"Normality among Squares";
Journal of the European Mathematical Society,
21
(2019),
2;
S. 507
- 548.
Zusätzliche Informationen
M. Drmota, C. Mauduit, J. Rivat:
"Prime numbers in two bases";
Duke Mathematical Journal,
169
(2020),
10;
S. 1809
- 1876.
Zusätzliche Informationen
M. Drmota, C. Mauduit, J. Rivat:
"Primes with an average sum of digits";
Compositio Mathematica,
145
(2009),
2;
S. 271
- 292.
M. Drmota, C. Mauduit, J. Rivat:
"The sum of digits function of polynomial sequences";
Journal of the London Math. Soc.,
84
(2011),
1;
S. 81
- 102.
M. Drmota, J. Morgenbesser:
"Generalized Thue-Morse sequences of squares";
Israel Journal of Mathematics,
190
(2012),
S. 157
- 193.
M. Drmota, C. Müllner, L. Spiegelhofer:
"Möbius Orthogonality for the Zeckendorf sum-of-digits function";
Proceedings of the American Mathematical Society,
146
(2018),
9;
S. 3679
- 3691.
M. Drmota, R. Nedela:
"Asymptotic enumeration of reversible maps regardless of genus";
Ars Mathematica Contemporanea,
5
(2011),
1;
S. 77
- 79.
M. Drmota, R. Neininger, H. Sulzbach:
"A Gaussian limit process for optimal FIND algorithms";
Electronic Journal of Probability,
19
(2014),
28 S.
M. Drmota, M. Noy, G. Yu:
"Universal singular exponents in catalytic variable equations.";
Journal of Combinatorial Theory Series A,
185
(2021).
Zusätzliche Informationen
M. Drmota, K. Panagiotou:
"A central limit theorem for the number of degree-k vertices in Random maps";
Algorithmica,
66
(2013),
4;
S. 741
- 761.
M. Drmota, D. Panario:
"A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem";
Designs Codes and Cryptography,
26
(2002),
S. 229
- 241.
M. Drmota, H. Prodinger:
"The Height of q-Binary Search Trees";
Discrete Mathematics,
5
(2002),
S. 97
- 108.
M. Drmota, H. Prodinger:
"The register function for t-ary trees";
ACM Transactions on Algorithms,
2
(2006),
3;
S. 318
- 334.
M. Drmota, L. Ramos, C. Requilé, J. Rué:
"Maximal independent sets and maximal matchings in series-parallel and related graph classes";
Electronic Journal of Combinatorics,
27
(2020),
1.
Zusätzliche Informationen
M. Drmota, L. Ramos, J. Rué:
"Subgraph statistics in subcritical graph classes";
Random Structures and Algorithms,
51
(2017),
4;
S. 631
- 673.
Zusätzliche Informationen
M. Drmota, Y. Reznik, W. Szpankowski:
"Tunstall code, Khodak variations, and Random walks";
IEEE Transactions on Information Theory,
56
(2010),
6;
S. 2928
- 2937.
M. Drmota, J. Rivat:
"The sum-of-digits function of squares";
Journal of the London Math. Soc.,
72
(2005),
S. 273
- 292.
M. Drmota, J. Rivat, T. Stoll:
"The sum of digits of primes in Z[i]";
Monatshefte für Mathematik,
155
(2008),
S. 317
- 347.
M. Drmota, W. Schachermayer, J. Teichmann:
"A hyper-geometric approach to the BMV-conjecture";
Monatshefte für Mathematik,
146
(2005),
3;
S. 179
- 201.
M. Drmota, M Scheidl, H. Troger, E. Weinmüller:
"On the Imperfection Sensitivity of Complete Spherical Shells";
Computational Mechanics,
2
(1987),
S. 63
- 74.
M. Drmota, J. Schoißengeier:
"Digital Expansions with Respect to Different Bases";
Monatshefte für Mathematik,
138
(2003),
S. 31
- 59.
M. Drmota, M. Skalba:
"Equidistribution of Divisors and Representations by Binary Quadratic Forms";
International Journal of Number Theory,
9
(2013),
8;
S. 2011
- 2018.
M. Drmota, W. Steiner:
"The Zeckendorf expansion of polynomical sequences";
Journal de Theorie des Nombres de Bordeaux,
14
(2002),
S. 1
- 37.
M. Drmota, T. Stoll:
"Newman´s phenomenon for generalized Thue.Morse sequences";
Discrete Mathematics,
308
(2008),
S. 1191
- 1208.
M. Drmota, B. Stufler:
"Pattern occurrences in random planar maps";
Statistics & Probability Letters,
158
(2020),
108666.
Zusätzliche Informationen
M. Drmota, W. Szpankowski:
"A master theorem for discrete divide and conquer recurrences,";
Journal of the ACM,
60
(2013),
3;
49 S.
M. Drmota, W. Szpankowski:
"Precise minimax redundancy and regret";
IEEE Transactions on Information Theory,
50
(2004),
11;
S. 2686
- 2707.
M. Drmota, W. Szpankowski:
"Redundancy of Lossless Data Compression for Known Sources by Analytic Methods";
Foundations and Trends in Communications and Information Theory,
13
(2017),
4;
S. 277
- 417.
Zusätzliche Informationen
M. Drmota, W. Szpankowski:
"Special issue on analysis of algorithms";
Combinatorics, Probability and Computing,
13
(2004),
4/5;
S. 415
- 417.
M. Drmota, W. Szpankowski:
"The expected profile of digital search trees";
Journal of Combinatorial Theory Series A,
118
(2011),
7;
S. 1939
- 1965.
M. Drmota, J. Verwee:
"Effective Erdos-Wintner Theorems for Digital Expansions";
Journal of Number Theory,
229
(2021),
S. 218
- 260.
P. Gruber, W. Schmidt, G. Helmberg, M. Drmota, R. Winkler, R. Tichy:
"Edmund Hlawka (1916-2009)";
Internationale Mathematische Nachrichten,
211
(2009),
S. 1
- 26.
Buchbeiträge
M. Drmota:
"Subsequences of automatic sequences and uniform distribution";
in: "Uniform Distribution and Quasi-Monte Carlo Methods - Discrepancy, Integration and Applications",
P. V. Kritzer, H. Niederreiter, F. Pillichshammer, A. Winterhof (Hrg.);
herausgegeben von: Radon Series on Computational and Applied Mathematics 15;
Walter de Gruyter,
Berlin, Deutschland,
2014,
ISBN: 978-3-11-031793-0,
S. 87
- 104.
M. Drmota:
"The degree distribution of random planar graphs";
in: "Research Trends in Geographic Information Science",
G. Navratil (Hrg.);
Springer Verlag,
2009,
ISBN: 978-3-540-88243-5,
S. 191
- 200.
M. Drmota, B. Gittenberger:
"Analytic combinatorics on random graphs";
in: "Analysis of Complex Networks",
M. Dehmer, F. Emmert-Streib (Hrg.);
Wiley-VCH,
2009,
ISBN: 978-3-527-32345-6,
S. 425
- 448.
M. Drmota, P. Grabner:
"Analysis of digital functions and applications";
in: "Combinatorics, Automata and Number Theory",
V. Berthé, M. Rigo (Hrg.);
Cambridge University Press,
2010,
ISBN: 978-0-521-51597-9,
S. 452
- 504.
M. Drmota, R. Hofer, G. Larcher:
"On the Discrepancy of Halton-Kronecker Sequences";
in: "Number Theory - Diophantine Problems, Uniform Distribution and Applications",
herausgegeben von: Springer, Cham;
Springer International Publishing,
2017,
ISBN: 978-3-319-55356-6,
S. 219
- 226.
Zusätzliche Informationen
Beiträge in Tagungsbänden
C. Banderier, M. Drmota:
"Coefficients of algebraic functions: formulae and asymptotics";
in: "25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), DMTCS Proc. AS",
Discrete Mathematics and Theoretical Computer Science,
2013,
S. 1065
- 1076.
M. Drmota:
"Concentration properties of extremal parameters in Random discrete structures";
in: "Proceedings of the 4th Colloquium on Mathematics and Computerscience",
Discrete Mathematics and Theoretical Computer Science,
Nancy, France,
2006,
S. 1
- 30.
M. Drmota:
"Embedded trees and the support of the ISE";
in: "20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers (LNCS 5874/2009)",
Springer Verlag,
2009,
ISBN: 978-3-642-10216-5,
S. 194
- 205.
M. Drmota, G. Collet, L. Klausner:
"Vertex Degrees in Planar Maps";
in: "Proceedings of the 27th International Conference on Probalistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms",
R. Neininger, M. Zaionc (Hrg.);
AofA,
Krakow, Polen,
2016.
Zusätzliche Informationen
M. Drmota, M. Fuchs, H. Hwang, R. Neininger:
"External Profile of Symmetric Digital Search Trees";
in: "ANALCO17 Meeting on Analytic Algorithmics and Combinatorics",
herausgegeben von: SIAM;
SIAM - Society for Industrial and Applied Mathematics,
2017,
ISBN: 978-1-61197-477-5,
S. 124
- 130.
Zusätzliche Informationen
M. Drmota, M. Fuchs, Y. Lee:
"Limit Laws for the Number of Groups formed by Social Animals under the Extra Clustering Model";
in: "Proceedings of the 25th. International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms",
M. Bousquet-Melou, M. Soria (Hrg.);
herausgegeben von: CNRS, Université Pierre et Marie Curie - Paris;
DMTCS,
Nancy, Frankreich,
2014,
S. 73
- 84.
M. Drmota, O. Giménez, M. Noy:
"Degree distribution in random planar graphs";
in: "Fifth Colloquium on Mathematics and Computer Science",
Discrete Mathematics and Theoretical Computer Science,
2008,
S. 163
- 178.
M. Drmota, O. Giménez, M. Noy, K. Panagiotou, A. Steger:
"The maximum degree of random planar graphs";
in: "Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA)",
SIAM,
2012,
S. 281
- 287.
M. Drmota, B. Gittenberger, R. Kutzelnigg:
"Combinatorial models for cooperation network";
in: "Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers (LNCS 5874/2009)",
Springer Verlag,
2009,
ISBN: 978-3-642-10216-5,
S. 206
- 217.
M. Drmota, B. Gittenberger, J. Morgenbesser:
"Infinite systems of functional equations and Gaussian limiting distributions";
in: "23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12)",
Discrete Mathematics and Theoretical Computer Science,
2012,
S. 453
- 478.
M. Drmota, B. Gittenberger, A. Panholzer:
"The degree distriution of thickened trees";
in: "Proceedings of the Fifth Colloquium on Mathematics and Computer Science",
Discrete Mathematics and Theoretical Computer Science,
2008,
S. 149
- 162.
M. Drmota, M. Javanian:
"Solutions of First Order Linear Partial Differential Equations Related to Urn Models and Central Limit Theorems";
in: "Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms",
R. Neininger, M. Zaionc (Hrg.);
AofA,
Krakow, Polen,
2016.
Zusätzliche Informationen
M. Drmota, Y. Jin:
"An Asymptotic Analysis of Unlabeled k-Trees";
in: "Proceedings of the 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms",
M. Bousquet-Melou, M. Soria (Hrg.);
herausgegeben von: CNRS, Université Pierre et Marie Curie - Paris;
DMTCS,
Nancy, Frankreich,
2014,
S. 85
- 96.
M. Drmota, A. Llado:
"On a conjecture of Graham and Haeggkvist for random trees";
in: "Proceedings of "The Seventh European Conference on Combinatorics, Graph Theory and Applications"",
herausgegeben von: CRM Series;
Springer Verlag,
2013,
ISBN: 978-88-7642-474-8,
S. 437
- 441.
Zusätzliche Informationen
M. Drmota, A. Magner, W. Szpankowski:
"Asymmetric Renyi Problem and PATRICIA tries";
in: "Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms",
R. Neininger, M. Zaionc (Hrg.);
AofA,
Krakow, Polen,
2016.
Zusätzliche Informationen
M. Drmota, M. Noy:
"Extremal parameters in subcritical graph classes";
in: "Proceedings of ANALCO2013: Meeting on Analytic Algorithms and Combinatorics",
SIAM (Society for Industrial and Applied Mathematics,
2013,
ISBN: 978-1-611972-54-2,
S. 1
- 7.
M. Drmota, M. Noy, B. Stufler:
"Cut vertices in random planar maps";
in: "Proceedings AofA 2020 - LIPIcs",
159;
Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik,
Deutschland,
2020,
S. 10:1
- 10:18.
Zusätzliche Informationen
M. Drmota, K. Panagiotou:
"A central limit theorem for the number of degree-k vertices in Random maps";
in: "Proceedings of ANALCO 2012: Meeting on Analytic Algorithms and Combinatorics",
SIAM,
2012,
9,
S. 15.
M. Drmota, L. Ramos, C. Requilé, J. Rué:
"Maximal Independent Sets and Maximal Matchings in Series-parallel and Related Graph Classes";
in: "Leibniz International Proceedings in Informatics 110 - AofA 2018",
110;
herausgegeben von: Schloss Dagstuhl - Leibniz- Zentrum für Informatik;
STACS 2016 - Leibniz International Proceedings in Informatics (LIPIcs),
2018,
S. 1
- 15.
M. Drmota, Y. Reznik, S. Savari, W. Szpankowski:
"Precise asymptotic analysis of the Tunstall code";
in: "Proceedings of the 2006 IEEE International Symposium on Information Theory",
IEEE,
06,
2006,
4 S.
M. Drmota, W. Szpankowski:
"(Un)Expected behavior of digital search tree profile";
in: "Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms",
SIAM,
2009,
S. 130
- 138.
M. Drmota, W. Szpankowski:
"A master theorem for discrete divide and conquer recurrences";
in: "Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithmsr",
SIAM,
2011,
S. 342
- 361.
M. Drmota, W. Szpankowski:
"Analysis of a block arithmetic coding: discrete divide and conquer recurrences";
in: "Proceeding of 2011 International Symposium on Information Theory",
Elsevier,
2011,
S. 1317
- 1321.
M. Drmota, W. Szpankowski:
"Generalized Shannon Code Minimizes the Maximal Redundancy";
in: "LATIN 2002, LNCS 2286",
S. Rajsbaum (Hrg.);
Springer,
Berlin Heidelberg,
2002,
S. 306
- 318.
M. Drmota, W. Szpankowski:
"On the exit time of a random walk with positive drift";
in: "Prodeedings of AofA 2007",
Discrete Mathematics and Theoretical Computer Science,
2007,
S. 291
- 302.
M. Drmota, W. Szpankowski:
"One-sided Variations on Tries: Path Imbalance, Climbing, and Key Sampling";
in: "2007 Conference on Analysis of Algorithms, AofA 07",
Discrete Mathematics and Theoretical Computer Science,
2007,
S. 303
- 310.
M. Drmota, W. Szpankowski, K. Viswanathan:
"MutualiInformation for a deletion channel";
in: "Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on",
IEEE,
2012,
ISBN: 978-1-4673-2580-6,
S. 2561
- 2565.
M. Drmota, G. Yu:
"The Number of Double Triangles in Random Planar Maps";
in: "Leibniz International Proceedings in Informatics 110 - AofA 2018",
herausgegeben von: Schloss Dagstuhl - Leibniz- Zentrum für Informatik;
STACS 2016 - Leibniz International Proceedings in Informatics (LIPIcs),
Wadern, Deutschland,
2018,
S. 1
- 18.
Y. Jin, M. Drmota:
"Scaling limit of random k-trees";
in: "2016 Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)",
1;
herausgegeben von: SIAM;
Society for Industrial and Applied Mathematics,
2016,
ISBN: 978-1-61197-432-4,
S. 56
- 65.
Zusätzliche Informationen
R. Kutzelnigg, M. Drmota:
"Random bipartite graphs and their application to cuchoo hashing";
in: "Proceedings of the Junior Scientist Conference 2008",
H. Kaiser, R. Kirner (Hrg.);
Technische Universität Wien,
Wien,
2008,
ISBN: 978-3-200-01612-5,
S. 281
- 282.
Vorträge und Posterpräsentationen (mit Tagungsband-Eintrag)
M. Drmota:
"Discrete random walks on one-sided periodic graphs";
Vortrag: Discrete Random Walks 2003,
Paris, Frankreich;
01.09.2003
- 05.09.2003; in: "Discrete Mathematics and Theoretical Computer Science Proceedings (Random Walks)",
(2003),
S. 83
- 94.
Vorträge und Posterpräsentationen (ohne Tagungsband-Eintrag)
M. Drmota:
"(Logarithmic) Densities for Automatic Sequences along Primes and Squares";
Vortrag: Diophantine Problems, Determinism and Randomness,
Frankreich;
23.11.2020
- 27.11.2020.
M. Drmota:
"(Logarithmic) Densities for Automatic Sequences along Primes and Squares";
Vortrag: AG Diskrete Mathematik,
Technische Universität Wien;
16.03.2021.
M. Drmota:
"(Logarithmic) Densities for Automatic Sequences along Primes and Squares";
Vortrag: One World Numeration Seminar,
ONLINE international (eingeladen);
30.03.2021.
M. Drmota:
"(Maximal) Independent Sets in Various Random Graph Classes";
Vortrag: SFB F50 Meeting 2021 (Spezialforschungsbereich, initiiert vom FWF findet mehrmals jährlich statt),
Johannes Kepler Universität Linz (eingeladen);
09.08.2021
- 10.08.2021.
M. Drmota:
"(Maximal) Independent Sets in Various Random Graph Classes";
Vortrag: Seminar,
UPC Barcelona (eingeladen);
15.09.2021.
M. Drmota:
"(Un) Expected behaviour of digital search tree profile";
Vortrag: ACM-SIAM Symposium on Discrete Algorithms (SODA09),
New York, USA;
04.01.2009
- 06.01.2009.
M. Drmota:
"(Un) Expected behaviour of digital search tree profile";
Vortrag: 20th International Conference on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms, A0fA 09,
Frejus, France (eingeladen);
14.06.2009
- 19.06.2009.
M. Drmota:
"A central limit theorem for the number of degree-k vertices in Random maps";
Vortrag: Arbeitsgemeinschaft Diskrete Mathematik,
TU Wien, Austria;
10.01.2012.
M. Drmota:
"An asymptotic analysis of Cuckoo hashing";
Vortrag: Universität Bordeaux 1, LFANT-Seminar,
Borrdeaux, France (eingeladen);
24.09.2010.
M. Drmota:
"Analytic Combinatorics for Random Graphs";
Vortrag: ANALCO 2014, Meeting on Analytic Algorithmics and Combinatorics,
Portland, USA (eingeladen);
05.01.2014
- 07.01.2014.
M. Drmota:
"Applications of number theoretic methods in coding theory";
Vortrag: General Theory of Information Transfer and Combinatorics,
Bielefeld, BRD (eingeladen);
26.04.2004
- 30.04.2004.
M. Drmota:
"Asymptotic methods of enumeration and applications to Markov chain models I + II";
Vortrag: EURANDOM,
Eindhoven, Netherlands (eingeladen);
17.10.2007.
M. Drmota:
"Asymptotics on random discrete object 1 -3";
Vortrag: 62ème Séminaire Lotharingien de Combinatoire, SLC 62,
Heilsbronn, Germany (eingeladen);
23.02.2009
- 25.02.2009.
M. Drmota:
"Block additive functions on Gaussian integers";
Vortrag: Journées de Numeration,
Graz, Austria;
18.04.2007.
M. Drmota:
"Coefficients of positive algebraic functions";
Vortrag: 24th International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms AofA 2013,
Cala Galdana, Menorca (eingeladen);
27.05.2013
- 31.05.2013.
M. Drmota:
"Combinatorics and asymptotics on trees 1";
Vortrag: University of the Witwatersrand,
Johannesburg, Südafrika (eingeladen);
01.11.2004
- 12.11.2004.
M. Drmota:
"Combinatorics and asymptotics on trees 2";
Vortrag: University of the Witwatersrand,
Johannesburg, Südarfrika (eingeladen);
01.11.2004
- 12.11.2004.
M. Drmota:
"Combinatorics and asymptotics on trees 3";
Vortrag: University of the Witwatersrand,
Johannesburg, Südafrika (eingeladen);
01.11.2004
- 12.11.2004.
M. Drmota:
"Combinatorics and asymptotics on trees 4";
Vortrag: University of the Witwatersrand,
Johannesburg, Südafrika (eingeladen);
01.11.2004
- 12.11.2004.
M. Drmota:
"Combinatorics and shape characteristics of planar (and related) graph classes";
Vortrag: Symposium Diskrete Mathematik 2014,
Frankfurt am Main, Germany (eingeladen);
09.05.2014
- 10.05.2014.
M. Drmota:
"Concentration properties of extremal parameters in random discrete structure";
Vortrag: 4th Colloquium on Mathematics and Computer Science,
Nancy, France (eingeladen);
18.09.2006
- 22.09.2006.
M. Drmota:
"Concentration properties of extremal parameters in Random trees";
Vortrag: Educational Workshop on Discrete Probability,
Wien, Austria (eingeladen);
13.03.2006.
M. Drmota:
"Concentration properties of the height and fill-up-level of digital search trees";
Vortrag: Seminarvortrag,
TU Graz;
11.10.2019.
M. Drmota:
"Concentration properties of the height and fill-up-level of digital search trees";
Vortrag: AofA 2019,
Marseille (eingeladen);
24.06.2019
- 28.06.2019.
M. Drmota:
"Connections between number theory and Aariable-to-variable coding";
Vortrag: Purdue University, Indiana, USA,
Indiana, USA (eingeladen);
16.02.2004.
M. Drmota:
"Cuckoo hashing revisited";
Vortrag: 12th Seminar on the Analysis of Algorithms,
Alden Biesen, Belgium;
02.07.2006
- 08.07.2006.
M. Drmota:
"Cuckoo hashing revisited";
Vortrag: Universitat Politècnica de Catalunya,
Barcelona, Spain (eingeladen);
21.02.2007.
M. Drmota:
"Cut Vertices in Random Planar Maps";
Vortrag: AG Diskrete Mathematik,
Technische Universität Wien;
11.10.2019.
M. Drmota:
"Die Höhe von rekursiven Bäumen";
Vortrag: Kolloquium aus Diskreter Mathematik, Technische Univ. Graz,
Graz, Austria (eingeladen);
02.12.2005.
M. Drmota:
"Die Lösung von 2 Vermutungen über Zufallsbäume";
Vortrag: Math. Kolloquium, Univ. Wien,
Wien;
02.04.2003.
M. Drmota:
"Die Magie der Zahl pi";
Vortrag: TUforMath,
Wien (eingeladen);
22.10.2020.
M. Drmota:
"Die Mathematik von Quicksort und verwandte Fragestellungen";
Vortrag: Berufungsvortrag,
TU Wien, Austria (eingeladen);
02.06.2006.
M. Drmota:
"Die Mathematik von Quicksort und verwandte Fragestellungen";
Vortrag: Zahlentheoretisches Kolloquium,
TU Graz, Austria (eingeladen);
06.10.2006.
M. Drmota:
"Die Verteilung der Höhe von binären Suchbäumen und verwandte Fragestellungen";
Vortrag: Universität Kiel,
Kiel, BRD;
17.01.2003.
M. Drmota:
"Digital Expansions and Uniform Distribution";
Vortrag: Festkolloquium aus Anlass des 60. Geburtstags von Prof.Dr. Robert Tichy,
Graz (eingeladen);
19.10.2017
- 20.10.2017.
M. Drmota:
"Digital Expansions and uniformly distributed sequences Modulo 1";
Vortrag: Discrepancy Theory and Applications,
Oberwolfach, Germany (eingeladen);
07.03.2004
- 13.03.2004.
M. Drmota:
"Digital expansions with respect to different bases";
Vortrag: Colloquium on the occasion of the 60th birthday of Univ.Prof.Dr. Gerhard Larcher,
Linz (eingeladen);
12.02.2020.
M. Drmota:
"Digital expansions, prime numbers, and uniform distribution modulo 1";
Vortrag: Technische Universität Graz,
Graz, Austria (eingeladen);
19.10.2007.
M. Drmota:
"Digital expansions, prime numbers, and uniform distribution modulo 1";
Vortrag: International Conference on Uniform Distribution Theory,
Marseille, France (eingeladen);
21.01.2008
- 25.01.2008.
M. Drmota:
"Distribution Properties of Subsequences of Automatic Sequences";
Vortrag: Numeration 2015,
Vandoeuvre-lès-Nancy (eingeladen);
18.05.2015
- 22.05.2015.
M. Drmota:
"Distribution Properties of Subsequences of Automatic Sequences";
Vortrag: 2nd Workshop on Combinatorics, Number Theory and Dynamics, IMPA,
Rio de Janeiro (eingeladen);
24.08.2015
- 28.08.2015.
M. Drmota:
"Distribution Properties of Subsequences of Automatic Sequences";
Vortrag: Number Theory and Applications,
Sousse (eingeladen);
14.10.2017
- 18.10.2017.
M. Drmota:
"Embedded trees and the support of the ISE";
Vortrag: 20th International Workshop on Combinatorial Algorithms (IWOCA) 2009,
Hradec nad Moravicí, Czech Republic;
29.06.2009
- 02.07.2009.
M. Drmota:
"Extremal parameters in critical and subcritical graph classes";
Vortrag: 23rd International Meeting on Probablilistic Combinatorial, and Asymptotiv Methods in the Analysis of Algorithms, AofA2012,
Montreal, Canada (eingeladen);
18.06.2012
- 22.06.2012.
M. Drmota:
"Extremal parameters in critical and subcritical graph classes";
Vortrag: Université Paris XIII,
Paris, France (eingeladen);
18.09.2012.
M. Drmota:
"Extremal parameters in critical and subcritical graph classes";
Vortrag: Arbeitsgemeinschaft Diskrete Mathematik,
TU Wien, Austria;
20.11.2012.
M. Drmota:
"Extremal parameters in sub-critical graph classes,";
Vortrag: ANALCO 2013 Meeting on Analytic Algorithmics and Combinatorics,
New Orleans, USA;
06.01.2013.
M. Drmota:
"Gelfond problems on the sum-of-digits function and subsequences of automatic sequences";
Vortrag: Erdős Centennial 2013,
Budapest, Hungary (eingeladen);
01.07.2013
- 05.07.2013.
M. Drmota:
"Gelfond Problems on the sum-of-digits function and subsequences of automatic sequences";
Vortrag: Heilbronn Workshop on Advances in Number Theory and Dynamical Systems,
Bristol, UK (eingeladen);
08.04.2013
- 12.04.2013.
M. Drmota:
"Generalized Thue-Morse sequences of squares and uniform distribution in compact groups";
Vortrag: Workshop on Dynamical Systems and Uniform Distribution,
TU Graz, Austria (eingeladen);
28.01.2010
- 29.01.2010.
M. Drmota:
"Generating functions and central limit theorem";
Vortrag: Freie Universität Berlin,
Berlin, Germany (eingeladen);
10.06.2008.
M. Drmota:
"Increasing tree families complex networks and random graphs";
Vortrag: Physikzentrum Bad Honnef,
Bad Honnef, Germany (eingeladen);
11.07.2005
- 13.07.2005.
M. Drmota:
"Large random planar graphs";
Vortrag: CEA-Centre de Saclay,
Paris, France (eingeladen);
10.06.2008.
M. Drmota:
"Limiting Distributions in Combinatorics";
Vortrag: 2008 International Conference on the Analysis of Algorithms (AofA2008),
Maresias, Brazil;
12.04.2008
- 18.04.2008.
M. Drmota:
"Limiting distributions in combinatorics";
Vortrag: Universitat Politècnica de Catalunya,
Barcelona, Spain (eingeladen);
25.03.2008.
M. Drmota:
"Local results on the sum-of-digits function of primes and squares";
Vortrag: Laboratoire d'Informatique Algorithmique: Fondements et Applications,
Paris, France (eingeladen);
06.06.2008.
M. Drmota:
"Mathematik heute";
Vortrag: ProScientia meeting,
Wien (eingeladen);
03.05.2018.
M. Drmota:
"Normal Subsequences of Automatic Sequences";
Vortrag: Ergodic Theory and its Connections with Arithmetic and Combinatorics,
Luminy, Marseille, Frankreich (eingeladen);
12.12.2016
- 16.12.2016.
M. Drmota:
"On the exit time of a random walk with positive drift";
Vortrag: AofA07 Conference on Analysis of Algorithms,
Juan les Pins, France;
21.06.2007.
M. Drmota:
"Optimal and almost optimal variable-to-fixed length codes: renewal theory and divide-and-conquer recurrences";
Vortrag: STC-Seminar, Purdue University,,
Indiana, USA (eingeladen);
23.02.2011.
M. Drmota:
"Pattern Occurrences in Random Planar Maps";
Vortrag: Workshop "Large Networks and Random Graphs",
Goethe Universität, Frankfurt, Deutschland (eingeladen);
09.07.2018
- 13.07.2018.
M. Drmota:
"Patterns in random trees";
Vortrag: Colloquium for Philippe Flajolet´s 60th Birthday,,
ENS, Paris, France (eingeladen);
01.12.2008
- 02.12.2008.
M. Drmota:
"Positive catalytic and non-catalytic polynomial systems of equations";
Vortrag: BIRS,
Ban (eingeladen);
18.09.2017
- 22.09.2017.
M. Drmota:
"Positive Systems of Polynominal Equations";
Vortrag: OPSFA 2019,
Hagenberg (eingeladen);
22.07.2019
- 26.07.2019.
M. Drmota:
"Primes as Sums of Fibonacci Numbers";
Vortrag: AG Diskrete Mathematik,
Technische Universität Wien (eingeladen);
12.10.2021.
M. Drmota:
"Primzahlen und automatische Folgen";
Vortrag: ÖMG - Lehrer/innen/fortbildungstagung,
Universität Wien (eingeladen);
21.04.2017.
M. Drmota:
"Primzahlen und automatische Folgen";
Vortrag: Konferenz deutschsprachiger Mathematikfachschaften,
TU Wien (eingeladen);
02.11.2017.
M. Drmota:
"Probabilistische Kombinatorik";
Vortrag: Wissenswertes aus der Mathematik, TU Wien,
Wien, Austria (eingeladen);
26.03.2007.
M. Drmota:
"Problems and Results on the Sum-of-Digits Functions";
Vortrag: Universite de Marseille,
Luminy, Frankreich;
09.09.2003.
M. Drmota:
"Profile of Random Trees";
Vortrag: Conference in honour of Svante Janson´s 60th birthday,
Krusenberg Mansion, Schweden (eingeladen);
01.06.2015
- 05.06.2015.
M. Drmota:
"Project "Analytic and Probabilistic Methods in Combinatorics";
Vortrag: Analytic Combinatorics and Probabilistic Number Theory: Closing Conference of the FWF-Network,
TU Wien, Austira;
02.06.2012
- 06.06.2012.
M. Drmota:
"Quasi-Random properties of the Thue-Morse sequence and related problems";
Vortrag: Monday Lecture - Methods for Discrete Structures,
Berlin, Germany (eingeladen);
17.11.2014.
M. Drmota:
"Quasi-Random properties of the Thue-Morse sequence and related problems";
Vortrag: MuDeRa Workshop,
Nancy (eingeladen);
27.02.2015.
M. Drmota:
"Queueing theory without limits: transient and asymptotic analysis";
Vortrag: EURANDOM,
Eindhoven, Netherlands (eingeladen);
18.10.2007.
M. Drmota:
"Random planar graphs";
Vortrag: Theoretical Computer Science - from Foundation to Application,
Nis, Serbia;
07.11.2009
- 11.11.2009.
M. Drmota:
"Random planar graphs";
Vortrag: Coimbra Meeting on 0-1 Matrix Theory and Related Topics,
Coimbra, Portugal (eingeladen);
16.06.2010
- 19.06.2010.
M. Drmota:
"Random planar graphs: combinatorics and asymptotics";
Vortrag: Kolloquium des Mathematischen Instituts der Universität Tübingen,
Universität Tübingen, Germany (eingeladen);
31.05.2010.
M. Drmota:
"Random Sub-Critical Graph Classes";
Vortrag: DMV Jahrestagung der Deutschen Mathematiker-Vereinigung 2015, Minisymposium "Random Discrete Structures and Processes",
Hamburg, Deutschland (eingeladen);
21.09.2015
- 25.09.2015.
M. Drmota:
"Random trees and stochastic processes of analytic functions";
Vortrag: Centre de Recerca Matematica,
Barcelona, Spain (eingeladen);
14.02.2007.
M. Drmota:
"Recursive Trees (3 Vorträge)";
Vortrag: Enrage Topical School on Growth and Shapes,
Paris, France (eingeladen);
02.06.2008
- 06.06.2008.
M. Drmota:
"Relations to number theory in Philippe Flajolet´s work";
Vortrag: Conference in the memory of Philippe Flajolet,
Paris, France (eingeladen);
14.12.2011
- 16.12.2011.
M. Drmota:
"Shape characteristics of critical and sub-critical graph classes";
Vortrag: Combinatorial Probability and Statistical Mechanics Workshop,
London (eingeladen);
21.02.2013
- 23.02.2013.
M. Drmota:
"Sigularities for systems of functional equations";
Vortrag: Institut Henri Poincare (ihp),
Paris, France (eingeladen);
03.05.2010.
M. Drmota:
"Solution of Kesten's Conjecture on the Height of Digital Search Trees";
Vortrag: 9th Seminar on Analysis of Algorithms,
San Miniato, Italien;
23.06.2003
- 27.06.2003.
M. Drmota:
"Special Automatic Sequences and the Sarnak Conjecture";
Vortrag: Ergodic Theory and Dynamical Systems,
Bedlewo, Polen (eingeladen);
23.11.2015
- 27.11.2015.
M. Drmota:
"Statistical properties of number systems";
Vortrag: RICAM, Linz,
Linz, Österreich (eingeladen);
06.05.2004.
M. Drmota:
"Stohastic Analysis of Tree-Like Data Structures";
Vortrag: Second Colloquium on Mathematics and Computer Science,
Versailles, France;
16.09.2002
- 19.09.2002.
M. Drmota:
"Stohastic Analysis of Tree-Like Data Structures";
Vortrag: NancyProb@2002,
Nancy, Frankreich;
18.11.2002
- 20.11.2002.
M. Drmota:
"Subgraph Counting in Serial-Parallel Graphs and Innite Dimensional Systems of Functional Equations";
Vortrag: Workshop in Analytic and Probalistic Combinatorics,
Banff, Kanada (eingeladen);
23.10.2016
- 28.10.2016.
M. Drmota:
"Subgraph Counting in Series-Parallel Graphs and Infinite Dimensional Systems of Functional Equations";
Vortrag: Workshop on Analytic and Enumerative Aspects of Combinatorics,
Hsinchu, Taiwan (eingeladen);
27.10.2017
- 29.10.2017.
M. Drmota:
"Subgraph Counting in Series-Parallel Graphs and Innite Dimensional Systems of Functional Equations";
Vortrag: Probabilistic and Extremal Combinatorics Downunder,
Melbourne, Australien (eingeladen);
13.06.2016
- 17.06.2016.
M. Drmota:
"Subgraph Statistics in Series-Parallel Graphs and Related Graph Structure";
Vortrag: CSGT 2021 The 56th Czech and Slovak Conference on Graph Theory,
Rajecke Teplice, Slowakei (eingeladen);
27.08.2021.
M. Drmota:
"Subgraph Statistics in Subcritical Graph Classes";
Vortrag: SFB-Colloquium,
Linz;
29.01.2016.
M. Drmota:
"Subsequences and independence of generalized Halton sequences";
Vortrag: Workshop "Approximation and numeration",
Paris, France (eingeladen);
18.12.2013
- 20.12.2013.
M. Drmota:
"Subsequences of Automatic Sequences";
Vortrag: International Conference in Number Theory,
Kerala School of Mathematics, Indien (eingeladen);
09.01.2017
- 13.01.2017.
M. Drmota:
"Subsequences of automatic sequences and uniform distribution";
Vortrag: Workshop "Uniform Distribution and quasi-Monte-Carlo methods,
Linz, Austria (eingeladen);
14.10.2013
- 18.10.2013.
M. Drmota:
"Subsequences of Automatic Sequences and Uniform Distribution";
Vortrag: 4th International Conference on Uniform Distribution Theory,
Ostravice, Czech Republic (eingeladen);
30.06.2014
- 04.07.2014.
M. Drmota:
"The binary search trees equation";
Vortrag: Workshop on Branching Random Walks and Searching in Trees,
Banff, Canada (eingeladen);
01.02.2010
- 05.02.2010.
M. Drmota:
"The degree distribution of random planar graphs";
Vortrag: Scientific Colloquium - 60th birthday of Andrew Frank,
TU Wien, Austria (eingeladen);
30.06.2008
- 01.07.2008.
M. Drmota:
"The degree distribution of random planar graphs";
Vortrag: One-Day Meeting in Combinatorics,
Oxford, GB (eingeladen);
18.03.2009.
M. Drmota:
"The degree distribution of random planar graphs";
Vortrag: 24th LL-Seminar on Graph Theory,
Leoben, Austria (eingeladen);
24.04.2009
- 25.04.2009.
M. Drmota:
"The degree distribution of random planar graphs 1";
Vortrag: Workshop: Analytic enumeration methods in combinatorics, probability and number theory,
TU Graz, Austria (eingeladen);
27.05.2010
- 28.05.2010.
M. Drmota:
"The degree distribution of random planar graphs 2";
Vortrag: Workshop: Analytic enumeration methods in combinatorics, probability and number theory,
TU Graz, Austria (eingeladen);
27.05.2010
- 28.05.2010.
M. Drmota:
"The discrepancy of generalized Halton sequences";
Vortrag: Festkolloquium zum Anlass des 50. Geburtstags von Herrn Univ.Prof.Dr. Peter Grabner,
Technische Universität Graz (eingeladen);
13.05.2016.
M. Drmota:
"The Height of Digital Search Trees";
Vortrag: ÖMG Tagung,
Bozen, Italien;
22.09.2003
- 26.09.2003.
M. Drmota:
"The height of increasing trees";
Vortrag: Universität Frankfurt, BRD,
Frankfurt BRD (eingeladen);
26.08.2004.
M. Drmota:
"The height of increasing trees";
Vortrag: German Open Conference on Probability,
Frankfurt, Germany;
13.03.2006
- 17.03.2006.
M. Drmota:
"The height of random binary search trees and related questions";
Vortrag: International Statistical Symposium and Bernoulli Society EAPR Conference,
Taipei, Taiwan;
07.07.2002
- 10.07.2002.
M. Drmota:
"The joint distribution of $Q$-additive functions on polynomials over finite fields";
Vortrag: XXIIIrd Journees Arithmetiques,
Graz;
06.07.2003
- 12.07.2003.
M. Drmota:
"The joint distribution of digital expansions with respect to different bases";
Vortrag: Universität Nancy,
Nancy, Frankreich;
21.11.2002.
M. Drmota:
"The maximum degree of random planar graphs";
Vortrag: Arbeitsgemeinschaft Diskrete Mathematik,
TU Wien, Austria;
17.04.2012.
M. Drmota:
"The maximum degree of random planar graphs";
Vortrag: Alfred Renyi Institute of Mathematics, Hungarian Academy of Sciences,
Budapest, Hungary (eingeladen);
12.11.2012.
M. Drmota:
"The maximum degree of random planar graphs";
Vortrag: University of Ljubljana,
Ljubljana, Slovenia (eingeladen);
13.12.2012.
M. Drmota:
"The maximum degree of series-paralell graphs";
Vortrag: Workshop on Random Maps and Graphs on surfaces,
Paris, France (eingeladen);
02.11.2009
- 06.11.2009.
M. Drmota:
"The probabilistic method, random graphs and Stein´s method I";
Vortrag: Summer School Probabilistic Methods in Combinatorics,
Maria Trost, Austria (eingeladen);
16.07.2006
- 20.07.2006.
M. Drmota:
"The probabilistic method, random graphs and Stein´s method II";
Vortrag: Summer School Probabilistic Methods in Combinatorics,
Maria Trost, Austria (eingeladen);
16.07.2006
- 20.07.2006.
M. Drmota:
"The probabilistic method, random graphs and Stein´s method III";
Vortrag: Summer School Probabilistic Methods in Combinatorics,
Maria Trost, Austria (eingeladen);
16.07.2006
- 20.07.2006.
M. Drmota:
"The probabilistic method, random graphs and Stein´s method IV";
Vortrag: Summer School Probabilistic Methods in Combinatorics,
Maria Trost, Austria (eingeladen);
16.07.2006
- 20.07.2006.
M. Drmota:
"The Profile and height of log n-trees";
Vortrag: 10th Seminar on Analysis of Algorithms,
MSRI, Berkeley, USA (eingeladen);
14.06.2004
- 18.06.2004.
M. Drmota:
"The Random Bisection Problem and the Distribution of the Height of Binary Search Trees";
Vortrag: Eight Seminar on Analysis of Algorithm, Strobl,
Strobl, Österreich;
26.06.2002.
M. Drmota:
"The shape of random trees";
Vortrag: Steklov Institut,
Moskau, Russia (eingeladen);
12.09.2005.
M. Drmota:
"The sum of digits of primes";
Vortrag: Seminari COMBGRAF,
Barcelona, Spain (eingeladen);
21.05.2009.
M. Drmota:
"The sum of digits of primes";
Vortrag: Séminar de Théorie des Nombres, Université Bordeaux,
Bordeaux (eingeladen);
24.09.2010.
M. Drmota:
"The sum-of-digits function of Gaussian integers";
Vortrag: Universite de Marseille,
Luminy, France (eingeladen);
23.05.2006.
M. Drmota:
"The Sum-of-Digits Function of Squares";
Vortrag: Theory of Numbers and Probability, CIRM,
Marseilles Luminy, Frankreich;
17.11.2003
- 21.11.2003.
M. Drmota:
"The Sum-of-digits-Function, Primes and Uniform Distribution Modulo 1";
Vortrag: International Conference on Uniform Distribution Theory,
Marseille, France (eingeladen);
01.10.2018
- 05.10.2018.
M. Drmota:
"The Sum-of-digits-Function, Primes and Uniform Distribution Modulo 1";
Vortrag: Journée Charles Hermite, Institut Élie Cartan de Lorraine,
Université de Lorraine, Nancy, Frankreich (eingeladen);
14.12.2018.
M. Drmota:
"The Thue-Morse sequence along squares is normal";
Vortrag: Arbeitsgemeinschaft Ergodentheorie,
Wien, Austria (eingeladen);
27.11.2014.
M. Drmota:
"The Thue-morse sequence along the squares in normal";
Vortrag: 18th ÖMG Congress and Annual DMV Meeting,
Innsbruck;
23.09.2013
- 27.09.2013.
M. Drmota:
"The Thue-Morse Sequence along the squares is normal";
Vortrag: Arbeitsgemeinschaft Diskrete Mathematik,
TU Wien, Wien;
12.11.2013.
M. Drmota:
"The width of binary search trees";
Vortrag: Purdue University, Indiana, USA,
Indiana, USA (eingeladen);
21.02.2005.
M. Drmota:
"Travelling waves and the distribution of the height of binary search trees";
Vortrag: 16.Int.Kongress ÖMG-DMV, Klagenfurt,
Klagenfurt, Austria;
18.09.2005
- 23.09.2005.
M. Drmota:
"Trees, Random Mappings and k-Trees";
Vortrag: Journee en l´honneur de Michele Soria,
Paris (eingeladen);
12.05.2017.
M. Drmota:
"Universal Asymptotics for Positive Catalytic Equations";
Vortrag: Seminar,
Université Paris Nord, Franzkreich (eingeladen);
26.10.2021.
M. Drmota:
"Universal Asymptotics for Positive Catalytic Functional Equations";
Hauptvortrag: AofA 2017,
Princeton (eingeladen);
19.06.2017
- 23.06.2017.
M. Drmota:
"Universal exponents and tail estimates in the enumeration of planar maps";
Vortrag: AofA 2011 22th International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms,
Bedlewo, Poland;
12.06.2011
- 18.06.2011.
M. Drmota:
"Universal exponents and tail estimates in the enumeration of planar maps";
Vortrag: ÖMG-Tagung-CSASC 2011,
Krems;
25.09.2011
- 28.09.2011.
M. Drmota:
"Universal exponents and tail estimates in the enumeration of planar maps";
Vortrag: European Conference on Combinatorics, Graph Theory and Applications, EuroComb'11,
Budapest, Hungary;
29.08.2011
- 02.09.2011.
M. Drmota:
"Universal singular exponents in catalytic variable equations.";
Vortrag: Eurocomb Barcelona 2021,
Barcelona, online (eingeladen);
06.09.2021
- 10.09.2021.
M. Drmota:
"Vertex Degrees in Planar Maps";
Vortrag: AG Diskrete Mathematik,
Technische Universität Wien;
18.10.2016.
M. Drmota:
"Vertex Degrees in Planar Maps";
Vortrag: Colloquium am Department of Applied Mathematics, National Chiao Tung University,
Hsinchu, Taiwan (eingeladen);
22.11.2016.
M. Drmota:
"Vertex Degrees in Planar Maps, Random Trees and Maps: Probalistic and Combinatorical Aspects";
Vortrag: CIRM Luminy,
Marseille, Frankreich (eingeladen);
06.06.2016
- 10.06.2016.
M. Drmota:
"Zufallsbäume und stochastische Prozesse analytischer Funktionen";
Vortrag: Math. Kolloquium, Univ. Wien,
Wien, Austria (eingeladen);
17.01.2007.
M. Drmota, P. Grabner:
"Block additive functions on Gaussian integers";
Vortrag: Slovak-Austrian Mathematical Congress 2007,
Podbanske, Slovakia;
16.09.2007
- 21.09.2007.
M. Drmota, M. Javanian:
"Solution of first order linear partial differential equations and central limit theorems";
Vortrag: AofA 2016 - 27th. International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis,
Kraków, Polen;
04.07.2016
- 08.07.2016.
M. Drmota, A. Magner, W. Szpankowski:
"Asymmetric Renyi Problem and PATRICIA Tries";
Vortrag: AofA 2016 - 27th. International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis,
Kraków, Polen;
04.07.2016
- 08.07.2016.
M. Drmota, C. Mauduit, J. Rivat:
"The sum of digits of primes";
Vortrag: 17th ÖMG Congress / Annual DMV Conference,
Graz;
21.09.2009
- 25.09.2009.
M. Drmota, C. Müllner, L. Spiegelhofer:
"Möbius Orthogonality for the Zeckendorf Sum-of-Digits Function";
Vortrag: Number Theory and Applications,
Sousse (eingeladen);
10/2017.
M. Drmota, M. Noy, B. Stufler:
"Cut vertices in random planar maps";
Vortrag: Probability and Combinatorics Seminar,
Uppsala;
10.12.2020.
M. Drmota, M. Noy, B. Stufler:
"Cut vertices in random planar maps";
Vortrag: AG Diskrete Mathematik Seminar,
Wien;
03.11.2020.
M. Drmota, K. Panagiotou:
"A central limit theorem for the number of degree-k vertices in Random maps";
Vortrag: ANALCO12, Meeting on Analytic Algorithmics and Combinatorics,
Kyoto, Japan;
16.01.2012.
M. Drmota, L. Ramos, J. Rué:
"Subgraph counting in series-parallel graphs and infinite dimensional systems of functional equations";
Vortrag: Knuth 80: Scientific Symposium on Algorithms, Combinatorics and Informatics,
Pitea, Schweden (eingeladen);
08.01.2018
- 10.01.2018.
M. Drmota, L. Spiegelhofer, C. Müllner:
"Möbius Orthogonality for the Zeckendorf Sum-of-Digits Function";
Vortrag: Prime Numbers and Automatic Sequences: Determinism and Randomness,
Marseille (eingeladen);
05/2017.
C. Requilé, M. Drmota, M. Noy, J. Rué Perna:
"A Census of Planar Maps and Graphs";
Vortrag: Discrete Mathematics Workshop,
Stellenbosch University, South Africa (eingeladen);
12.12.2018.
Dissertationen (eigene und begutachtete)
M. Mansouri:
"Combinatorial properties of phylogenetic networks";
Betreuer/in(nen), Begutachter/in(nen): B. Gittenberger, M. Drmota, H. Hwang;
Institut für Diskrete Mathematik und Geometrie,
2020;
Rigorosum: 09.06.2020.
Zusätzliche Informationen
C. Müllner:
"Exponential Sum Estimates and Fourier Analytic Methods for Digitally Based Dynamical Systems";
Betreuer/in(nen), Begutachter/in(nen): M. Drmota, J. Rivat;
Institut für Diskrete Mathematik und Geometrie,
2017.
W. Steiner:
"The Distribution of Digital Expansions on Polynomial Sequences";
Betreuer/in(nen), Begutachter/in(nen): M. Drmota, R. Winkler;
Institut für Geometrie,
2002.
J. Verwee:
"Effective Erdös-Wintner Theorems";
Betreuer/in(nen), Begutachter/in(nen): M. Drmota, G. Tenenbaum;
Institut für Diskrete Mathematik und Geometrie,
2020;
Rigorosum: 11/2020.
Zusätzliche Informationen
J. Verwee:
"Théorèmes d´Erdös-Wintner effectifs";
Betreuer/in(nen), Begutachter/in(nen): M. Drmota, G. Tenenbaum, P. Grabner, B. Martin;
Institut für Diskrete Mathematik und Geometrie,
2020;
Rigorosum: 20.11.2020.
Zusätzliche Informationen
M. Wallner:
"Combinatorics of Lattice Paths and Tree-like Objects";
Betreuer/in(nen), Begutachter/in(nen): B. Gittenberger, M. Drmota;
Institut für Diskrete Mathematik und Geometrie,
2017.
Zusätzliche Informationen
G. Yu:
"Pattern Occurrences in Random Planar Maps and Catalytic Functional Equations";
Betreuer/in(nen), Begutachter/in(nen): M. Drmota, M. Kang;
Institut für Diskrete Mathematik und Geometrie, E104,
2019;
Rigorosum: 19.06.2019.
Diplom- und Master-Arbeiten (eigene und betreute)
C. Aistleitner:
"Normale Zahlen";
Betreuer/in(nen): M. Drmota;
Institut für Diskrete Mathematik und Geometrie,
2006;
Abschlussprüfung: 2006.
A. Freiberger:
"Das Klassenzahlproblem";
Betreuer/in(nen): M. Drmota;
Institut für Diskrete Mathematik und Geometrie,
2005.
M. Köck:
"Abstände zwischen Primzahlen";
Betreuer/in(nen): M. Drmota;
Institut für Diskrete Mathematik und Geometrie,
2016.
R. Kutzelnigg:
"Analyse von Hash-Algorithmen";
Betreuer/in(nen): M. Drmota;
Institut für Diskrete Mathematik und Geometrie,
2005.
C. Lanz:
"k-Automatic Reals";
Betreuer/in(nen): M. Drmota;
Institut für Diskrete Mathematik und Geometrie,
2006;
Abschlussprüfung: 2006.
N. Meyer:
"Kombinatorik ebener Karten";
Betreuer/in(nen): M. Drmota;
Institut für Diskrete Mathematik und Geometrie,
2017;
Abschlussprüfung: 29.09.2017.
A. Nessmann:
"Elliptische Kurven über Endlichen Körpern";
Betreuer/in(nen): M. Drmota;
Institut für Diskrete Mathematik und Geometrie,
2017.
A. Nessmann:
"Lattice Walks in the Quarter Plane";
Betreuer/in(nen): M. Drmota;
Institut für Diskrete Mathematik und Geometrie,
2020;
Abschlussprüfung: 08/2020.
Zusätzliche Informationen
L. Papadogiannis:
"Class Field Theory - Artin Reciprocity Law";
Betreuer/in(nen): M. Drmota;
Institut für Diskrete Mathematik und Geometrie,
2020;
Abschlussprüfung: 11/2020.
Zusätzliche Informationen
F. J. Preyser:
"An Approach to Develop a User Friendly Way of Implementing DEV&DESS Models in PowerDEVS";
Betreuer/in(nen): F. Breitenecker, M. Drmota;
Institut für Analysis und Scientific Computing,
2015;
Abschlussprüfung: 15.06.2015.
Zusätzliche Informationen
