| Publication | Date of Publication | Type |
|---|
Conditioned Galton-Watson trees: the shape functional, and more on the sum of powers of subtree sizes and its mean
La Matematica | 2024-06-28 | Paper |
Breaking multivariate records
Electronic Journal of Probability | 2023-08-02 | Paper |
Corrigendum to: ``The sum of powers of subtree sizes for conditioned Galton-Watson trees
Electronic Journal of Probability | 2023-07-04 | Paper |
Density functions for \texttt{QuickQuant} and \texttt{QuickVal}
Electronic Journal of Probability | 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
Electronic Journal of Probability | 2022-10-04 | Paper |
Density functions for QuickQuant and QuickVal
| 2021-09-29 | Paper |
On the tails of the limiting QuickSort density
| 2021-06-15 | Paper |
Breaking bivariate records
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
The Pareto record frontier
Electronic Journal of Probability | 2020-09-29 | Paper |
QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations (Extended Abstract)
2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-18 | Paper |
On vertex, edge, and vertex-edge random graphs (extended abstract)
2011 Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
Analysis of the expected number of bit comparisons required by Quickselect
2008 Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
QuickSort: improved right-tail asymptotics for the limiting distribution, and large deviations
Electronic Journal of Probability | 2019-08-06 | Paper |
On the tails of the limiting QuickSort density
Electronic Communications in Probability | 2019-02-14 | Paper |
Generating Pareto records
| 2019-01-17 | Paper |
Distributional convergence for the number of symbol comparisons used by QuickSort (extended abstract)
| 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
Journal of Theoretical Probability | 2017-01-10 | Paper |
Towards a realistic analysis of the QuickSelect algorithm
Theory of Computing Systems | 2016-06-03 | Paper |
The number of bit comparisons used by Quicksort, an average-case analysis
| 2015-08-03 | Paper |
Hitting times and interlacing eigenvalues: a stochastic approach using intertwinings
Journal of Theoretical Probability | 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
Combinatorics, Probability and Computing | 2014-09-24 | Paper |
Comparison inequalities and fastest-mixing Markov chains
The Annals of Applied Probability | 2013-10-25 | Paper |
Distributional convergence for the number of symbol comparisons used by QuickSelect
Advances in Applied Probability | 2013-07-11 | Paper |
Distributional convergence for the number of symbol comparisons used by QuickSort
The Annals of Applied Probability | 2013-05-10 | Paper |
The number of bit comparisons used by quicksort: an average-case analysis
Electronic Journal of Probability | 2012-06-22 | Paper |
Partitions with distinct multiplicities of parts: on an ``unsolved problem posed by Herbert Wilf
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
Precise logarithmic asymptotics for the right tails of some limit random variables for random trees
Annals of Combinatorics | 2012-01-24 | Paper |
On vertex, edge, and vertex-edge random graphs
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
Analysis of the expected number of bit comparisons required by quickselect
Algorithmica | 2010-09-27 | Paper |
Perfect simulation of Vervaat perpetuities
Electronic Journal of Probability | 2010-04-30 | Paper |
Two-player knock 'em down
Electronic Journal of Probability | 2009-11-20 | Paper |
The passage time distribution for a birth-and-death chain: Strong stationary duality gives a first stochastic proof
Journal of Theoretical Probability | 2009-09-25 | Paper |
On hitting times and fastest strong stationary times for skip-free and more general chains
Journal of Theoretical Probability | 2009-09-25 | Paper |
The Number of Symbol Comparisons in QuickSort and QuickSelect
Automata, Languages and Programming | 2009-07-14 | Paper |
Realizable monotonocity and inverse probability transform
| 2008-05-14 | Paper |
Destruction of very simple trees
Algorithmica | 2007-02-14 | Paper |
Time to Stationarity for a Continuous-Time Markov Chain
Probability in the Engineering and Informational Sciences | 2007-01-19 | Paper |
Examples for the Theory of Strong Stationary Duality with Countable State Spaces
Probability in the Engineering and Informational Sciences | 2007-01-19 | Paper |
A repertoire for additive functionals of uniformly distributed \(m\)-ary search trees
| 2006-08-29 | Paper |
Transfer theorems and asymptotic distributional results for m‐ary search trees
Random Structures & Algorithms | 2005-08-29 | Paper |
Singularity analysis, Hadamard products, and tree recurrences
Journal of Computational and Applied Mathematics | 2005-02-23 | Paper |
Limiting distributions for additive functionals on Catalan trees
Theoretical Computer Science | 2005-01-11 | Paper |
Asymptotic analysis via Mellin transforms for small deviations in \(L^2\)-norm of integrated Brownian sheets
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 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
Random Structures & Algorithms | 2004-02-03 | Paper |
Interruptible exact sampling in the passive case
Methodology and Computing in Applied Probability | 2003-08-06 | Paper |
Stochastic monotonicity and realizable monotonicity
The Annals of Probability | 2003-05-06 | Paper |
Quicksort asymptotics
Journal of Algorithms | 2003-03-23 | Paper |
Approximating the limiting quicksort distribution
Random Structures & Algorithms | 2002-02-19 | Paper |
The Move-to-Front Rule: A Case Study for two Perfect Sampling Algorithms
Probability in the Engineering and Informational Sciences | 2002-02-04 | Paper |
Mixing times for Markov chains on wreath products and related homogeneous spaces
Electronic Journal of Probability | 2001-08-01 | Paper |
scientific article; zbMATH DE number 1560248 (Why is no real title available?)
| 2001-04-26 | Paper |
scientific article; zbMATH DE number 1552325 (Why is no real title available?)
| 2001-03-19 | Paper |
scientific article; zbMATH DE number 1559585 (Why is no real title available?)
| 2001-03-01 | Paper |
scientific article; zbMATH DE number 1545677 (Why is no real title available?)
| 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
Combinatorics, Probability and Computing | 2000-10-23 | Paper |
The Randomness Recycler: A new technique for perfect sampling
| 2000-09-29 | Paper |
Perfect simulation from the quicksort limit distribution
Electronic Communications in Probability | 2000-07-27 | Paper |
A characterization of the set of fixed points of the quicksort transformation
Electronic Communications in Probability | 2000-07-27 | Paper |
The Moore--Penrose Generalized Inverse for Sums of Matrices
SIAM Journal on Matrix Analysis and Applications | 2000-03-20 | Paper |
Affine isomorphism for partially ordered sets
Order | 2000-02-14 | Paper |
An interruptible algorithm for perfect sampling via Markov chains
The Annals of Applied Probability | 1999-08-02 | Paper |
The Number of m-ary Search Trees on n Keys
Combinatorics, Probability and Computing | 1998-05-25 | Paper |
Wall and Siegmund duality relations for birth and death chains with reflecting barrier
Journal of Theoretical Probability | 1997-10-07 | Paper |
On the distribution for the duration of a randomized leader election algorithm
The Annals of Applied Probability | 1997-06-12 | Paper |
Limits and rates of convergence for the distribution of search cost under the move-to-front rule
Theoretical Computer Science | 1997-02-27 | Paper |
Multiway trees of maximum and minimum probability under the random permutation model
Combinatorics, Probability and Computing | 1997-02-20 | Paper |
scientific article; zbMATH DE number 903457 (Why is no real title available?)
| 1996-12-08 | Paper |
scientific article; zbMATH DE number 852055 (Why is no real title available?)
| 1996-06-18 | Paper |
An exact formula for the move-to-front rule for self-organizing lists
Journal of Theoretical Probability | 1996-05-20 | Paper |
scientific article; zbMATH DE number 795110 (Why is no real title available?)
| 1995-11-26 | Paper |
On the Markov chain for the move-to-root rule for binary search trees
The Annals of Applied Probability | 1995-08-10 | Paper |
Rates of convergence for the move-to-root Markov chain for binary search trees
The Annals of Applied Probability | 1995-08-10 | Paper |
Analysis of Top To Random Shuffles
Combinatorics, Probability and Computing | 1994-05-05 | Paper |
Percolation, first-passage percolation and covering times for Richardson's model on the \(n\)-cube
The Annals of Applied Probability | 1993-10-28 | Paper |
Strong stationary duality for continuous-time Markov chains. I: Theory
Journal of Theoretical Probability | 1992-06-28 | Paper |
Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
The Annals of Applied Probability | 1991-01-01 | Paper |
Strong stationary times via a new form of duality
The Annals of Probability | 1990-01-01 | Paper |
Asymptotic expansions for large deviation probabilities in the strong law of large numbers
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 1989-01-01 | Paper |
The Radon Transform on $\mathbb{Z}_n $
SIAM Journal on Discrete Mathematics | 1989-01-01 | Paper |
The convergence rate for the strong law of large numbers: General lattice distributions
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 1989-01-01 | Paper |
Bounds on the coarseness of random sums
The Annals of Probability | 1988-01-01 | Paper |
On projection pursuit measures of multivariate location and dispersion
The Annals of Statistics | 1984-01-01 | Paper |
Convergence rates related to the strong law of large numbers
The Annals of Probability | 1983-01-01 | Paper |
Invariance properties of Schoenberg's tone row system
The Journal of the Australian Mathematical Society. Series B. Applied Mathematics | 1980-01-01 | Paper |
The structure of RI-invariant tweleve-tone rows
The Journal of the Australian Mathematical Society. Series B. Applied Mathematics | 1980-01-01 | Paper |
scientific article; zbMATH DE number 3573251 (Why is no real title available?)
| 1977-01-01 | Paper |
On the probability of a Pareto record
| N/A | Paper |
Sharpened localization of the trailing point of the Pareto record frontier
| N/A | Paper |
