Markus Kuba

dblp:01/2472 · DBLP profile ↗
← Back
10ranked-venue papers
6as first author
2since 2021 · last 2026
0000-0001-7188-6601ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 10 · 6 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author
YearPublicationVenuePosition
2026 Gibbs Partitions and Lattice Paths
abstract
This work is devoted to the analysis of a Gibbs partition model, also known as a composition scheme. We consider a natural new condition on the component weights. It leads to a new behavior for the total number of components. We discover a condensation phenomenon, producing a unique giant component comprising almost the entire mass. Additionally, we prove a point process limit describing the asymptotic size of the non-maximal components exhibiting a sublinear power-law growth. A particular motivation for our article stems from applications, ranging from simple random walks in the cube, over lattice paths models in the plane, pairs of directed random walks, over to urn models and card guessing games.
Niccolò Bosio, Markus Kuba, Benedikt Stufler
AofA2
2024 Composition Schemes: q-Enumerations and Phase Transitions in Gibbs Models
abstract
Composition schemes are ubiquitous in combinatorics, statistical mechanics and probability theory. We give a unifying explanation to various phenomena observed in the combinatorial and statistical physics literature in the context of~$q$-enumeration (this is a model where objects with a parameter of value $k$ have a Gibbs measure/Boltzmann weight $q^k$). For structures enumerated by a composition scheme, we prove a phase transition for any parameter having such a Gibbs measure: for a critical value $q=q_c$, the limit law of the parameter is a two-parameter Mittag-Leffler distribution, while it is Gaussian in the supercritical regime ($q>q_c$), and it is a Boltzmann distribution in the subcritical regime ($0
Cyril Banderier, Markus Kuba, Stephan G. Wagner, Michael Wallner 0001
AofA2
2016 2-Xor Revisited: Satisfiability and Probabilities of Functions
Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Markus Kuba
Algorithmica4
2014 Probabilities of 2-Xor Functions
Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Markus Kuba
LATIN4
2013 Analysis of a generalized Friedman's urn with multiple drawings
Markus Kuba, Hosam M. Mahmoud, Alois Panholzer
Discret. Appl. Math.1
2012 Generating Functions of Embedded Trees and Lattice Paths
abstract
Bouttier, Di Francesco and Guitter introduced a method for solving certain classes of algebraic recurrence relations arising the context of maps and embedded trees. The aim of this note is to apply their method, consisting of a suitable ansatz and (c
Markus Kuba
Fundam. Informaticae1
2010 On the distribution of distances between specified nodes in increasing trees
Markus Kuba, Alois Panholzer
Discret. Appl. Math.1
2010 A combinatorial approach to the analysis of bucket recursive trees
Markus Kuba, Alois Panholzer
Theor. Comput. Sci.1
2007 The left-right-imbalance of binary search trees
Markus Kuba, Alois Panholzer
Theor. Comput. Sci.1
2006 On Quickselect, partial sorting and Multiple Quickselect
Markus Kuba
Inf. Process. Lett.1