On the complexity of branch-and-bound search for random trees. - Luc Devroye; Carlos Zamora-Cura (Random Struct. Algorithms, 1999)

Universal Measuring Devices without Gradations. - Jin Akiyama; Hiroshi Fukuda; Gisaku Nakamura; Toshinori Sakai; Jorge Urrutia; Carlos Zamora-Cura (JCDCG, 2000)

Squarish k-d Trees. - Luc Devroye; Jean Jabbour; Carlos Zamora-Cura (SIAM J. Comput., 2000)

Analysis of range search for random k-d trees. - Philippe Chanzy; Luc Devroye; Carlos Zamora-Cura (Acta Informatica, 2001)

Expected worst-case partial match in random quadtries. - Luc Devroye; Carlos Zamora-Cura (Discret. Appl. Math., 2004)