Folgen
Timothy M. Chan
Timothy M. Chan
Professor of Computer Science, University of Illinois at Urbana-Champaign
Bestätigte E-Mail-Adresse bei illinois.edu - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Optimal output-sensitive convex hull algorithms in two and three dimensions
TM Chan
Discrete & Computational Geometry 16 (4), 361-368, 1996
5091996
More algorithms for all-pairs shortest paths in weighted graphs
TM Chan
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
3352007
Approximation algorithms for maximum independent set of pseudo-disks
TM Chan, S Har-Peled
Proceedings of the twenty-fifth annual symposium on Computational geometry …, 2009
2422009
Orthogonal range searching on the RAM, revisited
TM Chan, KG Larsen, M Pătraşcu
Proceedings of the twenty-seventh annual symposium on Computational geometry …, 2011
2402011
Polynomial-time approximation schemes for packing and piercing fat objects
TM Chan
Journal of Algorithms 46 (2), 178-189, 2003
2152003
Output-sensitive results on convex hulls, extreme points, and related problems
TM Chan
Proceedings of the eleventh annual symposium on Computational geometry, 10-19, 1995
1881995
Faster core-set constructions and data stream algorithms in fixed dimensions
TM Chan
Proceedings of the twentieth annual symposium on Computational geometry, 152-159, 2004
1712004
Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus
TM Chan
Proceedings of the sixteenth annual symposium on Computational geometry, 300-309, 2000
1692000
An optimal randomized algorithm for maximum Tukey depth.
TM Chan
SODA 4, 430-436, 2004
1572004
Approximate nearest neighbor queries revisited
TM Chan
Proceedings of the thirteenth annual symposium on computational geometry …, 1997
1551997
Clustered integer 3SUM via additive combinatorics
TM Chan, M Lewenstein
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
1452015
Geometric applications of a randomized optimization technique
TM Chan
Proceedings of the fourteenth annual symposium on Computational geometry …, 1998
1361998
Optimal partition trees
TM Chan
Proceedings of the twenty-sixth annual symposium on Computational geometry, 1-10, 2010
1352010
Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
TM Chan, E Grant, J Könemann, M Sharpe
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
1322012
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
TM Chan
ACM Transactions on Algorithms (TALG) 8 (4), 1-17, 2012
1302012
Counting inversions, offline orthogonal range counting, and related problems
TM Chan, M Pătraşcu
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
1222010
Random Sampling, Halfspace Range Reporting, and Construction of \lowercase-Levels in Three Dimensions
TM Chan
SIAM Journal on Computing 30 (2), 561-575, 2000
1202000
More planar two-center algorithms
TM Chan
Computational Geometry 13 (3), 189-198, 1999
1201999
Deterministic apsp, orthogonal vectors, and more: Quickly derandomizing razborov-smolensky
TM Chan, R Williams
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
1192016
Klee's measure problem made easy
TM Chan
2013 IEEE 54th annual symposium on foundations of computer science, 410-419, 2013
1062013
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20