Carlos Zamora-Cura

According to our database, Carlos Zamora-Cura authored at least 5 papers between 1999 and 2004.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2004

Expected worst-case partial match in random quadtries.

Luc Devroye, Carlos Zamora-Cura

Discret. Appl. Math., 2004

2001

Analysis of range search for random k-d trees.

Philippe Chanzy, Luc Devroye, Carlos Zamora-Cura

Acta Informatica, 2001

2000

Squarish <i>k</i>-<i>d</i> Trees.

Luc Devroye, Jean Jabbour, Carlos Zamora-Cura

SIAM J. Comput., 2000

Universal Measuring Devices without Gradations.

Jin Akiyama, Hiroshi Fukuda, Gisaku Nakamura, Toshinori Sakai, Jorge Urrutia, Carlos Zamora-Cura

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

1999

On the complexity of branch-and-bound search for random trees.

Luc Devroye, Carlos Zamora-Cura

Random Struct. Algorithms, 1999