Kuba, M., & Panholzer, A. (2024). On card guessing games: Limit law for no feedback one-time riffle shuffle. Advances in Applied Mathematics, 156, Article 102689. https://doi.org/10.1016/j.aam.2024.102689 ( reposiTUm)

Kuba, M., & Panholzer, A. (2024). On card guessing with two types of cards. Journal of Statistical Planning and Inference, 232, Article 106160. https://doi.org/10.1016/j.jspi.2024.106160 ( reposiTUm)

Kuba, M., & Panholzer, A. (2023). Tree evolution processes for bucket increasing trees. Discrete Mathematics, 346(7), Article 113443. https://doi.org/10.1016/j.disc.2023.113443 ( reposiTUm)

Kuba, M., & Panholzer, A. (2022). On bucket increasing trees, clustered increasing trees and increasing diamonds. Combinatorics, Probability and Computing, 31(4), 629–661. https://doi.org/10.1017/S0963548321000493 ( reposiTUm)

Panholzer, A., & Kuba, M. (2019). Stirling permutations containing a single pattern of length three. Australasian Journal of Combinatorics, 74, 215–239. http://hdl.handle.net/20.500.12708/143715 ( reposiTUm)

Kuba, M., & Panholzer, A. (2019). A note on harmonic number identities, Stirling series and multiple zeta values. International Journal of Number Theory, 15(07), 1323–1348. https://doi.org/10.1142/s179304211950074x ( reposiTUm)

Kuba, M., & Panholzer, A. (2018). Combinatorial Analysis of Growth Models for Series-Parallel Networks. Combinatorics, Probability and Computing, 28(4), 574–599. https://doi.org/10.1017/S096354831800038X ( reposiTUm)

Kuba, M., & Panholzer, A. (2016). On Moment Sequences and Mixed Poisson Distributions. Probability Surveys, 13(none). https://doi.org/10.1214/14-ps244 ( reposiTUm)

Kuba, M., & Panholzer, A. (2016). Combinatorial families of multilabelled increasing trees and hook-length formulas. Discrete Mathematics, 339(1), 227–254. https://doi.org/10.1016/j.disc.2015.08.010 ( reposiTUm)

Kuba, M., & Panholzer, A. (2014). Multiple isolation of nodes in recursive trees. Online Journal of Analytic Combinatorics, 9. http://hdl.handle.net/20.500.12708/157308 ( reposiTUm)

Kuba, M., Mahmoud, H., & Panholzer, A. (2013). Analysis of a generalized Friedman’s urn with multiple drawings. Discrete Applied Mathematics, 161(18), 2968–2984. https://doi.org/10.1016/j.dam.2013.06.022 ( reposiTUm)

Kuba, M., & Panholzer, A. (2013). A unifying approach for proving Hook-Length formulas for weighted tree families. Graphs and Combinatorics, 29(6), 1839–1865. https://doi.org/10.1007/s00373-012-1217-4 ( reposiTUm)

Kuba, M., & Panholzer, A. (2012). Limiting distributions for a class of diminishing urn models. Advances in Applied Probability, 44(1), 87–116. https://doi.org/10.1239/aap/1331216646 ( reposiTUm)

Kuba, M., & Panholzer, A. (2012). Enumeration formulae for pattern restricted Stirling permutations. APPLICABLE ANALYSIS AND DISCRETE MATHEMATICS, 312(21), 3179–3194. http://hdl.handle.net/20.500.12708/164003 ( reposiTUm)

Kuba, M., & Panholzer, A. (2012). Bilabelled increasing trees and hook-length formulae. European Journal of Combinatorics, 33(2), 248–258. http://hdl.handle.net/20.500.12708/164004 ( reposiTUm)

KUBA, M., & PANHOLZER, A. (2011). Analysis of statistics for generalized Stirling permutations. Combinatorics, Probability and Computing, 20(6), 875–910. https://doi.org/10.1017/s0963548311000381 ( reposiTUm)

Janson, S., Kuba, M., & Panholzer, A. (2011). Generalized Stirling permutations, families of increasing trees and urn models. Journal of Combinatorial Theory, Series A, 118(1), 94–114. https://doi.org/10.1016/j.jcta.2009.11.006 ( reposiTUm)

Kuba, M., & Panholzer, A. (2010). On the distribution of distances between specified nodes in increasing trees. Discrete Applied Mathematics, 158(5), 489–506. https://doi.org/10.1016/j.dam.2009.10.014 ( reposiTUm)

Kuba, M., & Panholzer, A. (2010). On the area under lattice paths associated with triangular diminishing urn models. Advances in Applied Mathematics, 44(4), 329–358. https://doi.org/10.1016/j.aam.2009.09.001 ( reposiTUm)

Kuba, M., & Panholzer, A. (2010). Enumeration results for alternating tree families. European Journal of Combinatorics, 31(7), 1751–1780. https://doi.org/10.1016/j.ejc.2010.03.001 ( reposiTUm)

Kuba, M., & Panholzer, A. (2010). A combinatorial approach to the analysis of bucket recursive trees. Theoretical Computer Science, 411, 3255–3273. http://hdl.handle.net/20.500.12708/167413 ( reposiTUm)

Kuba, M., Panholzer, A., & Prodinger, H. (2009). Lattice paths, smpling without replacement, and the kernel method. Electronic Journal of Combinatorics, 16(1), 12. http://hdl.handle.net/20.500.12708/166373 ( reposiTUm)

Banderier, C., Kuba, M., & Panholzer, A. (2009). Analysis of three graph parameters for random trees. Random Structures and Algorithms, 35(1), 42–69. https://doi.org/10.1002/rsa.20259 ( reposiTUm)

Kuba, M., & Panholzer, A. (2009). A combinatorical approach for analyzing the number of descendant in increasing trees and related parameters. Quaestiones Mathematicae, 32, 91–114. http://hdl.handle.net/20.500.12708/166374 ( reposiTUm)

Kuba, M., & Panholzer, A. (2008). Isolating nodes in recursive trees. Aequationes Mathematicae, 76(3), 258–280. https://doi.org/10.1007/s00010-008-2929-7 ( reposiTUm)

Kuba, M., Prodinger, H., & Schneider, C. (2008). Generalized reciprocity laws for sums of harmonic numbers. Integers: Electronic Journal of Combinatorial Number Theory, 8(1). http://hdl.handle.net/20.500.12708/170407 ( reposiTUm)

Kuba, M., & Panholzer, A. (2008). Isolating a leaf in rooted trees via random cuttings. Annals of Combinatorics, 12(1), 81–99. http://hdl.handle.net/20.500.12708/170409 ( reposiTUm)

Kuba, M. (2008). On evaluations of infinite double sums and Tornheim’s double series. Séminaire Lotharingien de Combinatoire, 58. http://hdl.handle.net/20.500.12708/170408 ( reposiTUm)

Kuba, M., & Panholzer, A. (2008). On edge-weighted recursive trees and inversions in random permutations. Discrete Mathematics, 308(4), 529–540. https://doi.org/10.1016/j.disc.2007.03.032 ( reposiTUm)

Kuba, M., & Panholzer, A. (2007). On the degree distribution of the nodes in increasing trees. Journal of Combinatorial Theory, Series A, 114, 597–618. http://hdl.handle.net/20.500.12708/168727 ( reposiTUm)

Kuba, M., & Panholzer, A. (2007). On weighted path lengths and distances in increasing trees. Probability in the Engineering and Informational Sciences, 21(03), 419–433. http://hdl.handle.net/20.500.12708/168731 ( reposiTUm)

Kuba, M., & Panholzer, A. (2007). The left-right-imbalance of binary search trees. Theoretical Computer Science, 370, 265–278. http://hdl.handle.net/20.500.12708/168732 ( reposiTUm)

Kuba, M., & Wagner, S. (2007). Perfect matchings and k-decomposability of increasing trees. Séminaire Lotharingien de Combinatoire, 57(Article B57a), 1–14. http://hdl.handle.net/20.500.12708/168734 ( reposiTUm)

Kuba, M. (2006). On Quickselect, partial sorting and Multiple Quickselect. Information Processing Letters, 99, 181–186. http://hdl.handle.net/20.500.12708/172103 ( reposiTUm)

Kuba, M., & Panholzer, A. (2006). Descendants in increasing trees. Electronic Journal of Combinatorics, 13, 1–14. http://hdl.handle.net/20.500.12708/172025 ( reposiTUm)

Panholzer, A., & Kuba, M. (2016). Combinatorial Analysis of Growth Models for Series-Parallel Networks. In Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Krakow, Polen, 4-8. Juli 2016. 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Krakow, Polen, 4-8. Juli 2016, Krakau, Poland. http://hdl.handle.net/20.500.12708/41494 ( reposiTUm)

Kuba, M., & Panholzer, A. (2012). On death processes and urn models. In 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA’12) (pp. 29–42). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/41155 ( reposiTUm)

Kuba, M., & Panholzer, A. (2008). Enumerating alternating tree families. In 20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008 (pp. 105–116). LORIA. http://hdl.handle.net/20.500.12708/40880 ( reposiTUm)

Kuba, M., & Panholzer, A. (2007). Analysis of the total costs for variants of the Union-Find algorithm. In Proceedings of AofA 2007 (pp. 259–268). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/40788 ( reposiTUm)

Kuba, M., & Panholzer, A. (2007). Limit laws for a class of diminishing urn models. In 2007 Conference on Analysis of Algorithms, AofA07 (pp. 341–352). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/40806 ( reposiTUm)

Kuba, M., & Panholzer, A. (2007). Analysis of insertion costs in priority trees. In Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (pp. 175–182). SIAM. http://hdl.handle.net/20.500.12708/41815 ( reposiTUm)

Hwang, H.-K., Kuba, M., & Panholzer, A. (2007). Analysis of some exactly solvable diminishing urn models. In The 19th International Conference on Formal Power Series and Algebraic Combinatorics (p. 12). Nankai University, Tianjin, China. http://hdl.handle.net/20.500.12708/40713 ( reposiTUm)

Kuba, M., & Panholzer, A. (2006). Analysis of label-based prarameters in increasing trees. In Fourth Colloquium on Mathematics and Computer Science (pp. 321–330). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/40631 ( reposiTUm)

De Panafieu, E., Gardy, D., Gittenberger, B., & Kuba, M. (2014). Probabilities of 2-XOR functions. In A. Pardo & A. Viola (Eds.), LATIN 2014: Theoretical Informatics (pp. 454–465). Springer Verlag Berlin-Heidelberg. https://doi.org/10.1007/978-3-642-54423-1_40 ( reposiTUm)

Banderier, C., Kuba, M., & Wallner, M. (2023, June 26). Phase transitions of composition schemes: Mittag-Leffler and mixed Poisson distributions [Conference Presentation]. The 34th International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms 2023, Taipei, Taiwan (Province of China). http://hdl.handle.net/20.500.12708/191568 ( reposiTUm)

Kuba, M. (2008). Area under lattice paths associated with certain urn models. 2008 International Conference on the Analysis of Algorithms (AofA2008), Maresias, Brazil, Non-EU. http://hdl.handle.net/20.500.12708/118937 ( reposiTUm)

Kuba, M. (2007). Analysis of exactly solvable diminishing urn models. Slovak-Austrian Mathematical Congress 2007, Podbanske, Slovakia, EU. http://hdl.handle.net/20.500.12708/118235 ( reposiTUm)

Kuba, M. (2007). Limit laws for a class of diminishing urn models. AofA07 Conference on Analysis of Algorithms, Juan-les-pins, France, EU. http://hdl.handle.net/20.500.12708/118238 ( reposiTUm)

Kuba, M. (2007). On selection, partial sorting and quicksort. 1st Canadian Discrete and Algorithmic Mathematics Conference, Banff, Canada, Non-EU. http://hdl.handle.net/20.500.12708/118237 ( reposiTUm)

Kuba, M. (2007). Analysis of exactly solvable diminishing urn models. Academia Sinica Taipeh, Taipeh, Taiwan, Austria. http://hdl.handle.net/20.500.12708/118240 ( reposiTUm)

Kuba, M. (2007). Diminishing Pólya-Eggenberger urn models. Arbeitsgemeinschaft Diskrete Mathematik, Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/118239 ( reposiTUm)

Kuba, M. (2006). Analysis of label-based paramters in increasing trees. 4th Colloquium on Mathematics and Computer Science, Nancy, France, EU. http://hdl.handle.net/20.500.12708/118081 ( reposiTUm)

Kuba, M. (2006). Edge weights in recursive trees and inversions in permutations. Workshop on Probabilistic Methods in Combinatorics, Maria Trost, Austria, Austria. http://hdl.handle.net/20.500.12708/118080 ( reposiTUm)

Kuba, M. (2005). Knotenisolierung in rekursiven Bäumen. 16.Int.Kongress ÖMG-DMV, Klagenfurt, Klagenfurt, Austria. http://hdl.handle.net/20.500.12708/117638 ( reposiTUm)

Kuba, M. (2005). Isolation nodes in recursive trees. 12th Internationa Conference on Random Structures and Algorithms, Poznan, Poland, EU. http://hdl.handle.net/20.500.12708/117637 ( reposiTUm)

Kuba, M. (2005). Isolation nodes in recursive trees. University of Stellenbosch, South Africa, Non-EU. http://hdl.handle.net/20.500.12708/117736 ( reposiTUm)

Kuba, M. (2012). Urn models and tree families [Professorial Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/159189 ( reposiTUm)

Kuba, M. (2006). Analysis of node isolation procedures and label-based parameters in tree structures [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-20973 ( reposiTUm)

Kuba, M. (2004). Multiple Quickselect und die Steiner-Distanz in binären Suchbäumen [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/177984 ( reposiTUm)