3 citations · 3 across the 4 of their papers we have counts for
4 papers
Asymptotic distribution of two-protected nodes in ternary search trees
Cecilia Holmgren, Svante Janson
We study protected nodes in -ary search trees, by putting them in context of generalised Pólya urns. We show that the number of two-protected nodes (the nodes that are neither l…
The probability that a random multigraph is simple, II
Svante Janson
Consider a random multigraph with given vertex degrees constructed by the configuration model. We give a new proof of the fact that, asymptotically for a sequence of such multigrap…
The number of bit comparisons used by Quicksort: an average-case analysis
James Allen Fill, Svante Janson
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and…
Moments of Gamma type and the Brownian supremum process area
Svante Janson
We study positive random variables whose moments can be expressed by products and quotients of Gamma functions; this includes many standard distributions. General results are given…