Institute for Discrete mathematics and Geometry
TU-WIEN, 1040 Vienna
Austria
• Email: kuba@dmg.tuwien.ac.at
[W1] Institute of Applied Mathematics and Natural Sciences
FH-Technikum Wien, 1200 Vienna, Austria
• Email: kuba@technikum-wien.at
[W2] HTL-Spengergasse, 1050 Vienna, Austria
Below you find my papers and preprints.
Markus Kuba and Alois Panholzer. Descendants in increasing trees
Electronic journal of combinatorics, Volume 13, paper R8, 2006.
pdf.
Markus Kuba. On Quickselect, partial sorting and Multiple Quickselect
Information Processing Letters, Volume 99, Issue 5, 2006.
Availaible at IPL,
Errata
pdf, Preprint:
pdf
Markus Kuba and Alois Panholzer. Analysis of label-based parameters in increasing trees.
pdf.
Markus Kuba and Alois Panholzer. The left-right-imbalance of binary search trees.
Theoretical Computer Science, 370:265--278, 2007.
pdf.
Markus Kuba and Alois Panholzer. Analysis of insertion costs in priority trees,
Proceedings of the ANALCO, 2007.
pdf.
Markus Kuba and Alois Panholzer. On the degree
distribution of the nodes in increasing trees
Journal of Combinatorial Theory, Series A, Volume 114, Issue 4, Pages 597-618, 2007.
pdf.
Markus Kuba and Alois Panholzer. Analysis of the total costs for
variants of the Union-Find algorithm.
Discrete Mathematics and Theoretical Computer Science, Proceedings AG, 257--266, 2007.
Availaible at DMTCS-dmAH0119.
Markus Kuba and Alois Panholzer. imit laws for a class of diminishing urn
models.
Discrete Mathematics and Theoretical Computer Science,
339--349, 2007.
Availaible at
DMTCS-dmAH0126.
Hsien-Kuei Hwang, Markus Kuba and Alois Panholzer. Analysis of some exactly solvable diminishing urn models.
Proceedings of the 19th International Conference on
Formal Power Series and Algebraic Combinatorics, 2007.
pdf
Markus Kuba and Alois Panholzer. On weighted path lengths and distances in increasing trees.
Probability in the Engineering and Informational Sciences, 21:419--433, 2007.
pdf
Markus Kuba and Stephan Wagner. Perfect matchings and k-decomposability of increasing trees.
Séminaire Lotharingien de Combinatoire, vol. 57., 2007
pdf
Markus Kuba and Alois Panholzer. On edge-weighted recursive trees and inversions in random
permutations.
Discrete Mathematics, Volume 308, Issue 4, 529-540, 2008.
pdf
Markus Kuba, Helmut Prodinger, and Carsten Schneider. Generalized reciprocity laws for sums of harmonic numbers.
Integers - Electronic journal of Combinatorial number theory, 8, A17, 2008.
pdf
Markus Kuba. On evaluations of infinite double sums and Tornheim's double series.
Séminaire Lotharingien de Combinatoire, vol. 58, 2008.
Availaible at
SLC.
Markus Kuba and Alois Panholzer. Isolating a leaf in rooted trees via random cuttings.
Annals of Combinatorics 12, 81-99, 2008.
pdf
Markus Kuba and Alois Panholzer. Isolating nodes in recursive trees.
Aequationes Mathematicae, 76:258--280, 2008.
pdf.
Markus Kuba and Alois Panholzer. Enumerating alternating tree families (extended abstract).
Discrete Mathematics and Theoretical Computer Science, Proceedings of FPSAC 2008, AJ, 105–-116, 2008.
Availaible at
DMTCS-dmAJ0110
Markus Kuba and Alois Panholzer. A combinatorial approach for analyzing the number of descendants in increasing trees and related parameters.
Quaestiones Mathematicae, 32 (1), 91–-114, 2009.
pdf.
Markus Kuba, Alois Panholzer and Helmut Prodinger. Lattice paths, sampling without replacement, and limiting distributions.
Electronic Journal of Combinatorics, Volume 16 (1), paper R67, 2009.
pdf.
Cyril Banderier, Markus Kuba and Alois Panholzer. Analysis of three graph parameters for random trees.
Random Structures and Algorithms. Volume 35, Issue 1, p. 42-69, 2009.
pdf
Markus Kuba and Anna Varvak. On Path diagrams and Stirling permutations.
Manuscript, 2009.
Old version (single author): pdf,
ArXiv:0906.1672 [math.CO],
New version: pdf.
Markus Kuba and Stephan Wagner. Deterministic edge-weights in increasing tree families.
Combinatorics, Probability and Computing. Volume 19, issue 01, pp. 99-119, 2010.
pdf.
Markus Kuba and Alois Panholzer. On the area under lattice paths associated with triangular diminishing urn models,
Advances in Applied Mathematics.
Volume 44, Issue 4, Pages 329-358, 2010.
pdf.
Markus Kuba and Helmut Prodinger. On a reciprocity law for finite multiple zeta values.
International Journal of Combinatorics. Article ID 153621, 13 pages, 2010.
pdf. Also availaible at
ArXiv:0905.0350 [math.CO]
Markus Kuba and Alois Panholzer. On the distribution
of distances between specified nodes in increasing trees
Discrete Applied Mathematics. Volume 158, Issue 5, 489-506, 2010.
pdf.
Markus Kuba. On functions of Arakawa and Kaneko and Multiple zeta functions.
Applicable Analysis and Discrete Mathematics. Volume 4, 45-53, 2010.
pdf. Also availaible at
ArXiv:0903.4552 [math.NT]
Markus Kuba and Alois Panholzer. Enumeration results for alternating tree families,
European Journal of Combinatorics, Volume 31, Issue 7, 1751-1780, 2010.
pdf.
Markus Kuba and Helmut Prodinger. A note on Stirling series.
Integers - Electronic journal of Combinatorial number theory,
A34, 393-406, 2010.
pdf.
Markus Kuba and Alois Panholzer. A combinatorial approach to the analysis of bucket recursive trees and variants.
Theoretical Computer Science. Volume 411, Issues 34-36, 3255--3273, 2010.
pdf
Stephan Wagner and Markus Kuba. On the distribution of depths in increasing trees.
Electronic Journal of Combinatorics, Volume 17, paper R137, 2010.
pdf.
Markus Kuba. On Sampling without replacement and OK-Corral urn models.
Manuscript, 2010.
pdf. Also availaible at
ArXiv:1003.1603 [math.CO]
Svante Janson, Markus Kuba and Alois Panholzer. Generalized Stirling permutations, families of increasing trees and urn models.
Journal of Combinatorial Theory Series A, Volume 118, 94-114, 2011.
pdf.
Also availaible at
ArXiv:0805.4084 [math.CO].
Markus Kuba. A note on naturally embedded ternary trees.
Electronic Journal of Combinatorics, Volume 18 (1), paper P142, 2011.
pdf.
Also availaible at
ArXiv:0902.2646 [math.CO].
Markus Kuba. Diminishing urn models: Analysis of a class of Cannibal urns.
Electronic Notes in Probability. Vol. 16, pages 583-599, 2011
pdf.
Markus Kuba and Alois Panholzer. Analysis of Statistics for generalized Stirling permutations.
Combinatorics, Probability and Computing 20, 875–910, 2011.
pdf.
Markus Kuba and Alois Panholzer. Bilabelled increasing trees and hook-length formulas.
European Journal of Combinatorics 33, 248–258, 2012.
pdf
Markus Kuba and Alois Panholzer. Limiting distributions for a class of diminishing urn models,
Advances in Applied Probability, 44, 1-31, 2012.
pdf.
Markus Kuba. On embedded trees and lattice paths.
Fundamenta Informaticae, 116, 1-13, 2012.
Extended preprint: pdf. Also availaible at
ArXiv:0906.0450 [math.CO]
Markus Kuba and Alois Panholzer. On death processes and urn models.
Accepted for publication in the DMTCS Proceedings series AofA 2012 and presentation.
pdf.
Also availaible at
ArXiv:1110.2425 [math.PR]
Markus Kuba and Alois Panholzer. A unifying approach for proving hook-length formulas for weighted tree families.
Tentatively accepted for publication in Graphs and Combinatorics.
pdf
Markus Kuba and Alois Panholzer. Enumeration formulae for pattern restricted Stirling permutations.
Tentatively accepted for publication in Discrete Mathematics
pdf
May-Ru Chen and Markus Kuba. On generalized Polya urn models.
2011, submitted.
pdf.
Also availaible at the ArXiv.
ArXiv:1106.4325 [math.PR]
Markus Kuba, Hosam Mahmoud and Alois Panholzer. Analysis of a generalized Friedman's urn with multiple drawings.
2011, submitted.
pdf.
Multiple Quickselect und die Steinerdistanz in binären Suchbäumen
Master Thesis, written under the supervision of Alois Panholzer, Vienna University of Technology, 2004.
Analysis of node isolation procedure and label-based
parameters in tree structures
Ph. D. Thesis, written under the supervision of Alois Panholzer, Vienna University of Technology, 2006.
|
Disclaimer: All items are copyrighted either by the author or the publisher. The files availaible on this website are preprints. For published papers, use the corresponding publications for the final version. The copyright for published papers is owned by the publishers. |