( en | de | ru )

 

Disambiguation of "Chan, Timothy M."

Author of the publication

copydeleteadd this publication to your clipboard
All-pairs shortest paths for unweighted undirected graphs in o(mn) time.

. SODA, page 514-523. ACM Press, (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

Linear-Space Data Structures for Range Mode Query in Arrays., , , , and . Theory Comput. Syst., 55 (4): 719-741 (2014)Necklaces, Convolutions, and X + Y., , , , , , , and . ESA, volume 4168 of Lecture Notes in Computer Science, page 160-171. Springer, (2006)On Hardness of Jumbled Indexing., , , and . ICALP (1), volume 8572 of Lecture Notes in Computer Science, page 114-125. Springer, (2014)Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings., and . SoCG, volume 34 of LIPIcs, page 719-732. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Optimal partition trees.. SCG, page 1-10. ACM, (2010)Dynamic Orthogonal Range Searching on the RAM, Revisited., and . SoCG, volume 77 of LIPIcs, page 28:1-28:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels., and . SoCG, page 416. ACM, (2014)Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus.. SCG, page 300-309. ACM, (2000)Fixed-Dimensional Linear Programming Queries Made Easy.. SCG, page 284-290. ACM, (1996)Approximate Nearest Neighbor Queries Revisited.. SCG, page 352-358. ACM, (1997)