Conrado Martinez
Title
Cited by
Cited by
Year
Randomized binary search trees
C Martínez, S Roura
Journal of the ACM (JACM) 45 (2), 288-323, 1998
1151998
Optimal sampling strategies in quicksort and quickselect
C Martínez, S Roura
SIAM Journal on Computing 31 (3), 683-705, 2001
912001
Patterns in random binary search trees
P Flajolet, X Gourdon, C Martínez
Random Structures & Algorithms 11 (3), 223-244, 1997
811997
Locating errors using ELAs, covering arrays, and adaptive testing algorithms
C Martínez, L Moura, D Panario, B Stevens
SIAM Journal on Discrete Mathematics 23 (4), 1776-1799, 2010
672010
Analysis of Hoare's FIND algorithm with Median‐of‐three partition
P Kirschenhofer, H Prodinger, C Martinez
Random Structures & Algorithms 10 (1‐2), 143-156, 1997
651997
Randomized K-Dimensional Binary Search Trees
A Duch, V Estivill-Castro, C Martinez
International Symposium on Algorithms and Computation, 198-209, 1998
521998
An algorithm for graph pattern-matching
C Martínez, G Valiente
Proc. Fourth South American Workshop on String Processing 8, 180-197, 1997
471997
Generic algorithms for the generation of combinatorial objects
C Martinez, X Molinero
International Symposium on Mathematical Foundations of Computer Science, 572-581, 2003
462003
Partial match queries in relaxed multidimensional search trees
C Martinez, A Panholzer, H Prodinger
Algorithmica 29 (1-2), 181-204, 2001
452001
Partial quicksort
C Martınez
Proc. 6th ACMSIAM Workshop on Algorithm Engineering and Experiments and 1st …, 2004
352004
Analysis of an optimized search algorithm for skip lists
P Kirschenhofer, C Martínez, H Prodinger
Theoretical Computer Science 144 (1-2), 199-220, 1995
331995
A generic approach for the unranking of labeled combinatorial classes
C Martínez, X Molinero
Random Structures & Algorithms 19 (3‐4), 472-497, 2001
312001
On the average performance of orthogonal range search in multidimensional data structures
A Duch, C Martınez
Journal of Algorithms 44 (1), 226-245, 2002
282002
On the number of descendants and ascendants in random search trees
C Martínez, A Panholzer, H Prodinger
The Electronic Journal of Combinatorics 5 (1), R20, 1998
251998
A design of a parallel dictionary using skip lists
J Gabarró, C Martínez, X Messeguer
Theoretical Computer Science 158 (1-2), 1-33, 1996
241996
Algorithms to locate errors using covering arrays
C Martínez, L Moura, D Panario, B Stevens
Latin American Symposium on Theoretical Informatics, 504-519, 2008
232008
On the competitiveness of the move-to-front rule
C Martı́nez, S Roura
Theoretical Computer Science 242 (1-2), 313-325, 2000
222000
Adaptive sampling strategies for quickselects
C Martínez, D Panario, A Viola
ACM Transactions on Algorithms (TALG) 6 (3), 1-45, 2010
172010
On the average size of the intersection of binary trees
R Baeza-Yates, R Casas, J Díaz, C Martinez
SIAM Journal on Computing 21 (1), 24-32, 1992
161992
Analysis of pivot sampling in dual-pivot quicksort: A holistic analysis of Yaroslavskiy’s partitioning scheme
ME Nebel, S Wild, C Martínez
Algorithmica 75 (4), 632-683, 2016
142016
The system can't perform the operation now. Try again later.
Articles 1–20