default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDConrado Martínez
Person information
- affiliation: Polytechnic University of Catalonia, Barcelona, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c32]Javier Larrosa, Conrado Martínez, Emma Rollon:
Theoretical and Empirical Analysis of Cost-Function Merging for Implicit Hitting Set WCSP Solving. AAAI 2024: 8057-8064- 2023
- [c31]Conrado Martínez
, Alfredo Viola, Jun Wang:
Unbiased Similarity Estimators Using Samples. SISAP 2023: 56-63 - 2022
- [c30]Amalia Duch, Conrado Martínez:
Partial Match Queries in Quad- K-d Trees. AofA 2022: 8:1-8:16 - [c29]Jérémie O. Lumbroso, Conrado Martínez:
Affirmative Sampling: Theory and Applications. AofA 2022: 12:1-12:17 - [c28]Conrado Martínez, Gonzalo Solera-Pardo:
LotterySampling: A Randomized Algorithm for the Heavy Hitters and Top-k Problems in Data Streams. COCOON 2022: 24-35 - [c27]Conrado Martínez, Cyril Nicaud, Pablo Rotondo:
A Probabilistic Model Revealing Shortcomings in Lua's Hybrid Tables. COCOON 2022: 381-393 - [c26]Amalia Duch, Conrado Martínez, Mercè Pons, Salvador Roura:
Median and Hybrid Median K-Dimensional Trees. LATIN 2022: 38-53 - [i4]Conrado Martínez, Cyril Nicaud, Pablo Rotondo:
A Probabilistic Model Revealing Shortcomings in Lua's Hybrid Tables. CoRR abs/2208.13602 (2022)
2010 – 2019
- 2019
- [c25]Conrado Martínez, Markus Nebel, Sebastian Wild:
Sesquickselect: One and a half pivots for cache-efficient selection. ANALCO 2019: 54-66 - 2018
- [c24]Rosa M. Jiménez, Conrado Martínez:
On Deletions in Open Addressing Hashing. ANALCO 2018: 23-31 - [c23]Amalia Duch, Gustavo Lau, Conrado Martínez:
Fixed Partial Match Queries in Quadtrees. AofA 2018: 20:1-20:18 - [i3]Conrado Martínez, Markus Nebel, Sebastian Wild:
Sesquickselect: One and a half pivots for cache-efficient selection. CoRR abs/1810.12322 (2018) - 2017
- [e3]Conrado Martínez, Mark Daniel Ward:
Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2017, Barcelona, Spain, Hotel Porta Fira, January 16-17, 2017. SIAM 2017, ISBN 978-1-61197-477-5 [contents] - 2016
- [j27]Markus E. Nebel, Sebastian Wild, Conrado Martínez:
Analysis of Pivot Sampling in Dual-Pivot Quicksort: A Holistic Analysis of Yaroslavskiy's Partitioning Scheme. Algorithmica 75(4): 632-683 (2016) - [j26]Amalia Duch, Gustavo Lau, Conrado Martínez:
On the Cost of Fixed Partial Match Queries in K-d Trees. Algorithmica 75(4): 684-723 (2016) - [c22]Amalia Duch, Gustavo Lau, Conrado Martínez:
Random Partial Match in Quad-K-d Trees. LATIN 2016: 376-389 - 2015
- [c21]Conrado Martínez, Markus E. Nebel, Sebastian Wild:
Analysis of Branch Misses in Quicksort. ANALCO 2015: 114-128 - 2014
- [j25]Ahmed Helmi, Conrado Martínez, Alois Panholzer:
Analysis of the Strategy "Hiring Above the $$m$$ m -th Best Candidate". Algorithmica 70(2): 267-300 (2014) - [j24]Zhicheng Gao, Conrado Martinez, Daniel Panario, L. Bruce Richmond:
The rth Smallest Part Size of a Random Integer Partition. Integers 14A: A3 (2014) - [j23]Hua-Huai Chern, María-Inés Fernández-Camacho, Hsien-Kuei Hwang, Conrado Martínez:
Psi-series method for equality of random trees and quadratic convolution recurrences. Random Struct. Algorithms 44(1): 67-108 (2014) - [j22]Amalia Duch, Rosa M. Jiménez, Conrado Martínez:
Selection by rank in K-dimensional binary search trees. Random Struct. Algorithms 45(1): 14-37 (2014) - [i2]Conrado Martínez, Markus E. Nebel, Sebastian Wild:
Analysis of Branch Misses in Quicksort. CoRR abs/1411.2059 (2014) - [i1]Sebastian Wild, Markus E. Nebel, Conrado Martínez:
Analysis of Pivot Sampling in Dual-Pivot Quicksort. CoRR abs/1412.0193 (2014) - 2013
- [j21]Hsien-Kuei Hwang, Conrado Martínez, Robert Sedgewick:
Guest Editorial. Algorithmica 66(4): 739-740 (2013) - 2012
- [c20]Ahmed Helmi, Conrado Martínez, Alois Panholzer:
Hiring above the m-th Best Candidate: A Generalization of Records in Permutations. LATIN 2012: 470-481 - [c19]Hervé Daudé, Conrado Martínez, Vonjy Rasendrahasina, Vlady Ravelomanana:
The MAX-CUT of sparse random graphs. SODA 2012: 265-271 - [e2]Conrado Martínez, Hsien-Kuei Hwang:
Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics, ANALCO 2012, Kyoto, Japan, January 16, 2012. SIAM 2012, ISBN 978-1-61197-213-9 [contents] - 2011
- [j20]Conrado Martínez, Alois Panholzer, Helmut Prodinger:
The analysis of Range Quickselect and related problems. Theor. Comput. Sci. 412(46): 6537-6555 (2011) - [c18]Guy Louchard, Conrado Martinez, Helmut Prodinger:
The Swedish Leader Election Protocol: Analysis and Variations. ANALCO 2011: 127-134 - 2010
- [j19]Conrado Martínez, Daniel Panario, Alfredo Viola:
Adaptive sampling strategies for quickselects. ACM Trans. Algorithms 6(3): 53:1-53:45 (2010) - [c17]Rosa M. Jiménez, Conrado Martínez:
Interval Sorting. ICALP (1) 2010: 238-249 - [c16]Amalia Duch, Rosa M. Jiménez, Conrado Martínez:
Rank Selection in Multidimensional Data. LATIN 2010: 674-685
2000 – 2009
- 2009
- [j18]Conrado Martínez, Lucia Moura, Daniel Panario, Brett Stevens:
Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms. SIAM J. Discret. Math. 23(4): 1776-1799 (2009) - [j17]Amalia Duch, Conrado Martínez:
Updating relaxed K-d trees. ACM Trans. Algorithms 6(1): 4:1-4:24 (2009) - [j16]Conrado Martínez, Helmut Prodinger:
Moves and displacements of particular elements in Quicksort. Theor. Comput. Sci. 410(21-23): 2279-2284 (2009) - [e1]Conrado Martínez, Robert Sedgewick:
Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2009, New York, New York, USA, January 03, 2009. SIAM 2009, ISBN 978-0-89871-932-1 [contents] - 2008
- [c15]Conrado Martínez, Alois Panholzer, Helmut Prodinger:
Generating Random Derangements. ANALCO 2008: 234-240 - [c14]Conrado Martínez, Lucia Moura, Daniel Panario, Brett Stevens:
Algorithms to Locate Errors Using Covering Arrays. LATIN 2008: 504-519 - 2007
- [c13]Amalia Duch, Conrado Martínez:
On the Average Cost of Insertions on Random Relaxed K-d Trees. ANALCO 2007: 194-200 - 2006
- [c12]Jean Daligault, Conrado Martínez:
On the Variance of Quickselect. ANALCO 2006: 205-210 - 2005
- [j15]Amalia Duch, Conrado Martínez:
Improving the performance of multidimensional search using fingers. ACM J. Exp. Algorithmics 10 (2005) - [j14]Conrado Martínez, Xavier Molinero:
Efficient iteration in admissible combinatorial classes. Theor. Comput. Sci. 346(2-3): 388-417 (2005) - 2004
- [c11]Conrado Martínez:
Patial Quicksort. ALENEX/ANALC 2004: 224-228 - [c10]Conrado Martinez, Daniel Panario, Alfredo Viola:
Adaptive sampling for quickselect. SODA 2004: 447-455 - [c9]Amalia Duch, Conrado Martínez:
Fingered Multidimensional Search Trees. WEA 2004: 228-242 - [c8]Conrado Martínez, Xavier Molinero:
An Experimental Study of Unranking Algorithms. WEA 2004: 326-340 - 2003
- [c7]Conrado Martínez, Xavier Molinero:
Generic Algorithms for the Generation of Combinatorial Objects. MFCS 2003: 572-581 - 2002
- [j13]Amalia Duch, Conrado Martínez:
On the average performance of orthogonal range search in multidimensional data structures. J. Algorithms 44(1): 226-245 (2002) - [c6]Amalia Duch, Conrado Martínez:
On the Average Performance of Orthogonal Range Search in Multidimensional Data Structures. ICALP 2002: 514-524 - 2001
- [j12]Conrado Martinez, Alois Panholzer, Helmut Prodinger:
Partial Match Queries in Relaxed Multidimensional Search Trees. Algorithmica 29(1): 181-204 (2001) - [j11]Conrado Martínez, Xavier Molinero:
A generic approach for the unranking of labeled combinatorial classes. Random Struct. Algorithms 19(3-4): 472-497 (2001) - [j10]Conrado Martínez, Salvador Roura:
Optimal Sampling Strategies in Quicksort and Quickselect. SIAM J. Comput. 31(3): 683-705 (2001) - 2000
- [j9]Conrado Martínez, Salvador Roura:
On the competitiveness of the move-to-front rule. Theor. Comput. Sci. 242(1-2): 313-325 (2000)
1990 – 1999
- 1998
- [j8]Conrado Martinez, Alois Panholzer, Helmut Prodinger:
On the Number of Descendants and Ascendants in Random Search Trees. Electron. J. Comb. 5 (1998) - [j7]Conrado Martínez, Salvador Roura:
Randomized Binary Search Trees. J. ACM 45(2): 288-323 (1998) - [c5]Conrado Martínez, Salvador Roura:
Optimal Sampling Strategies in Quicksort. ICALP 1998: 327-338 - [c4]Amalia Duch, Vladimir Estivill-Castro, Conrado Martínez:
Randomized K-Dimensional Binary Search Trees. ISAAC 1998: 199-208 - 1997
- [j6]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) - [j5]Philippe Flajolet, Xavier Gourdon, Conrado Martinez:
Patterns in random binary search trees. Random Struct. Algorithms 11(3): 223-244 (1997) - 1996
- [j4]Joaquim Gabarró, Conrado Martinez, Xavier Messeguer:
A Design of a Parallel Dictionary Using Skip Lists. Theor. Comput. Sci. 158(1&2): 1-33 (1996) - [c3]Salvador Roura, Conrado Martínez:
Randomization of Search Trees by Subtree Size. ESA 1996: 91-106 - 1995
- [j3]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
- [j2]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
- [b1]Conrado Martínez:
Statistics under the BST model. University Barcelona, 1992, pp. 1-141 - [j1]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
- [c2]Conrado Martinez:
Average-case Analysis of Equality of Binary Trees Under the BST Probability Model. FCT 1991: 350-359 - [c1]Rafael Casas, Josep Díaz, Conrado Martinez:
Static on Random Trees. ICALP 1991: 186-203
Coauthor Index
aka: Amalia Duch
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
