Publication List: Journals and Conferences

[1] R. Casas, J. Díaz, and C. Martínez. Statistics on random trees. In J. Leach, B. Monien, and M. Rodríguez-Artalejo, editors, Proc. of the 18thInt. Col. on Automata, Languages and Programming (ICALP), volume 510 of Lecture Notes in Computer Science, pages 186-203. Springer-Verlag, 1991. Invited lecture. [ bib ]
[2] C. Martínez. Average-case analysis of equality of binary trees. In L. Budach, editor, Proc. of the 8thInt. Conf. on Fundamentals of Computation Theory (FCT), volume 529 of Lecture Notes in Computer Science, pages 350-359. Springer-Verlag, 1991. [ bib ]
[3] R. Casas, J. Díaz, and C. Martínez. Average-case analysis on simple families of trees using a balanced probability model. In M. Delest, G. Jacob, and P. Leroux, editors, Proc. of the 3rdInt. Col. on Formal Power Series and Algebraic Combinatorics (FPSAC), pages 133-143. LaBRI, 1991. See also  [5]. [ bib ]
[4] R. Baeza-Yates, R. Casas, J. Díaz, and C. Martínez. On the average size of the intersection of binary trees. SIAM J. Comput., 21(1):24-32, 1992. [ bib ]
[5] R. Casas, J. Díaz, and C. Martínez. Average-case analysis on simple families of trees using a balanced probability model. Theoret. Comput. Sci., 117:99-112, 1993. [ bib ]
[6] J. Gabarró, C. Martínez, and X. Messeguer. Parallel update and search in skip lists. In R. Baeza-Yates, editor, Computer Science 2: Research and Applications. Proc. of the 13thInt. Conf. Chilean Computer Science Society (SCCC), pages 15-26. Plenum Press, 1994. See also  [9]. [ bib ]
[7] P. Kirschenhofer, C. Martínez, and H. Prodinger. Analysis of an optimized search algorithm for skip lists. Theoret. Comput. Sci., 144:199-220, 1995. [ bib | .pdf ]
[8] S. Roura and C. Martínez. Randomization of search trees by subtree size. In J. Díaz and M.J. Serna, editors, Proc. of the 4th European Symposium on Algorithms (ESA), volume 1136 of Lecture Notes in Computer Science, pages 91-106. Springer-Verlag, 1996. See also  [15]. [ bib ]
[9] J. Gabarró, C. Martínez, and X. Messeguer. A design of a parallel dictionary using skip lists. Theoret. Comput. Sci., 158:1-33, 1996. [ bib | .pdf ]
[10] G. Valiente and C. Martínez. An algorithms for graph pattern-matching. In Proc. of the 4thSouth American Workshop on String Processing, volume 8 of International Informatics Series, pages 180-197. Carleton University Press, 1997. [ bib ]
[11] Ph. Flajolet, X. Gourdon, and C. Martínez. Patterns in random binary search trees. Random Structures & Algorithms, 11(3):223-245, 1997. [ bib | .pdf ]
[12] P. Kirschenhofer, H. Prodinger, and C. Martínez. Analysis of Hoare's FIND algorithm with median-of-three partition. Random Structures & Algorithms, 10(1-2):143-156, 1997. [ bib | .pdf ]
[13] A. Duch, V. Estivill-Castro, and C. Martínez. Randomized k-dimensional binary search trees. In K.-Y. Chwa and O.H. Ibarra, editors, Proc. of the 9thInt. Symp. on Algorithms and Computation (ISAAC), volume 1533 of Lecture Notes in Computer Science, pages 199-208. Springer-Verlag, 1998. [ bib ]
[14] C. Martínez and S. Roura. Optimal sampling strategies in quicksort. In K.G. Larsen, S. Skyum, and G. Winskel, editors, Proc. of the 25thInt. Col. on Automata, Languages and Programming (ICALP), volume 1443 of Lecture Notes in Computer Science, pages 327-338. Springer-Verlag, 1998. See also  [21]. [ bib ]
[15] C. Martínez and S. Roura. Randomized binary search trees. J. Assoc. Comput. Mach., 45(2):288-323, 1998. [ bib | .pdf ]
[16] C. Martínez, A. Panholzer, and H. Prodinger. On the number of descendants and ascendants in random search trees. Electronic Journal of Combinatorics, 5(#R20), 1998. [ bib | .pdf ]
[17] C. Martínez and X. Molinero. Unranking of labelled combinatorial structures. In D. Krob, A. A. Mikhalev, and A. V. Mikhalev, editors, Proc. of the 12thInt. Col. on Formal Power Series and Algebraic Combinatorics (FPSAC), pages 288-299. Springer-Verlag, 2000. See also  [20]. [ bib ]
[18] C. Martínez and S. Roura. On the competitiveness of the move-to-front rule. Theoret. Comput. Sci., 242(1-2):313-325, 2000. [ bib | .pdf ]
[19] C. Martínez and X. Molinero. Generic algorithms for the exhaustive generation of labelled objects. In Proc. of the 4thWorkshop on Random Generation of Combinatorial Structures and Bijective Combinatorics (GASCOM'01), pages 53-58, 2001. See also  [33]. [ bib ]
[20] C. Martínez and X. Molinero. A generic approach for the unranking of labelled combinatorial classes. Random Structures & Algorithms, 19(3-4):472-497, 2001. [ bib | .pdf ]
[21] C. Martínez and S. Roura. Optimal sampling strategies in quicksort and quickselect. SIAM J. Comput., 31(3):683-705, 2001. [ bib | .pdf ]
[22] C. Martínez, A. Panholzer, and H. Prodinger. Partial match in relaxed multidimensional search trees. Algorithmica, 29(1-2):181-204, 2001. [ bib | .pdf ]
[23] C. Martínez, D. Panario, and A. Viola. Analysis of quickfind with small subfiles. In B. Chauvin, Ph. Flajolet, D. Gardy, and A. Mokkadem, editors, Proc. of the 2ndCol. on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities (MathInfo), Trends in Mathematics, pages 329-340. Birkhäuser Verlag, 2002. [ bib ]
[24] A. Duch and C. Martínez. On the average performance of orthogonal range search in multidimensional data structures. In P. Widmayer, F. Triguero, R. Morales, M. Hennessy, S. Eidenbenz, and R. Conejo, editors, Proc. of the 29thInt. Col. on Automata, Languages and Programming (ICALP), volume 2380 of Lecture Notes in Computer Science, pages 514-524. Springer-Verlag, 2002. See also  [25]. [ bib ]
[25] A. Duch and C. Martínez. On the average performance of orthogonal range search in multidimensional data structures. J. Algorithms, 44(1):226-245, 2002. [ bib | .pdf ]
[26] C. Martínez and X. Molinero. Generic algorithms for the generation of combinatorial objects. In B. Rovan and P. Vojtás, editors, Proc. of the 28th Int. Symposium on Mathematical Foundations of Computer Science (MFCS), volume 2747 of Lecture Notes in Computer Science. Springer-Verlag, 2003. [ bib ]
[27] C. Martínez and X. Molinero. An efficient generic algorithm for the generation of unlabelled cycles. In M. Drmota, Ph. Flajolet, D. Gardy, and B. Gittenberger, editors, Proc. of the 3rdCol. on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities (MathInfo), Trends in Mathematics, pages 187-197. Birkhäuser Verlag, 2004. [ bib ]
[28] A. Duch and C. Martínez. Fingered multidimensional search trees. In C. C. Ribeiro and S. L. Martins, editors, Proc. of the 3rd Workshop on Efficient and Experimental Algorithms (WEA), volume 3059 of Lecture Notes in Computer Science, pages 228-242. Springer-Verlag, 2004. See also  [32]. [ bib ]
[29] C. Martínez and X. Molinero. An experimental study of unranking algorithms. In C. C. Ribeiro and S. L. Martins, editors, Proc. of the 3rd Workshop on Efficient and Experimental Algorithms (WEA), volume 3059 of Lecture Notes in Computer Science, pages 326-340. Springer-Verlag, 2004. [ bib ]
[30] C. Martínez. Partial quicksort. In L. Arge, G.F. Italiano, and R. Sedgewick, editors, Proc. of the 6thACM-SIAM Workshop on Algorithm Engineering and Experiments (ALENEX) and the 1stACM-SIAM Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pages 224-228. SIAM, 2004. [ bib ]
[31] C. Martínez, D. Panario, and A. Viola. Adaptive sampling for quickselect. In Proc. of the 15thAnnual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 440-448, 2004. [ bib ]
[32] A. Duch and C. Martínez. Improving the performance of multidimensional search using fingers. J. Experimental Algorithmics, 10(2.4), 2005. [ bib | .pdf ]
[33] C. Martínez and X. Molinero. Efficient iteration in admissible combinatorial classes. Theoret. Comput. Sci., 346(2-3):388-417, 2005. [ bib ]
[34] J. Daligault and C. Martínez. On the variance of quickselect. In R. Raman, R. Sedgewick, and M.F. Stallmann, editors, Proc. of the 8thACM-SIAM Workshop on Algorithm Engineering and Experiments (ALENEX) and the 3rdACM-SIAM Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pages 205-210. SIAM, 2006. [ bib ]
[35] A. Duch and C. Martínez. On the average cost of insertions on random relaxed k-d trees. In D. Applegate, G. S. Brodal, D. Panario, and R. Sedgewick, editors, Proc. of the 9thACM-SIAM Workshop on Algorithm Engineering and Experiments (ALENEX) and the 4thACM-SIAM Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pages 194-200. SIAM, 2007. [ bib ]
[36] A. Duch and C. Martínez. Updating relaxed k-d trees. ACM Trans. on Algorithms, 2007. Accepted for publication. [ bib ]
[37] C. Martínez, L. Moura, D. Panario, and B. Stevens. Algorithms to locate errors using covering arrays. In Proc. of the thLatin American Theoretical Informatics Conference (LATIN), Lecture Notes in Computer Science. Springer-Verlag, 2008. Accepted for publication. [ bib ]
[38] C. Martínez, A. Panholzer, and H. Prodinger. Generating random derangements. In Proc. of the 10thACM-SIAM Workshop on Algorithm Engineering and Experiments (ALENEX) and the 5thACM-SIAM Workshop on Analytic Algorithmics and Combinatorics (ANALCO). SIAM, 2008. Accepted for publication. [ bib ]
[39] C. Martínez and H. Prodinger. Moves and displacements of particular elements in quicksort. Theoret. Comput. Sci., 2008. Submitted. [ bib ]
[40] C. Martínez, D. Panario, and A. Viola. Adaptive sampling strategies for quickselect. ACM Trans. on Algorithms, 2008. Accepted for publication. [ bib ]

This file has been generated by bibtex2html 1.85.