Markus Kuba

Orcid: 0000-0001-7188-6601

According to our database1, Markus Kuba authored at least 36 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On card guessing games: Limit law for no feedback one-time riffle shuffle.
Adv. Appl. Math., 2024

2023
Tree evolution processes for bucket increasing trees.
Discret. Math., July, 2023

2022
On bucket increasing trees, clustered increasing trees and increasing diamonds.
Comb. Probab. Comput., 2022

On Multisets, Interpolated Multiple Zeta Values and Limit Laws.
Electron. J. Comb., 2022

2019
Combinatorial Analysis of Growth Models for Series-Parallel Networks.
Comb. Probab. Comput., 2019

Stirling permutations containing a single pattern of length three.
Australas. J Comb., 2019

2018
Connection of the SUMO Microscopic Traffic Simulator and the Unity 3D Game Engine to Evaluate V2X Communication-Based Systems.
Sensors, 2018

2017
On martingale tail sums in affine two-color urn models with multiple drawings.
J. Appl. Probab., 2017

Two-color balanced affine urn models with multiple drawings.
Adv. Appl. Math., 2017

2016
Combinatorial families of multilabelled increasing trees and hook-length formulas.
Discret. Math., 2016

2-Xor Revisited: Satisfiability and Probabilities of Functions.
Algorithmica, 2016

2014
Probabilities of 2-Xor Functions.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2013
On Generalized Pólya Urn Models.
J. Appl. Probab., 2013

A Unifying Approach for Proving Hook-Length Formulas for Weighted Tree Families.
Graphs Comb., 2013

Analysis of a generalized Friedman's urn with multiple drawings.
Discret. Appl. Math., 2013

2012
Generating Functions of Embedded Trees and Lattice Paths.
Fundam. Informaticae, 2012

Bilabelled increasing trees and hook-length formulae.
Eur. J. Comb., 2012

Enumeration formulæ for pattern restricted Stirling permutations.
Discret. Math., 2012

2011
Generalized Stirling permutations, families of increasing trees and urn models.
J. Comb. Theory, Ser. A, 2011

Analysis of Statistics for Generalized Stirling Permutations.
Comb. Probab. Comput., 2011

A Note on Naturally Embedded Ternary Trees.
Electron. J. Comb., 2011

2010
A combinatorial approach to the analysis of bucket recursive trees.
Theor. Comput. Sci., 2010

A Note on Stirling Series.
Integers, 2010

Enumeration results for alternating tree families.
Eur. J. Comb., 2010

On the distribution of distances between specified nodes in increasing trees.
Discret. Appl. Math., 2010

Deterministic Edge Weights in Increasing Tree Families.
Comb. Probab. Comput., 2010

On the Distribution of Depths in Increasing Trees.
Electron. J. Comb., 2010

On the area under lattice paths associated with triangular diminishing urn models.
Adv. Appl. Math., 2010

2009
Analysis of three graph parameters for random trees.
Random Struct. Algorithms, 2009

Lattice Paths, Sampling Without Replacement, and Limiting Distributions.
Electron. J. Comb., 2009

2008
On edge-weighted recursive trees and inversions in random permutations.
Discret. Math., 2008

2007
The left-right-imbalance of binary search trees.
Theor. Comput. Sci., 2007

On the degree distribution of the nodes in increasing trees.
J. Comb. Theory, Ser. A, 2007

Analysis of Insertion Costs in Priority Trees.
Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics, 2007

2006
On Quickselect, partial sorting and Multiple Quickselect.
Inf. Process. Lett., 2006

Descendants in Increasing Trees.
Electron. J. Comb., 2006


  Loading...