Artikel dengan mandat akses publik - Timothy M. ChanPelajari lebih lanjut
Tidak tersedia di mana pun: 1
Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation
T Biedl, TM Chan, S Lee, S Mehrabi, F Montecchiani, H Vosoughpour, ...
Algorithmica 81 (1), 69-97, 2019
Mandat: Natural Sciences and Engineering Research Council of Canada
Tersedia di suatu tempat: 56
Clustered integer 3SUM via additive combinatorics
TM Chan, M Lewenstein
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
Mandat: Natural Sciences and Engineering Research Council of Canada
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
Mandat: US National Science Foundation, Natural Sciences and Engineering Research …
Polynomial representations of threshold functions and algorithmic applications
J Alman, TM Chan, R Williams
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
Mandat: US National Science Foundation, Natural Sciences and Engineering Research …
Instance-optimal geometric algorithms
P Afshani, J Barbay, TM Chan
Journal of the ACM (JACM) 64 (1), 1-38, 2017
Mandat: Natural Sciences and Engineering Research Council of Canada, Danish National …
Necklaces, Convolutions, and X+Y
D Bremner, TM Chan, ED Demaine, J Erickson, F Hurtado, J Iacono, ...
Algorithmica 69 (2), 294-314, 2014
Mandat: Government of Spain
How to morph planar graph drawings
S Alamdari, P Angelini, F Barrera-Cruz, TM Chan, GD Lozzo, GD Battista, ...
SIAM Journal on Computing 46 (2), 824-852, 2017
Mandat: US Department of Defense, Natural Sciences and Engineering Research Council …
Adaptive and approximate orthogonal range counting
TM Chan, BT Wilkinson
ACM Transactions on Algorithms (TALG) 12 (4), 1-15, 2016
Mandat: Natural Sciences and Engineering Research Council of Canada, Danish National …
Linear-space data structures for range mode query in arrays
TM Chan, S Durocher, KG Larsen, J Morrison, BT Wilkinson
Theory of Computing Systems 55 (4), 719-741, 2014
Mandat: Danish National Research Foundation
Dynamic geometric data structures via shallow cuttings
TM Chan
Discrete & Computational Geometry 64 (4), 1235-1252, 2020
Mandat: US National Science Foundation
Deterministic APSP, orthogonal vectors, and more: Quickly derandomizing Razborov-Smolensky
TM Chan, RR Williams
ACM Transactions on Algorithms (TALG) 17 (1), 1-14, 2020
Mandat: US National Science Foundation
Approximate shortest paths and distance oracles in weighted unit-disk graphs
TM Chan, D Skrepetos
Journal of Computational Geometry 10 (2), 3–20-3–20, 2019
Mandat: US National Science Foundation
Orthogonal range searching in moderate dimensions: kd trees and range trees strike back
TM Chan
Discrete & Computational Geometry 61, 899-922, 2019
Mandat: US National Science Foundation
Approximating text-to-pattern Hamming distances
TM Chan, S Golan, T Kociumaka, T Kopelowitz, E Porat
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
Mandat: US National Science Foundation, European Commission
Reducing 3SUM to convolution-3SUM
TM Chan, Q He
Symposium on Simplicity in Algorithms, 1-7, 2020
Mandat: US National Science Foundation
On locality-sensitive orderings and their applications
TM Chan, S Har-Peled, M Jones
SIAM Journal on Computing 49 (3), 583-600, 2020
Mandat: US National Science Foundation
Dynamic orthogonal range searching on the RAM, revisited
TM Chan, K Tsakalidis
33rd International Symposium on Computational Geometry (SoCG 2017), 28: 1-28: 13, 2017
Mandat: Natural Sciences and Engineering Research Council of Canada
Better ϵ-dependencies for offline approximate nearest neighbor search, Euclidean minimum spanning trees, and ϵ-kernels
S Arya, TM Chan
Proceedings of the thirtieth annual symposium on Computational geometry, 416-425, 2014
Mandat: Research Grants Council, Hong Kong
More on change-making and related problems
TM Chan, Q He
Journal of Computer and System Sciences 124, 159-169, 2022
Mandat: US National Science Foundation
Smallest k-Enclosing Rectangle Revisited
TM Chan, S Har-Peled
Discrete & Computational Geometry 66 (2), 769-791, 2021
Mandat: US National Science Foundation
Informasi terbitan dan pendanaan ditentukan secara otomatis oleh program komputer