PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Martínez, Conrado"

Author of the publication

copydeleteadd this publication to your clipboard
On the Cost of Fixed Partial Match Queries in K-d Trees.

, , and . Algorithmica, 75 (4): 684-723 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dr. Venancio Martinez Garcia University of Stuttgart

Manuel Ernesto Maqueo Martinez University of Stuttgart

Jesus Antonio Martinez Zarate University of Stuttgart

Ph. D. Juan Esteban Martinez Jaramillo University of Stuttgart

 

Other publications of authors with the same name

Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms., , , and . SIAM J. Discrete Math., 23 (4): 1776-1799 (2009)Optimal Sampling Strategies in Quicksort., and . ICALP, volume 1443 of Lecture Notes in Computer Science, page 327-338. Springer, (1998)Generic Algorithms for the Generation of Combinatorial Objects., and . MFCS, volume 2747 of Lecture Notes in Computer Science, page 572-581. Springer, (2003)Fixed Partial Match Queries in Quadtrees., , and . AofA, volume 110 of LIPIcs, page 20:1-20:18. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Analysis of Branch Misses in Quicksort., , and . ANALCO, page 114-128. SIAM, (2015)The MAX-CUT of sparse random graphs., , , and . SODA, page 265-271. SIAM, (2012)Efficient iteration in admissible combinatorial classes., and . Theor. Comput. Sci., 346 (2-3): 388-417 (2005)On the competitiveness of the move-to-front rule., and . Theor. Comput. Sci., 242 (1-2): 313-325 (2000)On the Cost of Fixed Partial Match Queries in K-d Trees., , and . Algorithmica, 75 (4): 684-723 (2016)Guest Editorial., , and . Algorithmica, 66 (4): 739-740 (2013)