default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarkus Kuba
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j34]Markus Kuba
, Alois Panholzer:
On card guessing games: Limit law for no feedback one-time riffle shuffle. Adv. Appl. Math. 156: 102689 (2024)- [c3]Cyril Banderier, Markus Kuba, Stephan Wagner, Michael Wallner:
Composition Schemes: q-Enumerations and Phase Transitions in Gibbs Models. AofA 2024: 7:1-7:18 - 2023
- [j33]Markus Kuba, Alois Panholzer:
Tree evolution processes for bucket increasing trees. Discret. Math. 346(7): 113443 (2023) - 2022
- [j32]Markus Kuba:
On Multisets, Interpolated Multiple Zeta Values and Limit Laws. Electron. J. Comb. 29(1) (2022) - [j31]Markus Kuba, Alois Panholzer:
On bucket increasing trees, clustered increasing trees and increasing diamonds. Comb. Probab. Comput. 31(4): 629-661 (2022)
2010 – 2019
- 2019
- [j30]Markus Kuba, Alois Panholzer:
Stirling permutations containing a single pattern of length three. Australas. J Comb. 74: 216-239 (2019) - [j29]Markus Kuba, Alois Panholzer:
Combinatorial Analysis of Growth Models for Series-Parallel Networks. Comb. Probab. Comput. 28(4): 574-599 (2019) - 2018
- [j28]Cristina Olaverri-Monreal, Javier Errea-Moreno, Alberto Díaz-Álvarez, Carlos Biurrun-Quel, Luis Serrano-Arriezu, Markus Kuba:
Connection of the SUMO Microscopic Traffic Simulator and the Unity 3D Game Engine to Evaluate V2X Communication-Based Systems. Sensors 18(12): 4399 (2018) - 2017
- [j27]Markus Kuba, Hosam M. Mahmoud:
Two-color balanced affine urn models with multiple drawings. Adv. Appl. Math. 90: 1-26 (2017) - [j26]Markus Kuba, Henning Sulzbach:
On martingale tail sums in affine two-color urn models with multiple drawings. J. Appl. Probab. 54(1): 96-117 (2017) - 2016
- [j25]Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Markus Kuba:
2-Xor Revisited: Satisfiability and Probabilities of Functions. Algorithmica 76(4): 1035-1076 (2016) - [j24]Markus Kuba, Alois Panholzer:
Combinatorial families of multilabelled increasing trees and hook-length formulas. Discret. Math. 339(1): 227-254 (2016) - 2014
- [c2]Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Markus Kuba:
Probabilities of 2-Xor Functions. LATIN 2014: 454-465 - 2013
- [j23]Markus Kuba, Hosam M. Mahmoud, Alois Panholzer:
Analysis of a generalized Friedman's urn with multiple drawings. Discret. Appl. Math. 161(18): 2968-2984 (2013) - [j22]Markus Kuba, Alois Panholzer:
A Unifying Approach for Proving Hook-Length Formulas for Weighted Tree Families. Graphs Comb. 29(6): 1839-1865 (2013) - [j21]May-Ru Chen, Markus Kuba:
On Generalized Pólya Urn Models. J. Appl. Probab. 50(4): 1169-1186 (2013) - 2012
- [j20]Markus Kuba, Alois Panholzer:
Enumeration formulæ for pattern restricted Stirling permutations. Discret. Math. 312(21): 3179-3194 (2012) - [j19]Markus Kuba, Alois Panholzer:
Bilabelled increasing trees and hook-length formulae. Eur. J. Comb. 33(2): 248-258 (2012) - [j18]Markus Kuba:
Generating Functions of Embedded Trees and Lattice Paths. Fundam. Informaticae 117(1-4): 215-227 (2012) - 2011
- [j17]Markus Kuba:
A Note on Naturally Embedded Ternary Trees. Electron. J. Comb. 18(1) (2011) - [j16]Markus Kuba, Alois Panholzer:
Analysis of Statistics for Generalized Stirling Permutations. Comb. Probab. Comput. 20(6): 875-910 (2011) - [j15]Svante Janson, Markus Kuba, Alois Panholzer:
Generalized Stirling permutations, families of increasing trees and urn models. J. Comb. Theory A 118(1): 94-114 (2011) - 2010
- [j14]Markus Kuba, Alois Panholzer:
On the area under lattice paths associated with triangular diminishing urn models. Adv. Appl. Math. 44(4): 329-358 (2010) - [j13]Markus Kuba, Stephan G. Wagner:
On the Distribution of Depths in Increasing Trees. Electron. J. Comb. 17(1) (2010) - [j12]Markus Kuba, Stephan G. Wagner:
Deterministic Edge Weights in Increasing Tree Families. Comb. Probab. Comput. 19(1): 99-119 (2010) - [j11]Markus Kuba, Alois Panholzer:
On the distribution of distances between specified nodes in increasing trees. Discret. Appl. Math. 158(5): 489-506 (2010) - [j10]Markus Kuba, Alois Panholzer:
Enumeration results for alternating tree families. Eur. J. Comb. 31(7): 1751-1780 (2010) - [j9]Markus Kuba, Helmut Prodinger:
A Note on Stirling Series. Integers 10: A34 (2010) - [j8]Markus Kuba, Alois Panholzer:
A combinatorial approach to the analysis of bucket recursive trees. Theor. Comput. Sci. 411(34-36): 3255-3273 (2010)
2000 – 2009
- 2009
- [j7]Markus Kuba, Alois Panholzer, Helmut Prodinger:
Lattice Paths, Sampling Without Replacement, and Limiting Distributions. Electron. J. Comb. 16(1) (2009) - [j6]Cyril Banderier, Markus Kuba, Alois Panholzer:
Analysis of three graph parameters for random trees. Random Struct. Algorithms 35(1): 42-69 (2009) - 2008
- [j5]Markus Kuba, Alois Panholzer:
On edge-weighted recursive trees and inversions in random permutations. Discret. Math. 308(4): 529-540 (2008) - 2007
- [j4]Markus Kuba, Alois Panholzer:
On the degree distribution of the nodes in increasing trees. J. Comb. Theory A 114(4): 597-618 (2007) - [j3]Markus Kuba, Alois Panholzer:
The left-right-imbalance of binary search trees. Theor. Comput. Sci. 370(1-3): 265-278 (2007) - [c1]Markus Kuba, Alois Panholzer:
Analysis of Insertion Costs in Priority Trees. ANALCO 2007: 175-182 - 2006
- [j2]Markus Kuba, Alois Panholzer:
Descendants in Increasing Trees. Electron. J. Comb. 13(1) (2006) - [j1]Markus Kuba:
On Quickselect, partial sorting and Multiple Quickselect. Inf. Process. Lett. 99(5): 181-186 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-23 21:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
