( en | de | ru )

 

Disambiguation of "Chan, Timothy M."

Author of the publication

copydeleteadd this publication to your clipboard
Necklaces, Convolutions, and X + Y.

, , , , , , , and . ESA, volume 4168 of Lecture Notes in Computer Science, page 160-171. Springer, (2006)

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.

Timothy Saunders

Timothy Sulo

Timothy Leung

Timothy Creech

Wilhelm Chan

 

Other publications of authors with the same name

Closest-point problems simplified on the RAM.. SODA, page 472-473. ACM/SIAM, (2002)Finding the shortest bottleneck edge in a parametric minimum spanning tree.. SODA, page 917-918. SIAM, (2005)A Near-Linear Area Bound for Drawing Binary Trees.. SODA, page 161-168. ACM/SIAM, (1999)Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three., , and . SODA, page 282-291. ACM/SIAM, (1995)Voronoi diagrams in n·2osqrt(lg lg n) time., and . STOC, page 31-39. ACM, (2007)Selection and Sorting in the "Restore" Model., , and . ACM Trans. Algorithms, 14 (2): 11:1-11:18 (2018)Closest Pair and the Post Office Problem for Stochastic Points., , and . WADS, volume 6844 of Lecture Notes in Computer Science, page 548-559. Springer, (2011)All-Pairs Shortest Paths in Geometric Intersection Graphs., and . WADS, volume 10389 of Lecture Notes in Computer Science, page 253-264. Springer, (2017)Geometric Optimization Problems Over Sliding Windows., and . ISAAC, volume 3341 of Lecture Notes in Computer Science, page 246-258. Springer, (2004)Dynamic Geometric Set Cover, Revisited., , , and . SODA, page 3496-3528. SIAM, (2022)