2009 |
28 | EE | Conrado Martínez,
Helmut Prodinger:
Moves and displacements of particular elements in Quicksort.
Theor. Comput. Sci. 410(21-23): 2279-2284 (2009) |
2008 |
27 | EE | Conrado Martínez,
Lucia Moura,
Daniel Panario,
Brett Stevens:
Algorithms to Locate Errors Using Covering Arrays.
LATIN 2008: 504-519 |
2005 |
26 | EE | Amalia Duch,
Conrado Martínez:
Improving the performance of multidimensional search using fingers.
ACM Journal of Experimental Algorithmics 10: (2005) |
25 | EE | Conrado Martínez,
Xavier Molinero:
Efficient iteration in admissible combinatorial classes.
Theor. Comput. Sci. 346(2-3): 388-417 (2005) |
2004 |
24 | | Conrado Martínez:
Patial Quicksort.
ALENEX/ANALC 2004: 224-228 |
23 | EE | Conrado Martinez,
Daniel Panario,
Alfredo Viola:
Adaptive sampling for quickselect.
SODA 2004: 447-455 |
22 | EE | Amalia Duch,
Conrado Martínez:
Fingered Multidimensional Search Trees.
WEA 2004: 228-242 |
21 | EE | Conrado Martínez,
Xavier Molinero:
An Experimental Study of Unranking Algorithms.
WEA 2004: 326-340 |
2003 |
20 | EE | Conrado Martínez,
Xavier Molinero:
Generic Algorithms for the Generation of Combinatorial Objects.
MFCS 2003: 572-581 |
2002 |
19 | EE | Amalia Duch,
Conrado Martínez:
On the Average Performance of Orthogonal Range Search in Multidimensional Data Structures.
ICALP 2002: 514-524 |
18 | EE | Amalia Duch,
Conrado Martínez:
On the average performance of orthogonal range search in multidimensional data structures.
J. Algorithms 44(1): 226-245 (2002) |
2001 |
17 | EE | Conrado Martinez,
Alois Panholzer,
Helmut Prodinger:
Partial Match Queries in Relaxed Multidimensional Search Trees.
Algorithmica 29(1): 181-204 (2001) |
16 | | Conrado Martínez,
Xavier Molinero:
A generic approach for the unranking of labeled combinatorial classes.
Random Struct. Algorithms 19(3-4): 472-497 (2001) |
15 | EE | Conrado Martínez,
Salvador Roura:
Optimal Sampling Strategies in Quicksort and Quickselect.
SIAM J. Comput. 31(3): 683-705 (2001) |
2000 |
14 | EE | Conrado Martínez,
Salvador Roura:
On the competitiveness of the move-to-front rule.
Theor. Comput. Sci. 242(1-2): 313-325 (2000) |
1998 |
13 | EE | Conrado Martínez,
Salvador Roura:
Optimal Sampling Strategies in Quicksort.
ICALP 1998: 327-338 |
12 | EE | Amalia Duch,
Vladimir Estivill-Castro,
Conrado Martínez:
Randomized K-Dimensional Binary Search Trees.
ISAAC 1998: 199-208 |
11 | EE | Conrado Martinez,
Alois Panholzer,
Helmut Prodinger:
On the Number of Descendants and Ascendants in Random Search Trees.
Electr. J. Comb. 5: (1998) |
10 | EE | Conrado Martínez,
Salvador Roura:
Randomized Binary Search Trees.
J. ACM 45(2): 288-323 (1998) |
1997 |
9 | | Peter Kirschenhofer,
Helmut Prodinger,
Conrado Martinez:
Analysis of Hoare's FIND algorithm with Median-of-three partition.
Random Struct. Algorithms 10(1-2): 143-156 (1997) |
8 | | Philippe Flajolet,
Xavier Gourdon,
Conrado Martinez:
Patterns in random binary search trees.
Random Struct. Algorithms 11(3): 223-244 (1997) |
1996 |
7 | | Salvador Roura,
Conrado Martínez:
Randomization of Search Trees by Subtree Size.
ESA 1996: 91-106 |
6 | EE | Joaquim Gabarró,
Conrado Martinez,
Xavier Messeguer:
A Design of a Parallel Dictionary Using Skip Lists.
Theor. Comput. Sci. 158(1&2): 1-33 (1996) |
1995 |
5 | EE | Peter Kirschenhofer,
Conrado Martinez,
Helmut Prodinger:
Analysis of an Optimized Search Algorithm for Skip Lists.
Theor. Comput. Sci. 144(1&2): 199-220 (1995) |
1993 |
4 | | Rafael Casas,
Josep Díaz,
Conrado Martinez:
Average-Case Analysis on Simple Families of Trees Using a Balanced Probability Model.
Theor. Comput. Sci. 117(1&2): 99-112 (1993) |
1992 |
3 | | Ricardo A. Baeza-Yates,
Rafael Casas,
Josep Díaz,
Conrado Martinez:
On the Average Size of the Intersection of Binary Trees.
SIAM J. Comput. 21(1): 24-32 (1992) |
1991 |
2 | | Conrado Martinez:
Average-case Analysis of Equality of Binary Trees Under the BST Probability Model.
FCT 1991: 350-359 |
1 | | Rafael Casas,
Josep Díaz,
Conrado Martinez:
Static on Random Trees.
ICALP 1991: 186-203 |