The following pages link to Conrado Martínez (Q308945):
Displaying 50 items.
- Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme (Q308946) (← links)
- On the cost of fixed partial match queries in \(K\)-d trees (Q308949) (← links)
- Analysis of the strategy ``hiring above the \(m\)-th best candidate'' (Q486994) (← links)
- The analysis of range quickselect and related problems (Q650886) (← links)
- Analysis of an optimized search algorithm for skip lists (Q672990) (← links)
- Moves and displacements of particular elements in quicksort (Q1019745) (← links)
- A design of a parallel dictionary using skip lists (Q1351441) (← links)
- On the number of descendants and ascendants in random search trees (Q1384587) (← links)
- On the competitiveness of the move-to-front rule (Q1575556) (← links)
- (Q1840510) (redirect page) (← links)
- Partial match queries in relaxed multidimensional search trees (Q1840511) (← links)
- Efficient iteration in admissible combinatorial classes (Q2581353) (← links)
- A generic approach for the unranking of labeled combinatorial classes (Q2772928) (← links)
- Optimal sampling strategies in Quicksort and Quickselect (Q2784476) (← links)
- On the average performance of fixed partial match queries in random relaxed \(K\)-d trees (Q2789547) (← links)
- Random Partial Match in Quad-K-d Trees (Q2802954) (← links)
- Psi-series method for equality of random trees and quadratic convolution recurrences (Q2874083) (← links)
- Selection by rank in K-dimensional binary search trees (Q2877767) (← links)
- Hiring above the m-th Best Candidate: A Generalization of Records in Permutations (Q2894489) (← links)
- Data streams as random permutations: the distinct element problem (Q2920864) (← links)
- Updating relaxed <i>K</i> -d trees (Q2930277) (← links)
- Adaptive sampling strategies for quickselects (Q2930336) (← links)
- (Q2959928) (← links)
- Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms (Q3058530) (← links)
- Analysis of Hoare's FIND algorithm with Median-of-three partition (Q3122910) (← links)
- (Q3154677) (← links)
- (Q3176556) (← links)
- Improving the performance of multidimensional search using fingers (Q3507747) (← links)
- Rank Selection in Multidimensional Data (Q3557059) (← links)
- Interval Sorting (Q3587383) (← links)
- (Q3625879) (← links)
- Randomized binary search trees (Q3841653) (← links)
- Patterns in random binary search trees (Q4361713) (← links)
- (Q4428917) (← links)
- (Q4502543) (← links)
- Randomization of search trees by subtree size (Q4595480) (← links)
- (Q4737184) (← links)
- On the average performance of orthogonal range search in multidimensional data structures (Q4799528) (← links)
- Fixed Partial Match Queries in Quadtrees (Q4993542) (← links)
- On the average cost of insertions on random relaxed <i>K</i>-d trees (Q5194611) (← links)
- Generating Random Derangements (Q5194649) (← links)
- The Swedish Leader Election Protocol: Analysis and Variations (Q5194698) (← links)
- Analysis of Branch Misses in Quicksort (Q5194799) (← links)
- On Deletions in Open Addressing Hashing (Q5195101) (← links)
- Sesquickselect: One and a half pivots for cache-efficient selection (Q5195231) (← links)
- On the Variance of Quickselect (Q5233147) (← links)
- The \(r^{\mathrm{th}}\) smallest part size of a random integer partition (Q5262056) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431345) (← links)
- Algorithms to Locate Errors Using Covering Arrays (Q5458555) (← links)
- (Q5501291) (← links)
