| Randomized binary search trees C Martínez, S Roura Journal of the ACM (JACM) 45 (2), 288-323, 1998 | 141 | 1998 |
| Optimal sampling strategies in quicksort and quickselect C Martínez, S Roura SIAM Journal on Computing 31 (3), 683-705, 2001 | 104 | 2001 |
| Patterns in random binary search trees P Flajolet, X Gourdon, C Martínez Random Structures & Algorithms 11 (3), 223-244, 1997 | 97 | 1997 |
| 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 | 85 | 2010 |
| 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 | 68 | 1997 |
| Randomized K-Dimensional Binary Search Trees A Duch, V Estivill-Castro, C Martinez Algorithms and Computation: 9th International Symposium, ISAAC’98 Taejon …, 1998 | 57 | 1998 |
| Partial quicksort C Martınez Proc. 6th ACMSIAM Workshop on Algorithm Engineering and Experiments and 1st …, 2004 | 49 | 2004 |
| Generic algorithms for the generation of combinatorial objects C Martinez, X Molinero Mathematical Foundations of Computer Science 2003: 28th International …, 2003 | 49 | 2003 |
| Partial match queries in relaxed multidimensional search trees C Martinez, A Panholzer, H Prodinger Algorithmica 29 (1-2), 181-204, 2001 | 49 | 2001 |
| An algorithm for graph pattern-matching C Martínez, G Valiente Proc. Fourth South American Workshop on String Processing 8, 180-197, 1997 | 49 | 1997 |
| 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 | 41 | 1995 |
| A generic approach for the unranking of labeled combinatorial classes C Martínez, X Molinero Random Structures & Algorithms 19 (3‐4), 472-497, 2001 | 39 | 2001 |
| 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 | 30 | 2002 |
| 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 | 26 | 1998 |
| Algorithms to locate errors using covering arrays C Martínez, L Moura, D Panario, B Stevens LATIN 2008: Theoretical Informatics: 8th Latin American Symposium, Búzios …, 2008 | 25 | 2008 |
| On the competitiveness of the move-to-front rule C Martınez, S Roura Theoretical Computer Science 242 (1-2), 313-325, 2000 | 25 | 2000 |
| 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 | 22 | 1996 |
| Generating random derangements C Martínez, A Panholzer, H Prodinger 2008 Proceedings of the Fifth Workshop on Analytic Algorithmics and …, 2008 | 20 | 2008 |
| 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, 632-683, 2016 | 19 | 2016 |
| Adaptive sampling strategies for quickselects C Martínez, D Panario, A Viola ACM Transactions on Algorithms (TALG) 6 (3), 1-45, 2010 | 19 | 2010 |
Amalia Duch BrownAssociate Professor at Universitat Politècnica de CatalunyaVerified email at cs.upc.edu
