Timothy M. Chan
Timothy M. Chan
UIUC
Keine bestätigte E-Mail-Adresse
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
4221996
InnateDB: facilitating systems‐level analyses of the mammalian innate immune response
DJ Lynn, GL Winsor, C Chan, N Richard, MR Laird, A Barsky, JL Gardy, ...
Molecular systems biology 4 (1), 218, 2008
3672008
More algorithms for all-pairs shortest paths in weighted graphs
TM Chan
SIAM Journal on Computing 39 (5), 2075-2089, 2010
2802010
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
1992011
Approximation algorithms for maximum independent set of pseudo-disks
TM Chan, S Har-Peled
Discrete & Computational Geometry 48 (2), 373-392, 2012
1902012
Polynomial-time approximation schemes for packing and piercing fat objects
TM Chan
Journal of Algorithms 46 (2), 178-189, 2003
1722003
Faster core-set constructions and data-stream algorithms in fixed dimensions
TM Chan
Computational Geometry 35 (1-2), 20-35, 2006
1642006
Output-sensitive results on convex hulls, extreme points, and related problems
TM Chan
Discrete & Computational Geometry 16 (4), 369-387, 1996
1631996
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
1562000
Approximate nearest neighbor queries revisited
TM Chan
Discrete & Computational Geometry 20 (3), 359-373, 1998
1391998
An optimal randomized algorithm for maximum Tukey depth.
TM Chan
SODA 4, 430-436, 2004
1332004
Geometric applications of a randomized optimization technique
TM Chan
Discrete & Computational Geometry 22 (4), 547-567, 1999
1171999
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
TM Chan
ACM Transactions on Algorithms (TALG) 8 (4), 1-17, 2012
1102012
On Levels in Arrangements of Lines, Segments, Planes, and Triangles%
PK Agarwal, B Aronov, TM Chan, M Sharir
Discrete & Computational Geometry 19 (3), 315-331, 1998
1091998
More planar two-center algorithms
TM Chan
Computational Geometry 13 (3), 189-198, 1999
1081999
Random Sampling, Halfspace Range Reporting, and Construction of \lowercase-Levels in Three Dimensions
TM Chan
SIAM Journal on Computing 30 (2), 561-575, 2000
1062000
Clustered integer 3SUM via additive combinatorics
TM Chan, M Lewenstein
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
962015
Optimal partition trees
TM Chan
Discrete & Computational Geometry 47 (4), 661-690, 2012
962012
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
902016
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
902010
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20