Conrado Martinez - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 18 from 18

2014

The rth Smallest Part Size of a Random Integer PartitionZhicheng Gao, Conrado Martinez, Daniel Panario, L. Bruce Richmond. int, 14A, 2014. [doi]

2011

The Swedish Leader Election Protocol: Analysis and VariationsGuy Louchard, Conrado Martinez, Helmut Prodinger. analco 2011: 127-134 [doi]

2005

Efficient iteration in admissible combinatorial classesConrado Martinez, Xavier Molinero. TCS, 346(2-3):388-417, 2005. [doi]

2004

Patial QuicksortConrado Martinez. alenex 2004: 224-228

An Experimental Study of Unranking AlgorithmsConrado Martinez, Xavier Molinero. wea 2004: 326-340 [doi]

Adaptive sampling for quickselectConrado Martinez, Daniel Panario, Alfredo Viola. soda 2004: 447-455 [doi]

2002

On the Average Performance of Orthogonal Range Search in Multidimensional Data StructuresAmalia Duch, Conrado Martinez. icalp 2002: 514-524 [doi]

2001

A generic approach for the unranking of labeled combinatorial classesConrado Martinez, Xavier Molinero. rsa, 19(3-4):472-497, 2001.

Partial Match Queries in Relaxed Multidimensional Search TreesConrado Martinez, Alois Panholzer, Helmut Prodinger. algorithmica, 29(1):181-204, 2001. [doi]

1998

On the Number of Descendants and Ascendants in Random Search TreesConrado Martinez, Alois Panholzer, Helmut Prodinger. combinatorics, 5, 1998. [doi]

1997

Patterns in random binary search treesPhilippe Flajolet, Xavier Gourdon, Conrado Martinez. rsa, 11(3):223-244, 1997.

Analysis of Hoare s FIND algorithm with Median-of-three partitionPeter Kirschenhofer, Helmut Prodinger, Conrado Martinez. rsa, 10(1-2):143-156, 1997.

1996

A Design of a Parallel Dictionary Using Skip ListsJoaquim Gabarró, Conrado Martinez, Xavier Messeguer. TCS, 158(1&2):1-33, 1996. [doi]

1995

Analysis of an Optimized Search Algorithm for Skip ListsPeter Kirschenhofer, Conrado Martinez, Helmut Prodinger. TCS, 144(1&2):199-220, 1995. [doi]

1993

Average-Case Analysis on Simple Families of Trees Using a Balanced Probability ModelRafael Casas, Josep Díaz, Conrado Martinez. TCS, 117(1&2):99-112, 1993.

1992

On the Average Size of the Intersection of Binary TreesRicardo A. Baeza-Yates, Rafael Casas, Josep Díaz, Conrado Martinez. SICOMP, 21(1):24-32, 1992.

1991

Static on Random TreesRafael Casas, Josep Díaz, Conrado Martinez. icalp 1991: 186-203

Average-case Analysis of Equality of Binary Trees Under the BST Probability ModelConrado Martinez. fct 1991: 350-359

Sign in or sign up to see more results.

runs on WebDSL