James Allen Fill

Jason Matterer

CoRR, 2024

On the probability of a Pareto record.

[BibT_eX]

[DOI]

Ao Sun

CoRR, 2024

Sharpened Localization of the Trailing Point of the Pareto Record Frontier.

[BibT_eX]

[DOI]

Daniel Q. Naiman

Ao Sun

Proceedings of the 35th International Conference on Probabilistic, 2024

2021

Breaking bivariate records.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2021

Density functions for QuickQuant and QuickVal.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Special Issue on Analysis of Algorithms.

[BibT_eX]

[DOI]

Mark Daniel Ward

Algorithmica, 2020

2019

QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations.

[BibT_eX]

[DOI]

CoRR, 2019

Generating Pareto records.

[BibT_eX]

[DOI]

Daniel Q. Naiman

CoRR, 2019

The Pareto Record Frontier.

[BibT_eX]

[DOI]

Daniel Q. Naiman

CoRR, 2019

QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019

2018

On the Tails of the Limiting QuickSort Density.

[BibT_eX]

[DOI]

Proceedings of the 29th International Conference on Probabilistic, 2018

2016

Towards a Realistic Analysis of the QuickSelect Algorithm.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2016

2014

QuickSelect Tree Process Convergence, With an Application to Distributional Convergence for the Number of Symbol Comparisons Used by Worst-Case Find.

[BibT_eX]

[DOI]

Jason Matterer

Comb. Probab. Comput., 2014

2012

Distributional convergence for the number of symbol comparisons used by QuickSort

[BibT_eX]

[DOI]

CoRR, 2012

Distributional convergence for the number of symbol comparisons used by QuickSelect

[BibT_eX]

[DOI]

Takéhiko Nakama

CoRR, 2012

Exact L^2-distance from the limit for QuickSort key comparisons (extended abstract)

[BibT_eX]

[DOI]

Patrick Bindjeme

CoRR, 2012

The limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract)

[BibT_eX]

[DOI]

Patrick Bindjeme

CoRR, 2012

Partitions with Distinct Multiplicities of Parts: On An "Unsolved Problem" Posed By Herbert Wilf.

[BibT_eX]

[DOI]

Mark Daniel Ward

Electron. J. Comb., 2012

2011

On Vertex, Edge, and Vertex-Edge Random Graphs.

[BibT_eX]

[DOI]

Elizabeth Beer

Edward R. Scheinerman

Electron. J. Comb., 2011

2010

Analysis of the Expected Number of Bit Comparisons Required by Quickselect.

[BibT_eX]

[DOI]

Takéhiko Nakama

Algorithmica, 2010

2009

The Number of Symbol Comparisons in QuickSort and QuickSelect.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2006

Destruction of Very Simple Trees.

[BibT_eX]

[DOI]

Nevin Kapur

Alois Panholzer

Algorithmica, 2006

2005

Transfer theorems and asymptotic distributional results for m-ary search trees.

[BibT_eX]

[DOI]

Nevin Kapur

Random Struct. Algorithms, 2005

2004

Limiting distributions for additive functionals on Catalan trees.

[BibT_eX]

[DOI]

Nevin Kapur

Theor. Comput. Sci., 2004

The number of bit comparisons used by Quicksort: an average-case analysis.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003

Speeding up the FMMR perfect sampling algorithm: A case study revisited.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2003

2002

Quicksort asymptotics.

[BibT_eX]

[DOI]

J. Algorithms, 2002

2001

Approximating the limiting Quicksort distribution.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2001

2000

The Moore-Penrose Generalized Inverse for Sums of Matrices.

[BibT_eX]

[DOI]

Donniell E. Fishkind

SIAM J. Matrix Anal. Appl., 2000

Random intersection graphs when m=omega(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models.

[BibT_eX]

[DOI]

Edward R. Scheinerman

Karen B. Singer-Cohen

Random Struct. Algorithms, 2000

Extension of Fill's perfect rejection sampling algorithm to general chains.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2000

Perfect simulation from the Quicksort limit distribution

[BibT_eX]

[DOI]

Luc Devroye

Ralph Neininger

CoRR, 2000

A characterization of the set of fixed points of the Quicksort transformation

[BibT_eX]

[DOI]

CoRR, 2000

Smoothness and decay properties of the limiting Quicksort density function

[BibT_eX]

[DOI]

CoRR, 2000

The Randomness Recycler: A New Technique for Perfect Sampling.

[BibT_eX]

[DOI]

Mark Huber

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999

Total Path Length For Random Recursive Trees.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1999

1997

The Number of m-ary Search Trees on n Keys.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1997

An Interruptible Algorithm for Perfect Sampling via Markov Chains.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996

Limits and Rates of Convergence for the Distribution of Search Cost Under the Move-to-Front Rule.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

On the distribution of search cost for the move-to-front rule.

[BibT_eX]

[DOI]

Lars Holst

Random Struct. Algorithms, 1996

On the distribution of binary search trees under the random permutation model.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1996

Multiway trees of Maximum and Minimum Probability under the Random Permutation Model.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1996

1992

Analysis of Top To Random Shuffles.

[BibT_eX]

[DOI]

Persi Diaconis

Jim Pitman

Comb. Probab. Comput., 1992

1989

The Radon Transform on Z<sub>n</sub>.

[BibT_eX]

[DOI]