Ralph Neininger

Denis Spiegel

CoRR, 2022

On the Contraction Method with Reduced Independence Assumptions.

[BibT_eX]

[DOI]

Jasmin Straub

Proceedings of the 33rd International Conference on Probabilistic, 2022

2021

Node profiles of symmetric digital search trees: Concentration properties.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2021

A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

2020

Convergence Rates in the Probabilistic Analysis of Algorithms.

[BibT_eX]

[DOI]

Jasmin Straub

Proceedings of the 31st International Conference on Probabilistic, 2020

2019

Preface.

[BibT_eX]

[DOI]

Hsien-Kuei Hwang

Marek Zaionc

Comb. Probab. Comput., 2019

2018

Probabilistic Analysis of the Dual-Pivot Quicksort "Count".

[BibT_eX]

[DOI]

Jasmin Straub

Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018

2017

Dependence and phase changes in random <i>m</i>-ary search trees.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2017

Rates of convergence for balanced irreducible two-color Pólya urns.

[BibT_eX]

[DOI]

Andrea Kuntschik

Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

External Profile of Symmetric Digital Search Trees (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

2016

Process convergence for the complexity of Radix Selection on Markov sources.

[BibT_eX]

[DOI]

CoRR, 2016

The CLT Analogue for Cyclic Urns.

[BibT_eX]

[DOI]

Noela S. Müller

Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics, 2016

2015

Average Case and Distributional Analysis of Dual-Pivot Quicksort.

[BibT_eX]

[DOI]

Sebastian Wild

Markus E. Nebel

ACM Trans. Algorithms, 2015

Refined quicksort asymptotics.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2015

A Limit Theorem for Radix Sort and Tries with Markovian Input.

[BibT_eX]

[DOI]

Wojciech Szpankowski

CoRR, 2015

2014

Pólya Urns Via the Contraction Method.

[BibT_eX]

[DOI]

Margarete Knape

Comb. Probab. Comput., 2014

A statistical view on exchanges in Quickselect.

[BibT_eX]

[DOI]

Benjamin Dadoun

Proceedings of the 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, 2014

2013

Asymptotic Analysis of Hoppe Trees.

[BibT_eX]

[DOI]

J. Appl. Probab., 2013

Average Case and Distributional Analysis of Java 7's Dual Pivot Quicksort

[BibT_eX]

[DOI]

Sebastian Wild

Markus E. Nebel

CoRR, 2013

Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model.

[BibT_eX]

[DOI]

Wojciech Szpankowski

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012

A refined Quicksort asymptotic

[BibT_eX]

[DOI]

CoRR, 2012

On a functional contraction method

[BibT_eX]

[DOI]

CoRR, 2012

A limit process for partial match queries in random quadtrees

[BibT_eX]

[DOI]

Nicolas Broutin

CoRR, 2012

Partial match queries in random quadtrees.

[BibT_eX]

[DOI]

Nicolas Broutin

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2006

Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees.

[BibT_eX]

[DOI]

Michael Fuchs

Hsien-Kuei Hwang

Algorithmica, 2006

2004

Distances and Finger Search in Random Binary Search Trees.

[BibT_eX]

[DOI]

Luc Devroye

SIAM J. Comput., 2004

2003

Random suffix search trees.

[BibT_eX]

[DOI]

Luc Devroye

Random Struct. Algorithms, 2003

2002

Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions.

[BibT_eX]

[DOI]

Hsien-Kuei Hwang

SIAM J. Comput., 2002

Rates of convergence for Quicksort.

[BibT_eX]

[DOI]

Ludger Rüschendorf

J. Algorithms, 2002

The Wiener Index Of Random Trees.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2002

2001

On a multivariate contraction method for random recursive structures with applications to Quicksort.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2001

2000

Asymptotic distributions for partial match queries in K-d trees.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2000

Perfect simulation from the Quicksort limit distribution

[BibT_eX]

[DOI]

Luc Devroye

James Allen Fill

CoRR, 2000

1999

Limit laws for random recursive structures and algorithms.

[BibT_eX]

[DOI]

PhD thesis, 1999

On the internal path length of d-dimensional quad trees.

[BibT_eX]

[DOI]