Conrado Martínez

58 papers A* 4A 1B 10C 3Misc 2Journal 24Unranked 10

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	The analysis of partial match queries in random multidimensional trees: A selected survey. Comput. Sci. Rev. Amalia Duch, Hsien-Kuei Hwang, Conrado Martínez, Ralph Neininger
2025	B	`conf`	Fast and Accurate Estimates for External Clustering Validation Measures. SISAP Hugo Sanz-González, Conrado Martínez
2025	J	`jnl`	Mathematical models to analyze Lua hybrid tables. Theor. Comput. Sci. Conrado Martínez, Cyril Nicaud, Pablo Rotondo
2024	B	`conf`	Impact of the Neighborhood Parameter on Outlier Detection Algorithms. SISAP Félix Iglesias, Conrado Martínez, Tanja Zseby
2024	A*	`conf`	Theoretical and Empirical Analysis of Cost-Function Merging for Implicit Hitting Set WCSP Solving. AAAI Javier Larrosa, Conrado Martínez, Emma Rollon
2023	B	`conf`	Unbiased Similarity Estimators Using Samples. SISAP Conrado Martínez, Alfredo Viola, Jun Wang
2022	Misc	`conf`	A Probabilistic Model Revealing Shortcomings in Lua's Hybrid Tables. COCOON Conrado Martínez, Cyril Nicaud, Pablo Rotondo
2022	J	`jnl`	A Probabilistic Model Revealing Shortcomings in Lua's Hybrid Tables. CoRR Conrado Martínez, Cyril Nicaud, Pablo Rotondo
2022	C	`conf`	Affirmative Sampling: Theory and Applications. AofA Jérémie O. Lumbroso, Conrado Martínez
2022	Misc	`conf`	LotterySampling: A Randomized Algorithm for the Heavy Hitters and Top-k Problems in Data Streams. COCOON Conrado Martínez, Gonzalo Solera-Pardo
2022	B	`conf`	Median and Hybrid Median K-Dimensional Trees. LATIN Amalia Duch, Conrado Martínez, Mercè Pons, Salvador Roura
2022	C	`conf`	Partial Match Queries in Quad- K-d Trees. AofA Amalia Duch, Conrado Martínez
2019	—	`conf`	Sesquickselect: One and a half pivots for cache-efficient selection. ANALCO Conrado Martínez, Markus Nebel, Sebastian Wild
2018	C	`conf`	Fixed Partial Match Queries in Quadtrees. AofA Amalia Duch, Gustavo Lau, Conrado Martínez
2018	—	`conf`	On Deletions in Open Addressing Hashing. ANALCO Rosa M. Jiménez, Conrado Martínez
2018	J	`jnl`	Sesquickselect: One and a half pivots for cache-efficient selection. CoRR Conrado Martínez, Markus Nebel, Sebastian Wild
2017	—	`ed.`	Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2017, Barcelona, Spain, Hotel Porta Fira, January 16-17, 2017. ANALCO Conrado Martínez, Mark Daniel Ward
2016	J	`jnl`	Analysis of Pivot Sampling in Dual-Pivot Quicksort: A Holistic Analysis of Yaroslavskiy's Partitioning Scheme. Algorithmica Markus E. Nebel, Sebastian Wild, Conrado Martínez
2016	J	`jnl`	On the Cost of Fixed Partial Match Queries in K-d Trees. Algorithmica Amalia Duch, Gustavo Lau, Conrado Martínez
2016	B	`conf`	Random Partial Match in Quad-K-d Trees. LATIN Amalia Duch, Gustavo Lau, Conrado Martínez
2015	—	`conf`	Analysis of Branch Misses in Quicksort. ANALCO Conrado Martínez, Markus E. Nebel, Sebastian Wild
2014	J	`jnl`	Analysis of Branch Misses in Quicksort. CoRR Conrado Martínez, Markus E. Nebel, Sebastian Wild
2014	J	`jnl`	Analysis of Pivot Sampling in Dual-Pivot Quicksort. CoRR Sebastian Wild, Markus E. Nebel, Conrado Martínez
2014	J	`jnl`	Analysis of the Strategy "Hiring Above the $$m$$ m -th Best Candidate". Algorithmica Ahmed Helmi, Conrado Martínez, Alois Panholzer
2014	J	`jnl`	Psi-series method for equality of random trees and quadratic convolution recurrences. Random Struct. Algorithms Hua-Huai Chern, María-Inés Fernández-Camacho, Hsien-Kuei Hwang, Conrado Martínez
2014	J	`jnl`	Selection by rank in Random Struct. Algorithms Amalia Duch, Rosa M. Jiménez, Conrado Martínez
2013	J	`jnl`	Guest Editorial. Algorithmica Hsien-Kuei Hwang, Conrado Martínez, Robert Sedgewick
2012	B	`conf`	Hiring above the m-th Best Candidate: A Generalization of Records in Permutations. LATIN Ahmed Helmi, Conrado Martínez, Alois Panholzer
2012	—	`ed.`	Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics, ANALCO 2012, Kyoto, Japan, January 16, 2012 ANALCO Conrado Martínez, Hsien-Kuei Hwang
2012	A*	`conf`	The MAX-CUT of sparse random graphs. SODA Hervé Daudé, Conrado Martínez, Vonjy Rasendrahasina, Vlady Ravelomanana
2011	J	`jnl`	The analysis of Range Quickselect and related problems. Theor. Comput. Sci. Conrado Martínez, Alois Panholzer, Helmut Prodinger
2010	J	`jnl`	Adaptive sampling strategies for quickselects. ACM Trans. Algorithms Conrado Martínez, Daniel Panario, Alfredo Viola
2010	—	`conf`	Interval Sorting. ICALP (1) Rosa M. Jiménez, Conrado Martínez
2010	B	`conf`	Rank Selection in Multidimensional Data. LATIN Amalia Duch, Rosa M. Jiménez, Conrado Martínez
2009	J	`jnl`	Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms. SIAM J. Discret. Math. Conrado Martínez, Lucia Moura, Daniel Panario, Brett Stevens
2009	J	`jnl`	Moves and displacements of particular elements in Quicksort. Theor. Comput. Sci. Conrado Martínez, Helmut Prodinger
2009	—	`ed.`	Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2009, New York, New York, USA, January 03, 2009 ANALCO Conrado Martínez, Robert Sedgewick
2009	J	`jnl`	Updating relaxed ACM Trans. Algorithms Amalia Duch, Conrado Martínez
2008	B	`conf`	Algorithms to Locate Errors Using Covering Arrays. LATIN Conrado Martínez, Lucia Moura, Daniel Panario, Brett Stevens
2008	—	`conf`	Generating Random Derangements. ANALCO Conrado Martínez, Alois Panholzer, Helmut Prodinger
2007	—	`conf`	On the Average Cost of Insertions on Random Relaxed K-d Trees. ANALCO Amalia Duch, Conrado Martínez
2006	—	`conf`	On the Variance of Quickselect. ANALCO Jean Daligault, Conrado Martínez
2005	J	`jnl`	Efficient iteration in admissible combinatorial classes. Theor. Comput. Sci. Conrado Martínez, Xavier Molinero
2005	J	`jnl`	Improving the performance of multidimensional search using fingers. ACM J. Exp. Algorithmics Amalia Duch, Conrado Martínez
2004	—	`conf`	An Experimental Study of Unranking Algorithms. WEA Conrado Martínez, Xavier Molinero
2004	—	`conf`	Fingered Multidimensional Search Trees. WEA Amalia Duch, Conrado Martínez
2004	—	`conf`	Patial Quicksort. ALENEX/ANALC Conrado Martínez
2003	B	`conf`	Generic Algorithms for the Generation of Combinatorial Objects. MFCS Conrado Martínez, Xavier Molinero
2002	A*	`conf`	On the Average Performance of Orthogonal Range Search in Multidimensional Data Structures. ICALP Amalia Duch, Conrado Martínez
2002	J	`jnl`	On the average performance of orthogonal range search in multidimensional data structures. J. Algorithms Amalia Duch, Conrado Martínez
2001	J	`jnl`	A generic approach for the unranking of labeled combinatorial classes. Random Struct. Algorithms Conrado Martínez, Xavier Molinero
2001	J	`jnl`	Optimal Sampling Strategies in Quicksort and Quickselect. SIAM J. Comput. Conrado Martínez, Salvador Roura
2000	J	`jnl`	On the competitiveness of the move-to-front rule. Theor. Comput. Sci. Conrado Martínez, Salvador Roura
1998	A*	`conf`	Optimal Sampling Strategies in Quicksort. ICALP Conrado Martínez, Salvador Roura
1998	J	`jnl`	Randomized Binary Search Trees. J. ACM Conrado Martínez, Salvador Roura
1998	B	`conf`	Randomized K-Dimensional Binary Search Trees. ISAAC Amalia Duch, Vladimir Estivill-Castro, Conrado Martínez
1996	A	`conf`	Randomization of Search Trees by Subtree Size. ESA Salvador Roura, Conrado Martínez
1992	—	`—`	Statistics under the BST model. Conrado Martínez