Search the dblp DataBase

Publications of Author

1. Conrado Martínez
   Patial Quicksort. [Citation Graph (0, 0)][DBLP]
   ALENEX/ANALC, 2004, pp:224-228 [Conf]
   
2. Salvador Roura, Conrado Martínez
   Randomization of Search Trees by Subtree Size. [Citation Graph (0, 0)][DBLP]
   ESA, 1996, pp:91-106 [Conf]
   
3. Amalia Duch, Conrado Martínez
   On the Average Performance of Orthogonal Range Search in Multidimensional Data Structures. [Citation Graph (0, 0)][DBLP]
   ICALP, 2002, pp:514-524 [Conf]
   
4. Conrado Martínez, Salvador Roura
   Optimal Sampling Strategies in Quicksort. [Citation Graph (0, 0)][DBLP]
   ICALP, 1998, pp:327-338 [Conf]
   
5. Amalia Duch, Vladimir Estivill-Castro, Conrado Martínez
   Randomized K-Dimensional Binary Search Trees. [Citation Graph (0, 0)][DBLP]
   ISAAC, 1998, pp:199-208 [Conf]
   
6. Conrado Martínez, Xavier Molinero
   Generic Algorithms for the Generation of Combinatorial Objects. [Citation Graph (0, 0)][DBLP]
   MFCS, 2003, pp:572-581 [Conf]
   
7. Conrado Martínez, Xavier Molinero
   An Experimental Study of Unranking Algorithms. [Citation Graph (0, 0)][DBLP]
   WEA, 2004, pp:326-340 [Conf]
   
8. Amalia Duch, Conrado Martínez
   Fingered Multidimensional Search Trees. [Citation Graph (0, 0)][DBLP]
   WEA, 2004, pp:228-242 [Conf]
   
9. Conrado Martínez, Salvador Roura
   Randomized Binary Search Trees. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1998, v:45, n:2, pp:288-323 [Journal]
   
10. Amalia Duch, Conrado Martínez
    On the average performance of orthogonal range search in multidimensional data structures. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:44, n:1, pp:226-245 [Journal]
    
11. Amalia Duch, Conrado Martínez
    Improving the performance of multidimensional search using fingers. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2005, v:10, n:, pp:- [Journal]
    
12. Conrado Martínez, Xavier Molinero
    A generic approach for the unranking of labeled combinatorial classes. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:19, n:3-4, pp:472-497 [Journal]
    
13. Conrado Martínez, Salvador Roura
    Optimal Sampling Strategies in Quicksort and Quickselect. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:3, pp:683-705 [Journal]
    
14. Conrado Martínez, Xavier Molinero
    Efficient iteration in admissible combinatorial classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:346, n:2-3, pp:388-417 [Journal]
    
15. Conrado Martínez, Salvador Roura
    On the competitiveness of the move-to-front rule. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:242, n:1-2, pp:313-325 [Journal]
    
16. 
    Interval Sorting. [Citation Graph (, )][DBLP]
    
    
17. 
    Algorithms to Locate Errors Using Covering Arrays. [Citation Graph (, )][DBLP]
    
    
18. 
    Rank Selection in Multidimensional Data. [Citation Graph (, )][DBLP]