Conrado Martínez

Emma Rollon

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Unbiased Similarity Estimators Using Samples.

[BibT_eX]

[DOI]

Alfredo Viola

Jun Wang

Proceedings of the Similarity Search and Applications - 16th International Conference, 2023

2022

Median and Hybrid Median K-Dimensional Trees.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

LotterySampling: A Randomized Algorithm for the Heavy Hitters and Top-k Problems in Data Streams.

[BibT_eX]

[DOI]

Gonzalo Solera-Pardo

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

A Probabilistic Model Revealing Shortcomings in Lua's Hybrid Tables.

[BibT_eX]

[DOI]

Cyril Nicaud

Pablo Rotondo

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

Affirmative Sampling: Theory and Applications.

[BibT_eX]

[DOI]

Jérémie O. Lumbroso

Proceedings of the 33rd International Conference on Probabilistic, 2022

Partial Match Queries in Quad- K-d Trees.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Conference on Probabilistic, 2022

2019

Sesquickselect: One and a half pivots for cache-efficient selection.

[BibT_eX]

[DOI]

Markus Nebel

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

2018

Fixed Partial Match Queries in Quadtrees.

[BibT_eX]

[DOI]

Gustavo Lau

Proceedings of the 29th International Conference on Probabilistic, 2018

On Deletions in Open Addressing Hashing.

[BibT_eX]

[DOI]

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

2016

Analysis of Pivot Sampling in Dual-Pivot Quicksort: A Holistic Analysis of Yaroslavskiy's Partitioning Scheme.

[BibT_eX]

[DOI]

Markus E. Nebel

Algorithmica, 2016

On the Cost of Fixed Partial Match Queries in K-d Trees.

[BibT_eX]

[DOI]

Gustavo Lau

Algorithmica, 2016

Random Partial Match in Quad-K-d Trees.

[BibT_eX]

[DOI]

Gustavo Lau

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015

Analysis of Branch Misses in Quicksort.

[BibT_eX]

[DOI]

Markus E. Nebel

Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, 2015

2014

Selection by rank in <i>K</i>-dimensional binary search trees.

[BibT_eX]

[DOI]

María-Inés Fernández-Camacho

Random Struct. Algorithms, 2014

Psi-series method for equality of random trees and quadratic convolution recurrences.

[BibT_eX]

[DOI]

Hua-Huai Chern

Hsien-Kuei Hwang

Random Struct. Algorithms, 2014

The rth Smallest Part Size of a Random Integer Partition.

[BibT_eX]

[DOI]

Integers, 2014

Analysis of Pivot Sampling in Dual-Pivot Quicksort.

[BibT_eX]

[DOI]

Markus E. Nebel

CoRR, 2014

Analysis of the Strategy "Hiring Above the $$m$$ m -th Best Candidate".

[BibT_eX]

[DOI]

Ahmed Helmi

Algorithmica, 2014

2013

Guest Editorial.

[BibT_eX]

[DOI]

Hsien-Kuei Hwang

Robert Sedgewick

Algorithmica, 2013

2012

The MAX-CUT of sparse random graphs.

[BibT_eX]

[DOI]

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

Hiring above the m-th Best Candidate: A Generalization of Records in Permutations.

[BibT_eX]

[DOI]

Ahmed Helmi

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011

The analysis of Range Quickselect and related problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

The Swedish Leader Election Protocol: Analysis and Variations.

[BibT_eX]

[DOI]

Guy Louchard

Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, 2011

2010

Adaptive sampling strategies for quickselects.

[BibT_eX]

[DOI]

Daniel Panario

Alfredo Viola

ACM Trans. Algorithms, 2010

Rank Selection in Multidimensional Data.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Interval Sorting.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

Moves and displacements of particular elements in Quicksort.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Updating relaxed <i>K</i>-d trees.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2009

Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

2008

Algorithms to Locate Errors Using Covering Arrays.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Generating Random Derangements.

[BibT_eX]

[DOI]

Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics, 2008

2007

On the Average Cost of Insertions on Random Relaxed K-d Trees.

[BibT_eX]

[DOI]

Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics, 2007

2006

On the Variance of Quickselect.

[BibT_eX]

[DOI]

Jean Daligault

Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, 2006

2005

Efficient iteration in admissible combinatorial classes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Improving the performance of multidimensional search using fingers.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2005

2004

An Experimental Study of Unranking Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

Fingered Multidimensional Search Trees.

[BibT_eX]

[DOI]

Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

Adaptive sampling for quickselect.

[BibT_eX]

[DOI]

Daniel Panario

Alfredo Viola

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

Patial Quicksort.

[BibT_eX]

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003

Generic Algorithms for the Generation of Combinatorial Objects.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2002

On the average performance of orthogonal range search in multidimensional data structures.

[BibT_eX]

[DOI]

J. Algorithms, 2002

2001

Optimal Sampling Strategies in Quicksort and Quickselect.

[BibT_eX]

[DOI]

SIAM J. Comput., 2001

A generic approach for the unranking of labeled combinatorial classes.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2001

Partial Match Queries in Relaxed Multidimensional Search Trees.

[BibT_eX]

[DOI]

Algorithmica, 2001

2000

On the competitiveness of the move-to-front rule.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

1998

Randomized Binary Search Trees.

[BibT_eX]

[DOI]

J. ACM, 1998

On the Number of Descendants and Ascendants in Random Search Trees.

[BibT_eX]

[DOI]

Electron. J. Comb., 1998

Randomized K-Dimensional Binary Search Trees.

[BibT_eX]

[DOI]

Vladimir Estivill-Castro

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Optimal Sampling Strategies in Quicksort.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997

Analysis of Hoare's FIND algorithm with Median-of-three partition.

[BibT_eX]

[DOI]

Peter Kirschenhofer

Random Struct. Algorithms, 1997

Patterns in random binary search trees.

[BibT_eX]

[DOI]

Philippe Flajolet

Xavier Gourdon

Random Struct. Algorithms, 1997

1996

A Design of a Parallel Dictionary Using Skip Lists.

[BibT_eX]

[DOI]

Joaquim Gabarró

Xavier Messeguer

Theor. Comput. Sci., 1996

Randomization of Search Trees by Subtree Size.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1996

1995

Analysis of an Optimized Search Algorithm for Skip Lists.

[BibT_eX]

[DOI]

Peter Kirschenhofer

Theor. Comput. Sci., 1995

1993

Average-Case Analysis on Simple Families of Trees Using a Balanced Probability Model.

[BibT_eX]

[DOI]

Rafael Casas

Josep Díaz

Theor. Comput. Sci., 1993

1992

On the Average Size of the Intersection of Binary Trees.

[BibT_eX]

[DOI]

Ricardo A. Baeza-Yates

Rafael Casas

Josep Díaz

SIAM J. Comput., 1992

Statistics under the BST model.

[BibT_eX]

PhD thesis, 1992

1991

Static on Random Trees.

[BibT_eX]

[DOI]

Rafael Casas

Josep Díaz

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

Average-case Analysis of Equality of Binary Trees Under the BST Probability Model.

[BibT_eX]

[DOI]