Publication | Date of Publication | Type |
---|
Breaking multivariate records | 2023-08-02 | Paper |
Corrigendum to: ``The sum of powers of subtree sizes for conditioned Galton-Watson trees | 2023-07-04 | Paper |
Density functions for \texttt{QuickQuant} and \texttt{QuickVal} | 2023-01-23 | Paper |
Conditioned Galton-Watson trees: The shape functional, and more on the sum of powers of subtree sizes and its mean | 2022-12-21 | Paper |
The sum of powers of subtree sizes for conditioned Galton-Watson trees | 2022-10-04 | Paper |
Density functions for QuickQuant and QuickVal | 2021-09-29 | Paper |
Breaking bivariate records | 2021-06-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q4993543 | 2021-06-15 | Paper |
The Pareto record frontier | 2020-09-29 | Paper |
QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations (Extended Abstract) | 2019-09-18 | Paper |
Analysis of the expected number of bit comparisons required by quickselect | 2019-09-16 | Paper |
On Vertex, Edge, and Vertex-Edge Random Graphs (Extended Abstract) | 2019-09-16 | Paper |
QuickSort: improved right-tail asymptotics for the limiting distribution, and large deviations | 2019-08-06 | Paper |
On the tails of the limiting QuickSort density | 2019-02-14 | Paper |
Generating Pareto records | 2019-01-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q2959907 | 2017-02-10 | Paper |
A local limit theorem for Quicksort key comparisons via multi-round smoothing | 2017-01-16 | Paper |
Strong stationary duality for diffusion processes | 2017-01-10 | Paper |
Towards a realistic analysis of the QuickSelect algorithm | 2016-06-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q5501271 | 2015-08-03 | Paper |
Hitting times and interlacing eigenvalues: a stochastic approach using intertwinings | 2014-11-17 | Paper |
Exact L^2-distance from the limit for QuickSort key comparisons (extended abstract) | 2014-09-29 | Paper |
The limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract) | 2014-09-29 | Paper |
QuickSelect Tree Process Convergence, With an Application to Distributional Convergence for the Number of Symbol Comparisons Used by Worst-Case Find | 2014-09-24 | Paper |
Comparison inequalities and fastest-mixing Markov chains | 2013-10-25 | Paper |
Distributional Convergence for the Number of Symbol Comparisons Used by Quickselect | 2013-07-11 | Paper |
Distributional convergence for the number of symbol comparisons used by QuickSort | 2013-05-10 | Paper |
The number of bit comparisons used by quicksort: an average-case analysis | 2012-06-22 | Paper |
Partitions with distinct multiplicities of parts: on an ``unsolved problem posed by Herbert Wilf | 2012-06-12 | Paper |
Precise logarithmic asymptotics for the right tails of some limit random variables for random trees | 2012-01-24 | Paper |
On vertex, edge, and vertex-edge random graphs | 2011-06-01 | Paper |
Analysis of the expected number of bit comparisons required by quickselect | 2010-09-27 | Paper |
Perfect simulation of Vervaat perpetuities | 2010-04-30 | Paper |
Two-player knock 'em down | 2009-11-20 | Paper |
On hitting times and fastest strong stationary times for skip-free and more general chains | 2009-09-25 | Paper |
The passage time distribution for a birth-and-death chain: Strong stationary duality gives a first stochastic proof | 2009-09-25 | Paper |
The Number of Symbol Comparisons in QuickSort and QuickSelect | 2009-07-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q5386473 | 2008-05-14 | Paper |
Destruction of very simple trees | 2007-02-14 | Paper |
Examples for the Theory of Strong Stationary Duality with Countable State Spaces | 2007-01-19 | Paper |
Time to Stationarity for a Continuous-Time Markov Chain | 2007-01-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q5485337 | 2006-08-29 | Paper |
Transfer theorems and asymptotic distributional results for m‐ary search trees | 2005-08-29 | Paper |
Singularity analysis, Hadamard products, and tree recurrences | 2005-02-23 | Paper |
Limiting distributions for additive functionals on Catalan trees | 2005-01-11 | Paper |
Asymptotic analysis via Mellin transforms for small deviations in \(L^2\)-norm of integrated Brownian sheets | 2004-11-05 | Paper |
The space requirement of m-ary search trees: distributional asymptotics for m >= 27 | 2004-05-08 | Paper |
Speeding up the FMMR perfect sampling algorithm: A case study revisited | 2004-02-03 | Paper |
Interruptible exact sampling in the passive case | 2003-08-06 | Paper |
Stochastic monotonicity and realizable monotonicity | 2003-05-06 | Paper |
Quicksort asymptotics | 2003-03-23 | Paper |
Approximating the limiting Quicksort distribution | 2002-02-19 | Paper |
The Move-to-Front Rule: A Case Study for two Perfect Sampling Algorithms | 2002-02-04 | Paper |
Mixing times for Markov chains on wreath products and related homogeneous spaces | 2001-08-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4527093 | 2001-04-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q4524568 | 2001-03-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q4527037 | 2001-03-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4521550 | 2000-12-19 | Paper |
Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models | 2000-12-13 | Paper |
Total Path Length for Random Recursive Trees | 2000-10-23 | Paper |
The Randomness Recycler: A new technique for perfect sampling | 2000-09-29 | Paper |
A characterization of the set of fixed points of the quicksort transformation | 2000-07-27 | Paper |
Perfect simulation from the quicksort limit distribution | 2000-07-27 | Paper |
The Moore--Penrose Generalized Inverse for Sums of Matrices | 2000-03-20 | Paper |
Affine isomorphism for partially ordered sets | 2000-02-14 | Paper |
An interruptible algorithm for perfect sampling via Markov chains | 1999-08-02 | Paper |
The Number of m-ary Search Trees on n Keys | 1998-05-25 | Paper |
Wall and Siegmund duality relations for birth and death chains with reflecting barrier | 1997-10-07 | Paper |
On the distribution for the duration of a randomized leader election algorithm | 1997-06-12 | Paper |
Limits and rates of convergence for the distribution of search cost under the move-to-front rule | 1997-02-27 | Paper |
Multiway Trees of Maximum and Minimum Probability under the Random Permutation Model | 1997-02-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q4885223 | 1996-12-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q4868264 | 1996-06-18 | Paper |
An exact formula for the move-to-front rule for self-organizing lists | 1996-05-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q4845259 | 1995-11-26 | Paper |
On the Markov chain for the move-to-root rule for binary search trees | 1995-08-10 | Paper |
Rates of convergence for the move-to-root Markov chain for binary search trees | 1995-08-10 | Paper |
Analysis of Top To Random Shuffles | 1994-05-05 | Paper |
Percolation, first-passage percolation and covering times for Richardson's model on the \(n\)-cube | 1993-10-28 | Paper |
Strong stationary duality for continuous-time Markov chains. I: Theory | 1992-06-28 | Paper |
Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process | 1991-01-01 | Paper |
Strong stationary times via a new form of duality | 1990-01-01 | Paper |
The convergence rate for the strong law of large numbers: General lattice distributions | 1989-01-01 | Paper |
Asymptotic expansions for large deviation probabilities in the strong law of large numbers | 1989-01-01 | Paper |
The Radon Transform on $\mathbb{Z}_n $ | 1989-01-01 | Paper |
Bounds on the coarseness of random sums | 1988-01-01 | Paper |
On projection pursuit measures of multivariate location and dispersion | 1984-01-01 | Paper |
Convergence rates related to the strong law of large numbers | 1983-01-01 | Paper |
Invariance properties of Schoenberg's tone row system | 1980-01-01 | Paper |
The structure of RI-invariant tweleve-tone rows | 1980-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4144193 | 1977-01-01 | Paper |