Author of the publication

Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries.

, , , , , , and . Discret. Comput. Geom., 33 (4): 593-604 (2005)

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.

 

Other publications of authors with the same name

Alternatives to splay trees with O(log n) worst-case access times.. SODA, page 516-522. ACM/SIAM, (2001)External Memory Planar Point Location with Fast Updates., , and . ISAAC, volume 149 of LIPIcs, page 58:1-58:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)A Tight Lower Bound for Decrease-Key in the Pure Heap Model., and . CoRR, (2014)Entropy, Triangulation, and Point Location in Planar Subdivisions, , , , and . CoRR, (2009)Spanning Properties of Theta-Theta-6., , and . CoRR, (2018)Key Independent Optimality.. ISAAC, volume 2518 of Lecture Notes in Computer Science, page 25-31. Springer, (2002)Range Minimum Query Indexes in Higher Dimensions., , , and . CPM, volume 9133 of Lecture Notes in Computer Science, page 149-159. Springer, (2015)Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not., and . ICALP (1), volume 8572 of Lecture Notes in Computer Science, page 637-649. Springer, (2014)Grid Vertex-Unfolding Orthostacks., , and . JCDCG, volume 3742 of Lecture Notes in Computer Science, page 76-82. Springer, (2004)Encoding 2D range maximum queries., , , , , and . Theor. Comput. Sci., (2016)