Wissenschaftliche Artikel

Drmota, M., Noy, M., & Stufler, B. (2023). Cut Vertices in Random Planar Maps. Electronic Journal of Combinatorics, 30(3), Article P3.32. https://doi.org/10.37236/11163 ( reposiTUm)
Drmota, M., Shamir, G., & Szpankowski, W. (2022). Sequential universal modeling for non-binary sequences with constrained distributions. Communications in Information and Systems, 22(1), 1–38. https://doi.org/10.4310/CIS.2022.v22.n1.a1 ( reposiTUm)
Drmota, M., Mauduit, C., Rivat, J., & Spiegelhofer, L. (2022). Möbius orthogonality of sequences with maximal entropy. Journal d’Analyse Mathématique, 146(2), 531–548. https://doi.org/10.1007/s11854-022-0201-z ( reposiTUm)
Adamczewski, B., Drmota, M., & Müllner, C. (2021). (Logarithmic) Densities for Automatic Sequences along Primes and Squares. Transactions of the American Mathematical Society, 375(01), 455–499. https://doi.org/10.1090/tran/8476 ( reposiTUm)
Drmota, M., & Verwee, J. (2021). Effective Erdos-Wintner Theorems for Digital Expansions. Journal of Number Theory, 229, 218–260. https://doi.org/10.1016/j.jnt.2021.04.006 ( reposiTUm)
Drmota, M., Noy, M., & Yu, G.-R. (2021). Universal singular exponents in catalytic variable equations. Journal of Combinatorial Theory, Series A, 185(105522), 105522. https://doi.org/10.1016/j.jcta.2021.105522 ( reposiTUm)
Drmota, M., Mauduit, C., & Rivat, J. (2020). Prime numbers in two bases. Duke Mathematical Journal, 169(10). https://doi.org/10.1215/00127094-2019-0083 ( reposiTUm)
Drmota, M., Ramos, L., Requilé, C., & Rué, J. (2020). Maximal independent sets and maximal matchings in series-parallel and related graph classes. Electronic Journal of Combinatorics, 27(1). https://doi.org/10.37236/8683 ( reposiTUm)
Drmota, M., & Stufler, B. (2020). Pattern occurrences in random planar maps. Statistics and Probability Letters, 158(108666), 108666. https://doi.org/10.1016/j.spl.2019.108666 ( reposiTUm)
Da Costa, F. P., Drmota, M., & Grinfield, M. (2020). Modelling silicosis: The structure of equilibria. European Journal of Applied Mathematics, 31(6), 950–967. https://doi.org/10.1017/s0956792519000329 ( reposiTUm)
Drmota, M., & Krattenthaler, C. (2019). 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(10), 4123–4133. https://doi.org/10.1090/proc/14349 ( reposiTUm)
DRMOTA, M., MAGNER, A., & SZPANKOWSKI, W. (2019). Asymmetric Renyi Problem. Combinatorics, Probability and Computing, 28(4), 542–573. https://doi.org/10.1017/s0963548318000329 ( reposiTUm)
Drmota, M., Mauduit, C., & Rivat, J. (2019). Normality among Squares. Journal of the European Mathematical Society, 21(2), 507–548. https://doi.org/10.4171/jems/843 ( reposiTUm)
Deshouillers, J.-M., Drmota, M., Müllner, C., & Spiegelhofer, L. (2019). RANDOMNESS AND NON-RANDOMNESS PROPERTIES OF PIATETSKI-SHAPIRO SEQUENCES MODULO 𝑚. Mathematika, 65(4), 1051–1073. https://doi.org/10.1112/s0025579319000287 ( reposiTUm)
Collet, G., Drmota, M., & Klausner, L. D. (2019). Limit laws of planar maps with prescribed vertex degrees. Combinatorics, Probability and Computing, 28(4), 519–541. https://doi.org/10.1017/s0963548318000573 ( reposiTUm)
Drmota, M., Müllner, C., & Spiegelhofer, L. (2018). Möbius Orthogonality for the Zeckendorf sum-of-digits function. Proceedings of the American Mathematical Society, 146(9), 3679–3691. https://doi.org/10.1090/proc/14015 ( reposiTUm)
Drmota, M., Jin, E. Y., & Stufler, B. (2018). Graph limits of random graphs from a subset of connected k-trees. Random Structures and Algorithms, 55(1), 125–152. https://doi.org/10.1002/rsa.20802 ( reposiTUm)
Drmota, M., & Szpankowski, W. (2017). Redundancy of Lossless Data Compression for Known Sources by Analytic Methods. Foundations and Trends in Communications and Information Theory, 13(4), 277–417. https://doi.org/10.1561/0100000090 ( reposiTUm)
Drmota, M., Ramos, L., & Rué, J. (2017). Subgraph statistics in subcritical graph classes. Random Structures and Algorithms, 51(4), 631–673. http://hdl.handle.net/20.500.12708/147613 ( reposiTUm)
Drmota, M., Kauers, M., & Spiegelhofer, L. (2016). On a Conjecture of Cusick Concerning the Sum of Digits of $n$ and $n+t$. SIAM Journal on Discrete Mathematics, 30(2), 621–649. https://doi.org/10.1137/15m1041857 ( reposiTUm)
BANDERIER, C., & DRMOTA, M. (2015). Formulae and Asymptotics for Coefficients of Algebraic Functions. Combinatorics, Probability and Computing, 24(1), 1–53. https://doi.org/10.1017/s0963548314000728 ( reposiTUm)
Deshouillers, J.-M., Drmota, M., & Müllner, C. (2015). Automatic sequences generated by synchronizing automata fulfill the Sarnak conjecture. Studia Mathematica, 1–13. https://doi.org/10.4064/sm8479-2-2016 ( reposiTUm)
Drmota, M. (2015). The discrepancy of generalized Van-der-Corput-Halton sequences. Indagationes Mathematicae, 26(5), 748–759. https://doi.org/10.1016/j.indag.2015.09.005 ( reposiTUm)
Drmota, M., & Jin, E. Y. (2015). An Asymptotic Analysis of Labeled and Unlabeled k-Trees. Algorithmica, 75(4), 579–605. https://doi.org/10.1007/s00453-015-0039-1 ( reposiTUm)
Drmota, M., Fuchs, M., & Lee, Y.-W. (2015). Stochastic analysis of the extra clustering model for animal grouping. Journal of Mathematical Biology, 73(1), 123–159. https://doi.org/10.1007/s00285-015-0941-9 ( reposiTUm)
Drmota, M., de Mier, A., & Noy, M. (2014). Extremal statistics on non-crossing configurations. Discrete Mathematics, 327, 103–117. https://doi.org/10.1016/j.disc.2014.03.016 ( reposiTUm)
Drmota, M., Giménez, O., Koy, M., Panagiotou, K., & Steger, A. (2014). The maximum degree of random planar graphs. Proceedings of the London Mathematical Society, LONDON, UK(109), 892–920. http://hdl.handle.net/20.500.12708/157674 ( reposiTUm)
Drmota, M., & Gerhold, S. (2014). Disproof of a conjecture by Rademacher on partial fractions. Proceedings of the American Mathematical Society: Series B, 1(11), 121–134. https://doi.org/10.1090/s2330-1511-2014-00014-6 ( reposiTUm)
DRMOTA, M., & LLADÓ, A. (2014). Almost Every Tree With m Edges Decomposes K₂ₘ,₂ₘ. Combinatorics, Probability and Computing, 23(1), 50–65. https://doi.org/10.1017/s0963548313000485 ( reposiTUm)
Sulzbach, H., Neininger, R., & Drmota, M. (2014). A Gaussian limit process for optimal FIND algorithms. Electronic Journal of Probability, 19(none). https://doi.org/10.1214/ejp.v19-2933 ( reposiTUm)
Drmota, M., & Panagiotou, K. (2013). A central limit theorem for the number of degree-k vertices in Random maps. Algorithmica, 66(4), 741–761. https://doi.org/10.1007/s00453-013-9751-x ( reposiTUm)
Drmota, M., & Szpankowski, W. (2013). A master theorem for discrete divide and conquer recurrences,. Journal of the ACM, 60(3), 1–49. https://doi.org/10.1145/2487241.2487242 ( reposiTUm)
Drmota, M., & Skalba, M. (2013). EQUIDISTRIBUTION OF DIVISORS IN RESIDUE CLASSES AND REPRESENTATIONS BY BINARY QUADRATIC FORMS. International Journal of Number Theory, 09(08), 2011–2018. https://doi.org/10.1142/s1793042113500711 ( reposiTUm)
Drmota, M., & Morgenbesser, J. F. (2012). Generalized Thue-Morse sequences of squares. Israel Journal of Mathematics, 190(1), 157–193. https://doi.org/10.1007/s11856-011-0186-2 ( reposiTUm)
Drmota, M. (2012). Embedded trees and the support of the ISE. European Journal of Combinatorics, 34(1), 123–137. https://doi.org/10.1016/j.ejc.2012.07.020 ( reposiTUm)
Drmota, M., & Maria, I. (2012). On the discrepancy of some generalized Kakutani’s sequences of partitions. Uniform Distribution Theory, 7, 75–104. http://hdl.handle.net/20.500.12708/164675 ( reposiTUm)
Drmota, M., & Kutzelnigg, R. (2012). A precise analysis of Cuckoo hashing. ACM Transactions on Algorithms, 8(2), 1–36. https://doi.org/10.1145/2151171.2151174 ( reposiTUm)
Deshoulliers, J.-M., Drmota, M., & Morgenbesser, J. (2012). Subsequences of automatic sequences indexed by [𝑛ᶜ] and correlations. International Journal of Number Theory, 132(9), 1837–1866. https://doi.org/10.1016/j.jnt.2012.03.006 ( reposiTUm)
Drmota, M., Mauduit, C., & Rivat, J. (2011). The sum of digits function of polynomial sequences. Journal of the London Mathematical Society, 84(1), 81–102. https://doi.org/10.1112/jlms/jdr003 ( reposiTUm)
Drmota, M., Giménez, O., & Noy, M. (2011). Degree distribution in random planar graphs. Journal of Combinatorial Theory, Series A, 118(7), 2102–2130. https://doi.org/10.1016/j.jcta.2011.04.010 ( reposiTUm)
Drmota, M., & Szpankowski, W. (2011). The expected profile of digital search trees. Journal of Combinatorial Theory, Series A, 118(7), 1939–1965. https://doi.org/10.1016/j.jcta.2011.04.001 ( reposiTUm)
Drmota, M., & Nedela, R. (2011). Asymptotic enumeration of reversible maps regardless of genus. Ars Mathematica Contemporanea, 5(1), 77–79. http://hdl.handle.net/20.500.12708/163136 ( reposiTUm)
Drmota, M., Fusy, É., Kang, M., Kraus, V., & Rué, J. (2011). Asymptotic study of subcritical graph classes. SIAM Journal on Discrete Mathematics, 25(4), 1615–1651. https://doi.org/10.1137/100790161 ( reposiTUm)
DRMOTA, M., GIMÉNEZ, O., & NOY, M. (2011). The maximum degree of series-parallel graphs. Combinatorics, Probability and Computing, 20(4), 529–570. https://doi.org/10.1017/s0963548311000198 ( reposiTUm)
Arnold, A., Drmota, M., Schmock, U., & Viertl, R. (2011). Mathematik in Wien: Technische Universität Wien. Internationale Mathematische Nachrichten, 216, 31–52. http://hdl.handle.net/20.500.12708/161907 ( reposiTUm)
Drmota, M., Giménez, O., & Noy, M. (2010). Vertices of given degree in series-parallel graphs. Random Structures and Algorithms, 36(3), 273–314. https://doi.org/10.1002/rsa.20290 ( reposiTUm)
Drmota, M., Reznik, Y. A., & Szpankowski, W. (2010). Tunstall code, Khodak variations, and Random walks. IEEE Transactions on Information Theory, 56(6), 2928–2937. https://doi.org/10.1109/tit.2010.2046248 ( reposiTUm)
Drmota, M., & Gittenberger, B. (2010). The shape of unlabeled rooted random trees. European Journal of Combinatorics, 31(8), 2028–2063. https://doi.org/10.1016/j.ejc.2010.05.011 ( reposiTUm)
Drmota, M., & Mauduit, C. (2010). Weyl sums over integers with affine digit restrictions. Journal of Number Theory, 130(11), 2404–2427. https://doi.org/10.1016/j.jnt.2010.04.006 ( reposiTUm)
Drmota, M. (2009). 40 Jahre Mathematikolympiade. Internationale Mathematische Nachrichten, 212, 29–32. http://hdl.handle.net/20.500.12708/166422 ( reposiTUm)
Drmota, M., Mauduit, C., & Rivat, J. (2009). Primes with an average sum of digits. Compositio Mathematica, 145(2), 271–292. https://doi.org/10.1112/s0010437x08003898 ( reposiTUm)
Gruber, P. M., Schmidt, W., Helmberg, G., Drmota, M., Winkler, R., & Tichy, R. F. (2009). Edmund Hlawka (1916-2009). Internationale Mathematische Nachrichten, 211, 1–26. http://hdl.handle.net/20.500.12708/165730 ( reposiTUm)
Drmota, M., Gittenberger, B., Panholzer, A., Prodinger, H., & Ward, M. D. (2009). On the shape of the fringe of various types of random trees. Mathematical Methods in the Applied Sciences, 32, 1207–1245. http://hdl.handle.net/20.500.12708/165681 ( reposiTUm)
Drmota, M. (2009). The height of increasing trees. Annals of Combinatorics, 12(4), 373–402. https://doi.org/10.1007/s00026-009-0009-x ( reposiTUm)
Drmota, M., Iksanov, A., Moehle, M., & Roesler, U. (2009). A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree. Random Structures and Algorithms, 34(3), 319–336. https://doi.org/10.1002/rsa.20233 ( reposiTUm)
Drmota, M., Grabner, P. J., & Liardet, P. (2008). Block additive functions on the Gaussian integers. Acta Arithmetica, 135(4), 299–332. https://doi.org/10.4064/aa135-4-1 ( reposiTUm)
Drmota, M., & Stoll, Th. (2008). Newman’s phenomenon for generalized Thue.Morse sequences. Discrete Mathematics, 308(7), 1191–1208. https://doi.org/10.1016/j.disc.2007.03.069 ( reposiTUm)
Bugeaud, Y., Drmota, M., & Szpankowski, W. (2008). On the construction of (explicit) Khodak’s code and its analysis. IEEE Transactions on Information Theory, 54(11), 5073–5086. https://doi.org/10.1109/tit.2008.929959 ( reposiTUm)
Drmota, M., Janson, S., & Ralph, N. (2008). A functional limit theorem for the profile of search trees. Annals of Applied Probability, 18(1). https://doi.org/10.1214/07-aap457 ( reposiTUm)
Drmota, M., Rivat, J., & Stoll, T. (2008). The sum of digits of primes in ℤ[i]. Monatshefte Für Mathematik, 155(3–4), 317–347. https://doi.org/10.1007/s00605-008-0010-1 ( reposiTUm)
CHYZAK, F., DRMOTA, M., KLAUSNER, T., & KOK, G. (2008). The distribution of patterns in random trees. Combinatorics, Probability and Computing, 17(1), 21–59. https://doi.org/10.1017/s0963548307008425 ( reposiTUm)
Drmota, M., Iksanov, A., Moehle, M., & Roesler, U. (2007). Asymptotic results concerning the total branch length of the Bolthausen-Sznitman coalescent. Stochastic Processes and Their Applications, 117, 1404–1421. http://hdl.handle.net/20.500.12708/168706 ( reposiTUm)
Bugeaud, Y., Drmota, M., & De Mathan, B. (2007). On a mixed Littlewood conjecture in Diophantine approximation. Acta Arithmetica, 128.2, 107–124. http://hdl.handle.net/20.500.12708/168705 ( reposiTUm)
Albrecher, H., Drmota, M., Goldstern, M., & Winkler, R. (2007). Robert F. Tichy: 50 years - The unreasonable effectiveness of a number theorist,. Uniform Distribution Theory, 2(1), 151–160. http://hdl.handle.net/20.500.12708/168737 ( reposiTUm)
Drmota, M., & Prodinger, H. (2006). The register function for t-ary trees. ACM Transactions on Algorithms, 2(3), 318–334. http://hdl.handle.net/20.500.12708/172078 ( reposiTUm)
Drmota, M., Louchard, G., & Yanev, N. M. (2006). Analysis of a recurrence related to critical nonhomogeneous branching process. Stochastic Analysis and Applications, 24, 37–59. http://hdl.handle.net/20.500.12708/171981 ( reposiTUm)
Drmota, M., Larcher, G., & Pillichshammer, F. (2005). Precise distribution properties of the van der Corput sequence and related sequences. Manuscripta Mathematica, 118, 11–41. http://hdl.handle.net/20.500.12708/171956 ( reposiTUm)
Drmota, M., & Hwang, H.-K. (2005). Bimodality and phase transitions in the profile variance of Random binary search trees. SIAM Journal on Discrete Mathematics, 19(1), 19–45. http://hdl.handle.net/20.500.12708/171957 ( reposiTUm)
Drmota, M., & Rivat, J. (2005). The sum-of-digits function of squares. Journal of the London Mathematical Society, 72, 273–292. http://hdl.handle.net/20.500.12708/171955 ( reposiTUm)
Drmota, M., & Hwang, H.-K. (2005). Profiles of Random trees: Correlation and width of Random recursive trees and binary search trees. Advances in Applied Probability, 37, 321–341. http://hdl.handle.net/20.500.12708/171959 ( reposiTUm)
Drmota, M. (2005). Asymptotic methods of enumeration and applications to Markov chain models. Stochastic Models, 21, 343–375. http://hdl.handle.net/20.500.12708/171958 ( reposiTUm)
Drmota, M., & Marckert, J.-F. (2005). Reinforced weak convergence of stochastic processes. Statistics and Probability Letters, 71, 283–294. http://hdl.handle.net/20.500.12708/171961 ( reposiTUm)
Drmota, M., Schachermayer, W., & Teichmann, J. (2005). A hyper-geometric approach to the BMV-conjecture. Monatshefte Für Mathematik, 146(3), 179–201. http://hdl.handle.net/20.500.12708/171869 ( reposiTUm)
Drmota, M., & Gutenbrunner, G. (2005). The joint distribution of Q-additive functions on polynomial over finite fields. Journal de Theorie Des Nombres de Bordeaux, 17, 135–159. http://hdl.handle.net/20.500.12708/171960 ( reposiTUm)
Drmota, M., Gittenberger, B., & Klausner, T. (2005). Extended Admissible Functions and Gaussian Limiting Distributions. Mathematics of Computation, 74(252), 1953–1966. http://hdl.handle.net/20.500.12708/171902 ( reposiTUm)
Drmota, M. (2003). Discrete Random Walks on One-Sided Periodic Graphs. Discrete Mathematics & Theoretical Computer Science, VOLAC, 83–94. http://hdl.handle.net/20.500.12708/174485 ( reposiTUm)
Drmota, M., & Schmid, U. (1993). The Analysis of the Expected Successful Operation Time of Slotted ALOHA. IEEE Transactions on Information Theory, 39(5), 1567–1577. https://doi.org/10.1109/18.259641 ( reposiTUm)
Drmota, M., Scheidl, M., Troger, H., & Weinmüller, E. (1987). On the Imperfection Sensitivity of Complete Spherical Shells. Computational Mechanics, 2, 63–74. http://hdl.handle.net/20.500.12708/174544 ( reposiTUm)

Beiträge in Tagungsbänden

Drmota, M., & Hainzl, E. M. (2022). Universal Properties of Catalytic Variable Equations. In 33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022) (pp. 1–15). https://doi.org/10.4230/LIPIcs.AofA.2022.7 ( reposiTUm)
Drmota, M., Noy, M., & Stufler, B. (2020). Cut vertices in random planar maps. In Proceedings AofA 2020 - LIPIcs (pp. 10:1-10:18). Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.AofA.2020.10 ( reposiTUm)
Drmota, M., Ramos, L., Requilé, C. L. M., & Rué, J. (2018). Maximal Independent Sets and Maximal Matchings in Series-parallel and Related Graph Classes. In J. A. Fill & M. D. Ward (Eds.), 29th International Conference on Probabilistic,  Combinatorial and Asymptotic Methods for the Analysis of Algorithms  (AofA 2018) (pp. 18:1-18:15). STACS 2016 - Leibniz International Proceedings in Informatics (LIPIcs). https://doi.org/10.4230/LIPIcs.AofA.2018.18 ( reposiTUm)
Drmota, M., & Yu, G.-R. (2018). The Number of Double Triangles in Random Planar Maps. In J. A. Fill & M. D. Ward (Eds.), Leibniz International Proceedings in Informatics 110 - AofA 2018 (pp. 19:1-19:18). STACS 2016 - Leibniz International Proceedings in Informatics (LIPIcs). https://doi.org/10.4230/LIPIcs.AofA.2018.19 ( reposiTUm)
Drmota, M., Fuchs, M., Hwang, H.-K., & Neininger, R. (2017). External Profile of Symmetric Digital Search Trees (Extended Abstract). In 2017 Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO). SIAM, Austria. SIAM - Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974775.12 ( reposiTUm)
Drmota, M., Magner, A., & Szpankowski, W. (2016). Asymmetric Renyi Problem and PATRICIA tries. In R. Neininger & M. Zaionc (Eds.), Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms. AofA. http://hdl.handle.net/20.500.12708/41491 ( reposiTUm)
Drmota, M., & Javanian, M. (2016). Solutions of First Order Linear Partial Differential Equations Related to Urn Models and Central Limit Theorems. In R. Neininger & M. Zaionc (Eds.), Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms. AofA. http://hdl.handle.net/20.500.12708/41490 ( reposiTUm)
Jin, Y., & Drmota, M. (2016). Scaling limit of random k-trees. In 2016 Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO). SIAM, Austria. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974324.7 ( reposiTUm)
Collet, G., Drmota, M., & Klausner, L. (2016). Vertex Degrees in Planar Maps. In M. Zaionc & R. Neininger (Eds.), Proceedings of the 27th International Conference on Probalistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms. AofA. https://doi.org/10.48550/arXiv.1605.04206 ( reposiTUm)
Drmota, M., Fuchs, M., & Lee, Y.-W. (2014). Limit Laws for the Number of Groups formed by Social Animals under the Extra Clustering Model. In M. Bousquet-Melou & M. Soria (Eds.), Proceedings of the 25th. International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (pp. 73–84). DMTCS. http://hdl.handle.net/20.500.12708/41366 ( reposiTUm)
Drmota, M., & Jin, Y. (2014). An Asymptotic Analysis of Unlabeled k-Trees. In M. Bousquet-Melou & M. Soria (Eds.), Proceedings of the 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (pp. 85–96). DMTCS. http://hdl.handle.net/20.500.12708/41367 ( reposiTUm)
Banderier, C., & Drmota, M. (2013). Coefficients of algebraic functions: formulae and asymptotics. In 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), DMTCS Proc. AS (pp. 1065–1076). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/41280 ( reposiTUm)
Drmota, M., & Lladó, A. (2013). On a conjecture of Graham and Häggkvist for random trees. In The Seventh European Conference on Combinatorics, Graph Theory and Applications (pp. 437–441). Springer Verlag. https://doi.org/10.1007/978-88-7642-475-5_70 ( reposiTUm)
Drmota, M., & Noy, M. (2013). Extremal parameters in subcritical graph classes. In Proceedings of ANALCO2013: Meeting on Analytic Algorithms and Combinatorics (pp. 1–7). SIAM (Society for Industrial and Applied Mathematics. http://hdl.handle.net/20.500.12708/41229 ( reposiTUm)
Drmota, M., Giménez, O., Noy, M., Panagiotou, K., & Steger, A. (2012). The maximum degree of random planar graphs. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 281–287). SIAM. http://hdl.handle.net/20.500.12708/41143 ( reposiTUm)
Drmota, M., Gittenberger, B., & Morgenbesser, J. (2012). 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) (pp. 453–478). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/41145 ( reposiTUm)
Drmota, M., & Panagiotou, K. (2012). 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 (p. 15). SIAM. http://hdl.handle.net/20.500.12708/41187 ( reposiTUm)
Drmota, M., Szpankowski, W., & Viswanathan, K. (2012). Mutual information for a deletion channel. In 2012 IEEE International Symposium on Information Theory Proceedings. IEEE. https://doi.org/10.1109/isit.2012.6283980 ( reposiTUm)
Drmota, M., & Szpankowski, W. (2011). A master theorem for discrete divide and conquer recurrences. In Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithmsr (pp. 342–361). SIAM. http://hdl.handle.net/20.500.12708/41124 ( reposiTUm)
Drmota, M., & Szpankowski, W. (2011). Analysis of a Block Arithmetic Coding: Discrete divide and conquer recurrences. In 2011 IEEE International Symposium on Information Theory Proceedings. Elsevier. https://doi.org/10.1109/isit.2011.6033751 ( reposiTUm)
Drmota, M., & Szpankowski, W. (2009). (Un)Expected behavior of digital search tree profile. In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 130–138). SIAM. http://hdl.handle.net/20.500.12708/40812 ( reposiTUm)
Drmota, M., Gittenberger, B., & Kutzelnigg, R. (2009). Combinatorial Models for Cooperation Networks. In Lecture Notes in Computer Science (pp. 206–217). Springer Verlag. https://doi.org/10.1007/978-3-642-10217-2_22 ( reposiTUm)
Drmota, M. (2009). Embedded Trees and the Support of the ISE. In Lecture Notes in Computer Science (pp. 194–205). Springer Verlag. https://doi.org/10.1007/978-3-642-10217-2_21 ( reposiTUm)
Kutzelnigg, R., & Drmota, M. (2008). Random bipartite graphs and their application to cuchoo hashing. In H. Kaiser & R. Kirner (Eds.), Proceedings of the Junior Scientist Conference 2008 (pp. 281–282). Technische Universität Wien. http://hdl.handle.net/20.500.12708/40804 ( reposiTUm)
Drmota, M., Gittenberger, B., & Panholzer, A. (2008). The degree distriution of thickened trees. In Proceedings of the Fifth Colloquium on Mathematics and Computer Science (pp. 149–162). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/40800 ( reposiTUm)
Drmota, M., Giménez, O., & Noy, M. (2008). Degree distribution in random planar graphs. In Fifth Colloquium on Mathematics and Computer Science (pp. 163–178). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/40807 ( reposiTUm)
Drmota, M., & Szpankowski, W. (2007). One-sided Variations on Tries: Path Imbalance, Climbing, and Key Sampling. In 2007 Conference on Analysis of Algorithms, AofA 07 (pp. 303–310). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/40808 ( reposiTUm)
Drmota, M., & Szpankowski, W. (2007). On the exit time of a random walk with positive drift. In Prodeedings of AofA 2007 (pp. 291–302). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/40787 ( reposiTUm)
Drmota, M. (2006). Concentration properties of extremal parameters in Random discrete structures. In Proceedings of the 4th Colloquium on Mathematics and Computerscience (pp. 1–30). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/40646 ( reposiTUm)
Drmota, M., Reznik, Y., Savari, S., & Szpankowski, W. (2006). Precise asymptotic analysis of the Tunstall code. In Proceedings of the 2006 IEEE International Symposium on Information Theory (p. 4). IEEE. http://hdl.handle.net/20.500.12708/40658 ( reposiTUm)

Beiträge in Büchern

Deshouillers, J.-M., Drmota, M., & Müllner, C. (2023). Coprimality of Consecutive Elements in a Piatetski-Shapiro Sequence. In H. Maier, J. Steuding, & R. Steuding (Eds.), Number Theory in Memory of Eduard Wirsing (pp. 91–98). Springer. https://doi.org/10.1007/978-3-031-31617-3_7 ( reposiTUm)
Drmota, M., Hofer, R., & Larcher, G. (2017). On the Discrepancy of Halton–Kronecker Sequences. In Number Theory – Diophantine Problems, Uniform Distribution and Applications (pp. 219–226). Springer International Publishing. https://doi.org/10.1007/978-3-319-55357-3_10 ( reposiTUm)
Drmota, M. (2014). Subsequences of automatic sequences and uniform distribution. In P. V. Kritzer, H. Niederreiter, F. Pillichshammer, & A. Winterhof (Eds.), Uniform Distribution and Quasi-Monte Carlo Methods - Discrepancy, Integration and Applications (pp. 87–104). Walter de Gruyter. http://hdl.handle.net/20.500.12708/28488 ( reposiTUm)
Drmota, M., & Grabner, P. J. (2010). Analysis of digital functions and applications. In V. Berthé & M. Rigo (Eds.), Combinatorics, Automata and Number Theory (pp. 452–504). Cambridge University Press. http://hdl.handle.net/20.500.12708/26874 ( reposiTUm)
Drmota, M., & Gittenberger, B. (2009). Analytic combinatorics on random graphs. In M. Dehmer & F. Emmert-Streib (Eds.), Analysis of Complex Networks (pp. 425–448). Wiley-VCH. http://hdl.handle.net/20.500.12708/26367 ( reposiTUm)

Bücher

Drmota, M., Gittenberger, B., Karigl, G., & Panholzer, A. (Eds.). (2014). Mathematik für Informatik. Vierte erweiterte Auflage. Heldermann Verlag. http://hdl.handle.net/20.500.12708/23874 ( reposiTUm)
Drmota, M., Gittenberger, B., Karigl, G., & Panholzer, A. (2010). Mathematik für Informatik. Heldermann Verlag. http://hdl.handle.net/20.500.12708/176068 ( reposiTUm)
Drmota, M. (2009). Random Trees (An Interplay between Combinatorics and Probability). Springer. http://hdl.handle.net/20.500.12708/22834 ( reposiTUm)
Drmota, M., Gittenberger, B., Karigl, G., & Panholzer, A. (2007). Mathematik für Informatik. Heldermann Verlag. http://hdl.handle.net/20.500.12708/22176 ( reposiTUm)

Tagungsbände

Drmota, M., & Gittenberger, B. (Eds.). (2010). 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. http://hdl.handle.net/20.500.12708/23237 ( reposiTUm)
Dehmer, M., Drmota, M., & Emmert-Streib, F. (Eds.). (2008). Proceedings of the 2008 International Conference on Information Theory and Statistical Learning. CSREA Press. http://hdl.handle.net/20.500.12708/23052 ( reposiTUm)
Drmota, M., Larcher, G., Tichy, R. F., & Winkler, R. (Eds.). (2005). Proceedings of the 2004 Number Theoretic Algorithms and Related Topics Workshop. Editors: Melvyn Nathanson, Jaroslav Nesetril, Carl Pomerance. http://hdl.handle.net/20.500.12708/22160 ( reposiTUm)

Präsentationen

Drmota, M. (2023, January 23). Pattern Occurrence Counts in Random Planar Maps [Presentation]. Oxford Probability Seminar (2023), United Kingdom of Great Britain and Northern Ireland (the). ( reposiTUm)
Drmota, M. (2023, March 22). Pattern Occurrence Counts in Random Planar Maps [Presentation]. Combinatorics, geometry and topology seminar (IST Austria) 2023, Austria. ( reposiTUm)
Drmota, M. (2023, February 28). Subgraph Statistics in Series-Parallel Graphs and Related Graph Structure [Presentation]. Applied Mathematics Webinar 2023, Tunisia. ( reposiTUm)
Drmota, M. (2023, June 29). Tree Rooted Planar Graphs [Conference Presentation]. The 34th International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2023), Taipei, Taiwan (Province of China). ( reposiTUm)
Drmota, M. (2022, 0 0). Moebius orthogonalily: a classical and modern topic in number theory [Presentation]. Univ. Xiamen, China, China. ( reposiTUm)
Drmota, M. (2022, 0 0). Random Trees - An Analytic Approach [Presentation]. Munich Summer School, Discrete Random Systems, Germany. ( reposiTUm)
Drmota, M. (2022, 0 0). Primes as Sums of Fibonacci Numbers I. [Presentation]. ArithRand 2022, TU Graz, Austria. ( reposiTUm)
Drmota, M. (2022, 0 0). Primes as Sums of Fibonacci Numbers [Presentation]. Univ. Aix-Marseille, Marseille, France. ( reposiTUm)
Drmota, M., Müllner, C., & Spiegelhofer, L. (2022, March 17). Primes as sums of Fibonacci numbers [Presentation]. Colloquium de l’IDP, France. ( reposiTUm)
Drmota, M. (2022, 0 0). Subsequences of Automatic Sequences and Uniform Distribution [Presentation]. SFB-Meeting Traunkirchen, Austria. ( reposiTUm)
Drmota, M. (2022, March 15). Cores and Components in Cubic Planar Maps [Presentation]. Arbeitsgemeinschaft Diskrete Mathematik, Austria. ( reposiTUm)
Drmota, M. (2021). Subgraph Statistics in Series-Parallel Graphs and Related Graph Structure. CSGT 2021 The 56th Czech and Slovak Conference on Graph Theory, Rajecke Teplice, Slowakei, EU. http://hdl.handle.net/20.500.12708/123323 ( reposiTUm)
Drmota, M. (2021). (Maximal) Independent Sets in Various Random Graph Classes. Seminar, Ecole Centrale Paris, EU. http://hdl.handle.net/20.500.12708/123321 ( reposiTUm)
Drmota, M. (2021). (Maximal) Independent Sets in Various Random Graph Classes. SFB F50 Meeting 2021 (Spezialforschungsbereich, initiiert vom FWF findet mehrmals jährlich statt), Johannes Kepler Universität Linz, Austria. http://hdl.handle.net/20.500.12708/123317 ( reposiTUm)
Drmota, M. (2021). (Logarithmic) Densities for Automatic Sequences along Primes and Squares. AG Diskrete Mathematik, Technische Universität Wien, Austria. http://hdl.handle.net/20.500.12708/123312 ( reposiTUm)
Drmota, M. (2021). Universal Asymptotics for Positive Catalytic Equations. Seminar, Ecole Centrale Paris, EU. http://hdl.handle.net/20.500.12708/123319 ( reposiTUm)
Drmota, M. (2021). Primes as Sums of Fibonacci Numbers. AG Diskrete Mathematik, Technische Universität Wien, Austria. http://hdl.handle.net/20.500.12708/123320 ( reposiTUm)
Drmota, M. (2021). Universal singular exponents in catalytic variable equations. Eurocomb Barcelona 2021, Barcelona, online, Spain. http://hdl.handle.net/20.500.12708/123322 ( reposiTUm)
Drmota, M. (2021). (Logarithmic) Densities for Automatic Sequences along Primes and Squares. One World Numeration Seminar, ONLINE international, Unknown. http://hdl.handle.net/20.500.12708/123314 ( reposiTUm)
Drmota, M., Noy, M., & Stufler, B. (2020). Cut vertices in random planar maps. AG Diskrete Mathematik Seminar, Wien, Austria. http://hdl.handle.net/20.500.12708/123222 ( reposiTUm)
Drmota, M., Noy, M., & Stufler, B. (2020). Cut vertices in random planar maps. Probability and Combinatorics Seminar, Uppsala, EU. http://hdl.handle.net/20.500.12708/123220 ( reposiTUm)
Drmota, M. (2020). Digital expansions with respect to different bases. Colloquium on the occasion of the 60th birthday of Univ.Prof.Dr. Gerhard Larcher, Linz, Austria. http://hdl.handle.net/20.500.12708/123158 ( reposiTUm)
Drmota, M. (2020). (Logarithmic) Densities for Automatic Sequences along Primes and Squares. Diophantine Problems, Determinism and Randomness, Frankreich, EU. http://hdl.handle.net/20.500.12708/123156 ( reposiTUm)
Drmota, M. (2020). Die Magie der Zahl pi. TUforMath, Wien, Austria. http://hdl.handle.net/20.500.12708/123157 ( reposiTUm)
Drmota, M. (2019). Cut Vertices in Random Planar Maps. AG Diskrete Mathematik, Technische Universität Wien, Austria. http://hdl.handle.net/20.500.12708/122972 ( reposiTUm)
Drmota, M. (2019). Positive Systems of Polynominal Equations. OPSFA 2019, Hagenberg, Austria. http://hdl.handle.net/20.500.12708/122971 ( reposiTUm)
Drmota, M. (2019). Concentration properties of the height and fill-up-level of digital search trees. AofA 2019, Marseille, France. http://hdl.handle.net/20.500.12708/122970 ( reposiTUm)
Drmota, M. (2019). Concentration properties of the height and fill-up-level of digital search trees. Seminarvortrag, Regensburg, Germany. http://hdl.handle.net/20.500.12708/122952 ( reposiTUm)
Requilé, C. L. M., Drmota, M., Noy, M., & Rué Perna, J. (2018). A Census of Planar Maps and Graphs. Discrete Mathematics Workshop, Stellenbosch University, South Africa, Non-EU. http://hdl.handle.net/20.500.12708/122590 ( reposiTUm)
Drmota, M., Ramos, L., & Rué, J. (2018). Subgraph counting in series-parallel graphs and infinite dimensional systems of functional equations. Knuth 80: Scientific Symposium on Algorithms, Combinatorics and Informatics, Pitea, Schweden, EU. http://hdl.handle.net/20.500.12708/122687 ( reposiTUm)
Drmota, M. (2018). The Sum-of-digits-Function, Primes and Uniform Distribution Modulo 1. Journée Charles Hermite, Institut Élie Cartan de Lorraine, Université de Lorraine, Nancy, Frankreich, EU. http://hdl.handle.net/20.500.12708/122690 ( reposiTUm)
Drmota, M. (2018). The Sum-of-digits-Function, Primes and Uniform Distribution Modulo 1. International Conference on Uniform Distribution Theory, Marseille, France, EU. http://hdl.handle.net/20.500.12708/122689 ( reposiTUm)
Drmota, M. (2018). Pattern Occurrences in Random Planar Maps. Workshop “Large Networks and Random Graphs,” Goethe Universität, Frankfurt, Deutschland, EU. http://hdl.handle.net/20.500.12708/122691 ( reposiTUm)
Drmota, M. (2018). Mathematik heute. ProScientia meeting, Vienna,  Austria, Austria. http://hdl.handle.net/20.500.12708/122688 ( reposiTUm)
Drmota, M. (2017). Subsequences of Automatic Sequences. International Conference in Number Theory, Kerala School of Mathematics, Indien, Non-EU. http://hdl.handle.net/20.500.12708/122226 ( reposiTUm)
Drmota, M. (2017). Trees, Random Mappings and k-Trees. Journee en l´honneur de Michele Soria, Paris, EU. http://hdl.handle.net/20.500.12708/122228 ( reposiTUm)
Drmota, M. (2017). Primzahlen und automatische Folgen. ÖMG - Lehrer/innen/fortbildungstagung, Universität Wien, Austria. http://hdl.handle.net/20.500.12708/122227 ( reposiTUm)
Drmota, M. (2017). Universal Asymptotics for Positive Catalytic Functional Equations. AofA 2017, Princeton, Non-EU. http://hdl.handle.net/20.500.12708/122229 ( reposiTUm)
Drmota, M. (2017). Positive catalytic and non-catalytic polynomial systems of equations. BIRS, Ban, EU. http://hdl.handle.net/20.500.12708/122230 ( reposiTUm)
Drmota, M., Müllner, C., & Spiegelhofer, L. (2017). Möbius Orthogonality for the Zeckendorf Sum-of-Digits Function. Number Theory and Applications, Sousse, Non-EU. http://hdl.handle.net/20.500.12708/122193 ( reposiTUm)
Drmota, M. (2017). Distribution Properties of Subsequences of Automatic Sequences. Number Theory and Applications, Sousse, Non-EU. http://hdl.handle.net/20.500.12708/122232 ( reposiTUm)
Drmota, M., Spiegelhofer, L., & Müllner, C. (2017). Möbius Orthogonality for the Zeckendorf Sum-of-Digits Function. Prime Numbers and Automatic Sequences: Determinism and Randomness, Marseille, EU. http://hdl.handle.net/20.500.12708/122192 ( reposiTUm)
Drmota, M. (2017). Subgraph Counting in Series-Parallel Graphs and Infinite Dimensional Systems of Functional Equations. Workshop on Analytic and Enumerative Aspects of Combinatorics, Hsinchu, Taiwan, Non-EU. http://hdl.handle.net/20.500.12708/122238 ( reposiTUm)
Drmota, M. (2017). Digital Expansions and Uniform Distribution. Festkolloquium aus Anlass des 60. Geburtstags von Prof.Dr. Robert Tichy, Graz, Austria. http://hdl.handle.net/20.500.12708/122237 ( reposiTUm)
Drmota, M. (2017). Primzahlen und automatische Folgen. Konferenz deutschsprachiger Mathematikfachschaften, TU Wien, Austria. http://hdl.handle.net/20.500.12708/122240 ( reposiTUm)
Drmota, M., & Javanian, M. (2016). Solution of first order linear partial differential equations and central limit theorems. AofA 2016 - 27th. International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis, Kraków, Polen, EU. http://hdl.handle.net/20.500.12708/121810 ( reposiTUm)
Drmota, M., Magner, A., & Szpankowski, W. (2016). Asymmetric Renyi Problem and PATRICIA Tries. AofA 2016 - 27th. International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis, Kraków, Polen, EU. http://hdl.handle.net/20.500.12708/121809 ( reposiTUm)
Drmota, M. (2016). The discrepancy of generalized Halton sequences. Festkolloquium zum Anlass des 50. Geburtstags von Herrn Univ.Prof.Dr. Peter Grabner, Technische Universität Graz, Austria. http://hdl.handle.net/20.500.12708/121659 ( reposiTUm)
Drmota, M. (2016). Subgraph Counting in Series-Parallel Graphs and Innite Dimensional Systems of Functional Equations. Probabilistic and Extremal Combinatorics Downunder, Melbourne, Australien, Non-EU. http://hdl.handle.net/20.500.12708/121661 ( reposiTUm)
Drmota, M. (2016). Subgraph Counting in Serial-Parallel Graphs and Innite Dimensional Systems of Functional Equations. Workshop in Analytic and Probalistic Combinatorics, Banff, Kanada, Non-EU. http://hdl.handle.net/20.500.12708/121662 ( reposiTUm)
Drmota, M. (2016). Vertex Degrees in Planar Maps, Random Trees and Maps: Probalistic and Combinatorical Aspects. CIRM Luminy, Marseille, Frankreich, EU. http://hdl.handle.net/20.500.12708/121660 ( reposiTUm)
Drmota, M. (2016). Normal Subsequences of Automatic Sequences. Ergodic Theory and its Connections with Arithmetic and Combinatorics, Luminy, Marseille, Frankreich, EU. http://hdl.handle.net/20.500.12708/121665 ( reposiTUm)
Drmota, M. (2016). Vertex Degrees in Planar Maps. Colloquium am Department of Applied Mathematics, National Chiao Tung University, Hsinchu, Taiwan, Non-EU. http://hdl.handle.net/20.500.12708/121664 ( reposiTUm)
Drmota, M. (2016). Vertex Degrees in Planar Maps. AG Diskrete Mathematik, Technische Universität Wien, Austria. http://hdl.handle.net/20.500.12708/121663 ( reposiTUm)
Drmota, M. (2016). Subgraph Statistics in Subcritical Graph Classes. SFB-Colloquium, Linz, Austria. http://hdl.handle.net/20.500.12708/121658 ( reposiTUm)
Drmota, M. (2015). Distribution Properties of Subsequences of Automatic Sequences. 2nd Workshop on Combinatorics, Number Theory and Dynamics, IMPA, Rio de Janeiro, Non-EU. http://hdl.handle.net/20.500.12708/121396 ( reposiTUm)
Drmota, M. (2015). Special Automatic Sequences and the Sarnak Conjecture. Ergodic Theory and Dynamical Systems, Bedlewo, Polen, EU. http://hdl.handle.net/20.500.12708/121184 ( reposiTUm)
Drmota, M. (2015). Random Sub-Critical Graph Classes. DMV Jahrestagung der Deutschen Mathematiker-Vereinigung 2015, Minisymposium “Random Discrete Structures and Processes,” Hamburg, Deutschland, EU. http://hdl.handle.net/20.500.12708/121398 ( reposiTUm)
Drmota, M. (2015). Distribution Properties of Subsequences of Automatic Sequences. Numeration 2015, Vandoeuvre-lès-Nancy, EU. http://hdl.handle.net/20.500.12708/121375 ( reposiTUm)
Drmota, M. (2015). Quasi-Random properties of the Thue-Morse sequence and related problems. MuDeRa Workshop, Nancy, EU. http://hdl.handle.net/20.500.12708/121374 ( reposiTUm)
Drmota, M. (2015). Profile of Random Trees. Conference in honour of Svante Janson´s 60th birthday, Krusenberg Mansion, Schweden, EU. http://hdl.handle.net/20.500.12708/121376 ( reposiTUm)
Drmota, M. (2014). Combinatorics and shape characteristics of planar (and related) graph classes. Symposium Diskrete Mathematik 2014, Frankfurt am Main, Germany, EU. http://hdl.handle.net/20.500.12708/120997 ( reposiTUm)
Drmota, M. (2014). Analytic Combinatorics for Random Graphs. ANALCO 2014, Meeting on Analytic Algorithmics and Combinatorics, Portland, USA, Non-EU. http://hdl.handle.net/20.500.12708/120996 ( reposiTUm)
Drmota, M. (2014). Subsequences of Automatic Sequences and Uniform Distribution. 4th International Conference on Uniform Distribution Theory, Ostravice, Czech Republic, EU. http://hdl.handle.net/20.500.12708/120998 ( reposiTUm)
Drmota, M. (2014). The Thue-Morse sequence along squares is normal. Arbeitsgemeinschaft Ergodentheorie, Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/121000 ( reposiTUm)
Drmota, M. (2014). Quasi-Random properties of the Thue-Morse sequence and related problems. Monday Lecture - Methods for Discrete Structures, Berlin, Germany, EU. http://hdl.handle.net/20.500.12708/120999 ( reposiTUm)
Drmota, M. (2013). Coefficients of positive algebraic functions. 24th International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms AofA 2013, Cala Galdana, Menorca, EU. http://hdl.handle.net/20.500.12708/120414 ( reposiTUm)
Drmota, M. (2013). Gelfond problems on the sum-of-digits function and subsequences of automatic sequences. Erdős Centennial 2013, Budapest, Hungary, EU. http://hdl.handle.net/20.500.12708/120413 ( reposiTUm)
Drmota, M. (2013). The Thue-morse sequence along the squares in normal. 18th ÖMG Congress and Annual DMV Meeting, Universität Innsbruck, Austria. http://hdl.handle.net/20.500.12708/120427 ( reposiTUm)
Drmota, M. (2013). Gelfond Problems on the sum-of-digits function and subsequences of automatic sequences. Heilbronn Workshop on Advances in Number Theory and Dynamical Systems, Bristol, UK, EU. http://hdl.handle.net/20.500.12708/120576 ( reposiTUm)
Drmota, M. (2013). Extremal parameters in sub-critical graph classes,. ANALCO 2013 Meeting on Analytic Algorithmics and Combinatorics, New Orleans, USA, Non-EU. http://hdl.handle.net/20.500.12708/120575 ( reposiTUm)
Drmota, M. (2013). Subsequences of automatic sequences and uniform distribution. Workshop "Uniform Distribution and quasi-Monte-Carlo methods, Linz, Austria, Austria. http://hdl.handle.net/20.500.12708/120577 ( reposiTUm)
Drmota, M. (2013). The Thue-Morse Sequence along the squares is normal. Arbeitsgemeinschaft Diskrete Mathematik, Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/120578 ( reposiTUm)
Drmota, M. (2013). Subsequences and independence of generalized Halton sequences. Workshop “Approximation and numeration,” Paris, France, EU. http://hdl.handle.net/20.500.12708/120579 ( reposiTUm)
Drmota, M. (2013). Shape characteristics of critical and sub-critical graph classes. Combinatorial Probability and Statistical Mechanics Workshop, London, EU. http://hdl.handle.net/20.500.12708/120323 ( reposiTUm)
Drmota, M., & Panagiotou, K. (2012). A central limit theorem for the number of degree-k vertices in Random maps. ANALCO12, Meeting on Analytic Algorithmics and Combinatorics, Kyoto, Japan, Non-EU. http://hdl.handle.net/20.500.12708/120008 ( reposiTUm)
Drmota, M. (2012). Extremal parameters in critical and subcritical graph classes. Université Paris XIII, Paris, France, EU. http://hdl.handle.net/20.500.12708/120225 ( reposiTUm)
Drmota, M. (2012). Extremal parameters in critical and subcritical graph classes. Arbeitsgemeinschaft Diskrete Mathematik, Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/120226 ( reposiTUm)
Drmota, M. (2012). The maximum degree of random planar graphs. University of Ljubljana, Austria. http://hdl.handle.net/20.500.12708/120228 ( reposiTUm)
Drmota, M. (2012). A central limit theorem for the number of degree-k vertices in Random maps. Arbeitsgemeinschaft Diskrete Mathematik, Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/120221 ( reposiTUm)
Drmota, M. (2012). The maximum degree of random planar graphs. Arbeitsgemeinschaft Diskrete Mathematik, Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/120222 ( reposiTUm)
Drmota, M. (2012). Project "Analytic and Probabilistic Methods in Combinatorics. Analytic Combinatorics and Probabilistic Number Theory: Closing Conference of the FWF-Network, TU Wien, Austira, Austria. http://hdl.handle.net/20.500.12708/120224 ( reposiTUm)
Drmota, M. (2012). Extremal parameters in critical and subcritical graph classes. 23rd International Meeting on Probablilistic Combinatorial, and Asymptotiv Methods in the Analysis of Algorithms, AofA2012, Montreal, Canada, Non-EU. http://hdl.handle.net/20.500.12708/119924 ( reposiTUm)
Drmota, M. (2012). The maximum degree of random planar graphs. Alfred Renyi Institute of Mathematics, Hungarian Academy of Sciences, Budapest, Hungary, EU. http://hdl.handle.net/20.500.12708/119925 ( reposiTUm)
Drmota, M. (2011). Optimal and almost optimal variable-to-fixed length codes: renewal theory and divide-and-conquer recurrences. STC-Seminar, Purdue University, Indiana, USA, Non-EU. http://hdl.handle.net/20.500.12708/119992 ( reposiTUm)
Drmota, M. (2011). Universal exponents and tail estimates in the enumeration of planar maps. European Conference on Combinatorics, Graph Theory and Applications, EuroComb’11, Budapest, Hungary, EU. http://hdl.handle.net/20.500.12708/119993 ( reposiTUm)
Drmota, M. (2011). Relations to number theory in Philippe Flajolet’s work. Conference in the memory of Philippe Flajolet, Paris, France, EU. http://hdl.handle.net/20.500.12708/119994 ( reposiTUm)
Drmota, M. (2011). Universal exponents and tail estimates in the enumeration of planar maps. AofA 2011 22th International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms, Bedlewo, Poland, EU. http://hdl.handle.net/20.500.12708/119794 ( reposiTUm)
Drmota, M. (2011). Universal exponents and tail estimates in the enumeration of planar maps. ÖMG-Tagung-CSASC 2011, Krems, Austria. http://hdl.handle.net/20.500.12708/119812 ( reposiTUm)
Drmota, M. (2010). Generalized Thue-Morse sequences of squares and uniform distribution in compact groups. Workshop on Dynamical Systems and Uniform Distribution, TU Graz, Austria, Austria. http://hdl.handle.net/20.500.12708/119571 ( reposiTUm)
Drmota, M. (2010). The sum of digits of primes. Séminar de Théorie des Nombres, Université Bordeaux, Bordeaux, EU. http://hdl.handle.net/20.500.12708/119580 ( reposiTUm)
Drmota, M. (2010). Random planar graphs: combinatorics and asymptotics. Kolloquium des Mathematischen Instituts der Universität Tübingen, Tübingen, Deutschland, EU. http://hdl.handle.net/20.500.12708/119578 ( reposiTUm)
Drmota, M. (2010). An asymptotic analysis of Cuckoo hashing. Universität Bordeaux 1, LFANT-Seminar, Borrdeaux, France, EU. http://hdl.handle.net/20.500.12708/119579 ( reposiTUm)
Drmota, M. (2010). Random planar graphs. Coimbra Meeting on 0-1 Matrix Theory and Related Topics, Coimbra, Portugal, EU. http://hdl.handle.net/20.500.12708/119577 ( reposiTUm)
Drmota, M. (2010). The degree distribution of random planar graphs 2. Workshop: Analytic enumeration methods in combinatorics, probability and number theory, TU Graz, Austria, Austria. http://hdl.handle.net/20.500.12708/119576 ( reposiTUm)
Drmota, M. (2010). The degree distribution of random planar graphs 1. Workshop: Analytic enumeration methods in combinatorics, probability and number theory, TU Graz, Austria, Austria. http://hdl.handle.net/20.500.12708/119575 ( reposiTUm)
Drmota, M. (2010). The binary search trees equation. Workshop on Branching Random Walks and Searching in Trees, Banff, Canada, Non-EU. http://hdl.handle.net/20.500.12708/119573 ( reposiTUm)
Drmota, M. (2010). Sigularities for systems of functional equations. Institut Henri Poincare (ihp), Paris, France, EU. http://hdl.handle.net/20.500.12708/119574 ( reposiTUm)
Drmota, M. (2009). (Un) Expected behaviour of digital search tree profile. ACM-SIAM Symposium on Discrete Algorithms (SODA09), New York, USA, Non-EU. http://hdl.handle.net/20.500.12708/119271 ( reposiTUm)
Drmota, M. (2009). The degree distribution of random planar graphs. One-Day Meeting in Combinatorics, Oxford, GB, EU. http://hdl.handle.net/20.500.12708/119273 ( reposiTUm)
Drmota, M. (2009). The degree distribution of random planar graphs. 24th LL-Seminar on Graph Theory, Montanuniversität Leoben, Austria. http://hdl.handle.net/20.500.12708/119274 ( reposiTUm)
Drmota, M. (2009). Asymptotics on random discrete object 1 -3. 62ème Séminaire Lotharingien de Combinatoire, SLC 62, Heilsbronn, Germany, EU. http://hdl.handle.net/20.500.12708/119272 ( reposiTUm)
Drmota, M. (2009). The maximum degree of series-paralell graphs. Workshop on Random Maps and Graphs on surfaces, Paris, France, EU. http://hdl.handle.net/20.500.12708/119276 ( reposiTUm)
Drmota, M. (2009). The sum of digits of primes. Seminari COMBGRAF, Barcelona, Spain, EU. http://hdl.handle.net/20.500.12708/119275 ( reposiTUm)
Drmota, M. (2009). (Un) Expected behaviour of digital search tree profile. 20th International Conference on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms, A0fA 09, Frejus, France, EU. http://hdl.handle.net/20.500.12708/119257 ( reposiTUm)
Drmota, M. (2009). Embedded trees and the support of the ISE. 20th International Workshop on Combinatorial Algorithms (IWOCA) 2009, Hradec nad Moravicí, Czech Republic, EU. http://hdl.handle.net/20.500.12708/119256 ( reposiTUm)
Drmota, M., Mauduit, C., & Rivat, J. (2009). The sum of digits of primes. 17th ÖMG Congress / Annual DMV Conference, Graz, Austria. http://hdl.handle.net/20.500.12708/119043 ( reposiTUm)
Drmota, M. (2009). Random planar graphs. Theoretical Computer Science - from Foundation to Application, Nis, Serbia, Non-EU. http://hdl.handle.net/20.500.12708/119067 ( reposiTUm)
Drmota, M. (2008). Patterns in random trees. Colloquium for Philippe Flajolet´s 60th Birthday, ENS, Paris, France, EU. http://hdl.handle.net/20.500.12708/118909 ( reposiTUm)
Drmota, M. (2008). Large random planar graphs. CEA-Centre de Saclay, Paris, France, EU. http://hdl.handle.net/20.500.12708/118906 ( reposiTUm)
Drmota, M. (2008). Limiting distributions in combinatorics. Universitat Politècnica de Catalunya, Barcelona, Spain, EU. http://hdl.handle.net/20.500.12708/118903 ( reposiTUm)
Drmota, M. (2008). Local results on the sum-of-digits function of primes and squares. Laboratoire d’Informatique Algorithmique: Fondements et Applications, Paris, France, EU. http://hdl.handle.net/20.500.12708/118905 ( reposiTUm)
Drmota, M. (2008). Recursive Trees (3 Vorträge). Enrage Topical School on Growth and Shapes, Paris, France, EU. http://hdl.handle.net/20.500.12708/118904 ( reposiTUm)
Drmota, M. (2008). The degree distribution of random planar graphs. Scientific Colloquium - 60th birthday of Andrew Frank, TU Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/118908 ( reposiTUm)
Drmota, M. (2008). Generating functions and central limit theorem. Freie Universität Berlin, Berlin, Deutschland, Austria. http://hdl.handle.net/20.500.12708/118907 ( reposiTUm)
Drmota, M. (2008). Digital expansions, prime numbers, and uniform distribution modulo 1. International Conference on Uniform Distribution Theory, Marseille, France, EU. http://hdl.handle.net/20.500.12708/118902 ( reposiTUm)
Drmota, M. (2008). Limiting Distributions in Combinatorics. 2008 International Conference on the Analysis of Algorithms (AofA2008), Maresias, Brazil, Non-EU. http://hdl.handle.net/20.500.12708/118721 ( reposiTUm)
Drmota, M., & Grabner, P. J. (2007). Block additive functions on Gaussian integers. Slovak-Austrian Mathematical Congress 2007, Podbanske, Slovakia, EU. http://hdl.handle.net/20.500.12708/118233 ( reposiTUm)
Drmota, M. (2007). Zufallsbäume und stochastische Prozesse analytischer Funktionen. Math. Kolloquium, Univ. Wien, Wien, Austria. http://hdl.handle.net/20.500.12708/118497 ( reposiTUm)
Drmota, M. (2007). Random trees and stochastic processes of analytic functions. Centre de Recerca Matematica, Barcelona, Spain, EU. http://hdl.handle.net/20.500.12708/118498 ( reposiTUm)
Drmota, M. (2007). Queueing theory without limits: transient and asymptotic analysis. EURANDOM, Eindhoven, Netherlands, EU. http://hdl.handle.net/20.500.12708/118504 ( reposiTUm)
Drmota, M. (2007). Asymptotic methods of enumeration and applications to Markov chain models I + II. EURANDOM, Eindhoven, Netherlands, EU. http://hdl.handle.net/20.500.12708/118503 ( reposiTUm)
Drmota, M. (2007). On the exit time of a random walk with positive drift. AofA07 Conference on Analysis of Algorithms, Juan-les-pins, France, EU. http://hdl.handle.net/20.500.12708/118502 ( reposiTUm)
Drmota, M. (2007). Cuckoo hashing revisited. Universitat Politècnica de Catalunya, Barcelona, Spain, EU. http://hdl.handle.net/20.500.12708/118499 ( reposiTUm)
Drmota, M. (2007). Block additive functions on Gaussian integers. Journées de Numeration, Graz, Austria, Austria. http://hdl.handle.net/20.500.12708/118501 ( reposiTUm)
Drmota, M. (2007). Probabilistische Kombinatorik. Wissenswertes aus der Mathematik, TU Wien, Wien, Austria. http://hdl.handle.net/20.500.12708/118500 ( reposiTUm)
Drmota, M. (2007). Digital expansions, prime numbers, and uniform distribution modulo 1. Technische Universität Graz, Austria. http://hdl.handle.net/20.500.12708/118505 ( reposiTUm)
Drmota, M. (2006). The probabilistic method, random graphs and Stein’s method III. Summer School Probabilistic Methods in Combinatorics, Maria Trost, Austria, Austria. http://hdl.handle.net/20.500.12708/118072 ( reposiTUm)
Drmota, M. (2006). Concentration properties of extremal parameters in random discrete structure. 4th Colloquium on Mathematics and Computer Science, Nancy, France, EU. http://hdl.handle.net/20.500.12708/118074 ( reposiTUm)
Drmota, M. (2006). The probabilistic method, random graphs and Stein’s method IV. Summer School Probabilistic Methods in Combinatorics, Maria Trost, Austria, Austria. http://hdl.handle.net/20.500.12708/118073 ( reposiTUm)
Drmota, M. (2006). Die Mathematik von Quicksort und verwandte Fragestellungen. Zahlentheoretisches Kolloquium, TU Graz, Austria, Austria. http://hdl.handle.net/20.500.12708/118075 ( reposiTUm)
Drmota, M. (2006). Concentration properties of extremal parameters in Random trees. Educational Workshop on Discrete Probability, Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/118065 ( reposiTUm)
Drmota, M. (2006). The sum-of-digits function of Gaussian integers. Universite de Marseille, Luminy, Frankreich, Austria. http://hdl.handle.net/20.500.12708/118067 ( reposiTUm)
Drmota, M. (2006). Die Mathematik von Quicksort und verwandte Fragestellungen. Berufungsvortrag, Vienna, Austria, Austria. http://hdl.handle.net/20.500.12708/118068 ( reposiTUm)
Drmota, M. (2006). The height of increasing trees. German Open Conference on Probability, Frankfurt, Germany, EU. http://hdl.handle.net/20.500.12708/118066 ( reposiTUm)
Drmota, M. (2006). The probabilistic method, random graphs and Stein’s method II. Summer School Probabilistic Methods in Combinatorics, Maria Trost, Austria, Austria. http://hdl.handle.net/20.500.12708/118071 ( reposiTUm)
Drmota, M. (2006). The probabilistic method, random graphs and Stein’s method I. Summer School Probabilistic Methods in Combinatorics, Maria Trost, Austria, Austria. http://hdl.handle.net/20.500.12708/118070 ( reposiTUm)
Drmota, M. (2006). Cuckoo hashing revisited. 12th Seminar on the Analysis of Algorithms, Alden Biesen, Belgien, EU. http://hdl.handle.net/20.500.12708/118069 ( reposiTUm)
Drmota, M. (2005). The shape of random trees. Steklov Institut, Moskau, Russia, Non-EU. http://hdl.handle.net/20.500.12708/117670 ( reposiTUm)
Drmota, M. (2005). Increasing tree families complex networks and random graphs. Physikzentrum Bad Honnef, Bad Honnef, Germany, EU. http://hdl.handle.net/20.500.12708/117669 ( reposiTUm)
Drmota, M. (2005). Travelling waves and the distribution of the height of binary search trees. 16.Int.Kongress ÖMG-DMV, Klagenfurt, Klagenfurt, Austria. http://hdl.handle.net/20.500.12708/117671 ( reposiTUm)
Drmota, M. (2005). Die Höhe von rekursiven Bäumen. Kolloquium aus Diskreter Mathematik, Technische Univ. Graz, Graz, Austria, Austria. http://hdl.handle.net/20.500.12708/117672 ( reposiTUm)
Drmota, M. (2005). The width of binary search trees. Purdue University, Indiana, USA, Indiana, USA, Austria. http://hdl.handle.net/20.500.12708/117668 ( reposiTUm)
Drmota, M. (2004). Combinatorics and asymptotics on trees 2. University of the Witwatersrand, Johannesburg, Republic of South Africa, Austria. http://hdl.handle.net/20.500.12708/117374 ( reposiTUm)
Drmota, M. (2004). Digital Expansions and uniformly distributed sequences Modulo 1. Discrepancy Theory and Applications, Oberwolfach, Germany, Austria. http://hdl.handle.net/20.500.12708/117290 ( reposiTUm)
Drmota, M. (2004). Applications of number theoretic methods in coding theory. General Theory of Information Transfer and Combinatorics, Bielefeld, BRD, Austria. http://hdl.handle.net/20.500.12708/117291 ( reposiTUm)
Drmota, M. (2004). The Profile and height of log n-trees. 10th Seminar on Analysis of Algorithms, Berkeley, USA, Austria. http://hdl.handle.net/20.500.12708/117293 ( reposiTUm)
Drmota, M. (2004). Statistical properties of number systems. RICAM, Linz, Linz, Österreich, Austria. http://hdl.handle.net/20.500.12708/117292 ( reposiTUm)
Drmota, M. (2004). Combinatorics and asymptotics on trees 1. University of the Witwatersrand, Johannesburg, Republic of South Africa, Austria. http://hdl.handle.net/20.500.12708/117295 ( reposiTUm)
Drmota, M. (2004). The height of increasing trees. Universität Frankfurt, BRD, Frankfurt BRD, Austria. http://hdl.handle.net/20.500.12708/117294 ( reposiTUm)
Drmota, M. (2004). Connections between number theory and Aariable-to-variable coding. Purdue University, Indiana, USA, Indiana, USA, Austria. http://hdl.handle.net/20.500.12708/117284 ( reposiTUm)
Drmota, M. (2004). Combinatorics and asymptotics on trees 4. University of the Witwatersrand, Johannesburg, Republic of South Africa, Austria. http://hdl.handle.net/20.500.12708/117376 ( reposiTUm)
Drmota, M. (2004). Combinatorics and asymptotics on trees 3. University of the Witwatersrand, Johannesburg, Republic of South Africa, Austria. http://hdl.handle.net/20.500.12708/117375 ( reposiTUm)
Drmota, M. (2003). The joint distribution of $Q$-additive functions on polynomials over finite fields. XXIIIrd Journees Arithmetiques, Graz, Austria. http://hdl.handle.net/20.500.12708/116613 ( reposiTUm)
Drmota, M. (2003). Problems and Results on the Sum-of-Digits Functions. Universite de Marseille, Luminy, Frankreich, Austria. http://hdl.handle.net/20.500.12708/116614 ( reposiTUm)
Drmota, M. (2003). The Sum-of-Digits Function of Squares. Theory of Numbers and Probability, CIRM, Marseilles Luminy, Frankreich, Austria. http://hdl.handle.net/20.500.12708/116635 ( reposiTUm)
Drmota, M. (2003). Die Lösung von 2 Vermutungen über Zufallsbäume. Math. Kolloquium, Univ. Wien, Wien, Austria. http://hdl.handle.net/20.500.12708/116611 ( reposiTUm)
Drmota, M. (2003). Solution of Kesten’s Conjecture on the Height of Digital Search Trees. 9th Seminar on Analysis of Algorithms, San Miniato, Italy, Austria. http://hdl.handle.net/20.500.12708/116612 ( reposiTUm)
Drmota, M. (2003). Die Verteilung der Höhe von binären Suchbäumen und verwandte Fragestellungen. Universität Kiel, Kiel, BRD, Austria. http://hdl.handle.net/20.500.12708/116610 ( reposiTUm)
Drmota, M. (2003). The Height of Digital Search Trees. ÖMG Tagung, Bozen, Austria. http://hdl.handle.net/20.500.12708/116615 ( reposiTUm)
Drmota, M. (2002). Stohastic Analysis of Tree-Like Data Structures. NancyProb@2002, Nancy, Frankreich, Austria. http://hdl.handle.net/20.500.12708/116044 ( reposiTUm)
Drmota, M. (2002). The height of random binary search trees and related questions. International Statistical Symposium and Bernoulli Society EAPR Conference, Taipei, Taiwan, Austria. http://hdl.handle.net/20.500.12708/116041 ( reposiTUm)
Drmota, M. (2002). The Random Bisection Problem and the Distribution of the Height of Binary Search Trees. Eight Seminar on Analysis of Algorithm, Strobl, Strobl, Österreich, Austria. http://hdl.handle.net/20.500.12708/116040 ( reposiTUm)
Drmota, M. (2002). Stohastic Analysis of Tree-Like Data Structures. Second Colloquium on Mathematics and Computer Science, Versailles, France, Austria. http://hdl.handle.net/20.500.12708/116042 ( reposiTUm)
Drmota, M. (2002). The joint distribution of digital expansions with respect to different bases. Universität Nancy, Nancy, Frankreich, Austria. http://hdl.handle.net/20.500.12708/116043 ( reposiTUm)

Preprints

Adamczewski, B., Drmota, M., & Müllner, C. (2020). (Logarithmic) densities for automatic sequences along primes and squares. arXiv. https://doi.org/10.48550/arXiv.2009.14773 ( reposiTUm)