A design of a parallel dictionary using skip lists

A generic approach for the unranking of labeled combinatorial classes

scholarly article by Conrado Martínez & Xavier Molinero published October 2001 in Random Structures and Algorithms

Adaptive sampling strategies for quickselects

Analysis of Pivot Sampling in Dual-Pivot Quicksort: A Holistic Analysis of Yaroslavskiy’s Partitioning Scheme ⬇️

Analysis of an optimized search algorithm for skip lists

Analysis of the Strategy “Hiring Above the $$m$$ m -th Best Candidate”

Average-case analysis of equality of binary trees under the BST probability model

article

Average-case analysis on simple families of trees using a balanced probability model

Efficient iteration in admissible combinatorial classes

Guest Editorial

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

article published in 2012

Improving the performance of multidimensional search using fingers

Interval Sorting

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

Moves and displacements of particular elements in Quicksort

article published in 2009

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

Optimal Sampling Strategies in Quicksort and Quickselect

Partial match queries in relaxed multidimensional search trees

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

Random Partial Match in Quad-K-d Trees

Randomization of search trees by subtree size

Randomized binary search trees

Selection by rank inK-dimensional binary search trees

Statistics on random trees

The analysis of Range Quickselect and related problems

scientific article published on October 2011

Updating relaxedK-d trees