Average-case Analysis of Equality of Binary Trees Under the BST Probability Model. - Conrado Martinez (FCT, 1991)

Static on Random Trees. - Rafael Casas; Josep Díaz; Conrado Martinez (ICALP, 1991)

Statistics under the BST model. - Conrado Martínez (1992)

On the Average Size of the Intersection of Binary Trees. - Ricardo A. Baeza-Yates; Rafael Casas; Josep Díaz; Conrado Martinez (SIAM J. Comput., 1992)

Average-Case Analysis on Simple Families of Trees Using a Balanced Probability Model. - Rafael Casas; Josep Díaz; Conrado Martinez (Theor. Comput. Sci., 1993)

Analysis of an Optimized Search Algorithm for Skip Lists. - Peter Kirschenhofer; Conrado Martinez; Helmut Prodinger (Theor. Comput. Sci., 1995)

Randomization of Search Trees by Subtree Size. - Salvador Roura; Conrado Martínez (ESA, 1996)

A Design of a Parallel Dictionary Using Skip Lists. - Joaquim Gabarró; Conrado Martinez; Xavier Messeguer (Theor. Comput. Sci., 1996)

Patterns in random binary search trees. - Philippe Flajolet; Xavier Gourdon; Conrado Martinez (Random Struct. Algorithms, 1997)

Analysis of Hoare's FIND algorithm with Median-of-three partition. - Peter Kirschenhofer; Helmut Prodinger; Conrado Martinez (Random Struct. Algorithms, 1997)

Optimal Sampling Strategies in Quicksort. - Conrado Martínez; Salvador Roura (ICALP, 1998)

Randomized K-Dimensional Binary Search Trees. - Amalia Duch; Vladimir Estivill-Castro; Conrado Martínez (ISAAC, 1998)

On the Number of Descendants and Ascendants in Random Search Trees. - Conrado Martinez; Alois Panholzer; Helmut Prodinger (Electron. J. Comb., 1998)

Randomized Binary Search Trees. - Conrado Martínez; Salvador Roura (J. ACM, 1998)

On the competitiveness of the move-to-front rule. - Conrado Martínez; Salvador Roura (Theor. Comput. Sci., 2000)

Partial Match Queries in Relaxed Multidimensional Search Trees. - Conrado Martinez; Alois Panholzer; Helmut Prodinger (Algorithmica, 2001)

A generic approach for the unranking of labeled combinatorial classes. - Conrado Martínez; Xavier Molinero (Random Struct. Algorithms, 2001)

Optimal Sampling Strategies in Quicksort and Quickselect. - Conrado Martínez; Salvador Roura (SIAM J. Comput., 2001)

On the average performance of orthogonal range search in multidimensional data structures. - Amalia Duch; Conrado Martínez (J. Algorithms, 2002)

Generic Algorithms for the Generation of Combinatorial Objects. - Conrado Martínez; Xavier Molinero (MFCS, 2003)

Patial Quicksort. - Conrado Martínez (ALENEX/ANALC, 2004)

Adaptive sampling for quickselect. - Conrado Martinez; Daniel Panario; Alfredo Viola (SODA, 2004)

Fingered Multidimensional Search Trees. - Amalia Duch; Conrado Martínez (WEA, 2004)

An Experimental Study of Unranking Algorithms. - Conrado Martínez; Xavier Molinero (WEA, 2004)

Improving the performance of multidimensional search using fingers. - Amalia Duch; Conrado Martínez (ACM J. Exp. Algorithmics, 2005)

Efficient iteration in admissible combinatorial classes. - Conrado Martínez; Xavier Molinero (Theor. Comput. Sci., 2005)

On the Variance of Quickselect. - Jean Daligault; Conrado Martínez (ANALCO, 2006)

On the Average Cost of Insertions on Random Relaxed K-d Trees. - Amalia Duch; Conrado Martínez (ANALCO, 2007)

Generating Random Derangements. - Conrado Martínez; Alois Panholzer; Helmut Prodinger (ANALCO, 2008)

Algorithms to Locate Errors Using Covering Arrays. - Conrado Martínez; Lucia Moura; Daniel Panario; Brett Stevens (LATIN, 2008)

Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms. - Conrado Martínez; Lucia Moura; Daniel Panario; Brett Stevens (SIAM J. Discret. Math., 2009)

Updating relaxed K-d trees. - Amalia Duch; Conrado Martínez (ACM Trans. Algorithms, 2009)

Moves and displacements of particular elements in Quicksort. - Conrado Martínez; Helmut Prodinger (Theor. Comput. Sci., 2009)

Interval Sorting. - Rosa M. Jiménez; Conrado Martínez (ICALP (1), 2010)

Rank Selection in Multidimensional Data. - Amalia Duch; Rosa M. Jiménez; Conrado Martínez (LATIN, 2010)

Adaptive sampling strategies for quickselects. - Conrado Martínez; Daniel Panario; Alfredo Viola (ACM Trans. Algorithms, 2010)

The Swedish Leader Election Protocol: Analysis and Variations. - Guy Louchard; Conrado Martinez; Helmut Prodinger (ANALCO, 2011)

The analysis of Range Quickselect and related problems. - Conrado Martínez; Alois Panholzer; Helmut Prodinger (Theor. Comput. Sci., 2011)

Hiring above the m-th Best Candidate: A Generalization of Records in Permutations. - Ahmed Helmi 001; Conrado Martínez; Alois Panholzer (LATIN, 2012)

The MAX-CUT of sparse random graphs. - Hervé Daudé; Conrado Martínez; Vonjy Rasendrahasina; Vlady Ravelomanana (SODA, 2012)

Guest Editorial. - Hsien-Kuei Hwang; Conrado Martínez; Robert Sedgewick (Algorithmica, 2013)

Analysis of the Strategy "Hiring Above the $$m$$ m -th Best Candidate". - Ahmed Helmi 001; Conrado Martínez; Alois Panholzer (Algorithmica, 2014)

Analysis of Pivot Sampling in Dual-Pivot Quicksort. - Sebastian Wild; Markus E. Nebel; Conrado Martínez (CoRR, 2014)

The rth Smallest Part Size of a Random Integer Partition. - Zhicheng Gao; Conrado Martinez; Daniel Panario; L. Bruce Richmond (Integers, 2014)

Psi-series method for equality of random trees and quadratic convolution recurrences. - Hua-Huai Chern; María-Inés Fernández-Camacho; Hsien-Kuei Hwang; Conrado Martínez (Random Struct. Algorithms, 2014)

Selection by rank in K-dimensional binary search trees. - Amalia Duch; Rosa M. Jiménez; Conrado Martínez (Random Struct. Algorithms, 2014)

Analysis of Branch Misses in Quicksort. - Conrado Martínez; Markus E. Nebel; Sebastian Wild (ANALCO, 2015)

Random Partial Match in Quad-K-d Trees. - Amalia Duch; Gustavo Lau; Conrado Martínez (LATIN, 2016)

On the Cost of Fixed Partial Match Queries in K-d Trees. - Amalia Duch; Gustavo Lau; Conrado Martínez (Algorithmica, 2016)

Analysis of Pivot Sampling in Dual-Pivot Quicksort: A Holistic Analysis of Yaroslavskiy's Partitioning Scheme. - Markus E. Nebel; Sebastian Wild; Conrado Martínez (Algorithmica, 2016)

On Deletions in Open Addressing Hashing. - Rosa M. Jiménez; Conrado Martínez (ANALCO, 2018)

Fixed Partial Match Queries in Quadtrees. - Amalia Duch; Gustavo Lau; Conrado Martínez (AofA, 2018)

Sesquickselect: One and a half pivots for cache-efficient selection. - Conrado Martínez; Markus Nebel; Sebastian Wild (ANALCO, 2019)

Partial Match Queries in Quad- K-d Trees. - Amalia Duch; Conrado Martínez (AofA, 2022)

Affirmative Sampling: Theory and Applications. - Jérémie O. Lumbroso; Conrado Martínez (AofA, 2022)

A Probabilistic Model Revealing Shortcomings in Lua's Hybrid Tables. - Conrado Martínez; Cyril Nicaud; Pablo Rotondo (COCOON, 2022)

LotterySampling: A Randomized Algorithm for the Heavy Hitters and Top-k Problems in Data Streams. - Conrado Martínez; Gonzalo Solera-Pardo (COCOON, 2022)

Median and Hybrid Median K-Dimensional Trees. - Amalia Duch; Conrado Martínez; Mercè Pons; Salvador Roura (LATIN, 2022)

Unbiased Similarity Estimators Using Samples. - Conrado Martínez; Alfredo Viola; Jun Wang (SISAP, 2023)

Theoretical and Empirical Analysis of Cost-Function Merging for Implicit Hitting Set WCSP Solving. - Javier Larrosa; Conrado Martínez; Emma Rollon (AAAI, 2024)

Impact of the Neighborhood Parameter on Outlier Detection Algorithms. - Félix Iglesias; Conrado Martínez; Tanja Zseby (SISAP, 2024)

Mathematical models to analyze Lua hybrid tables. - Conrado Martínez; Cyril Nicaud; Pablo Rotondo (Theor. Comput. Sci., 2025)