Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Chan, Timothy M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Finding median in read-only memory on integer input
Timothy M. Chan
,
J. Ian Munro
,
Venkatesh Raman
Theoretical Computer Science
583
, 2015, pp. 51-56
Deterministic rectangle enclosure and offline dominance reporting on the RAM
Peyman Afshani
,
Timothy M. Chan
,
Konstantinos Tsakalidis
Lecture Notes in Computer Science
8572
, 2014, pp. 77-88
On hardness of jumbled indexing
Amihood Amir
,
Timothy M. Chan
,
Moshe Lewenstein
,
Noa Lewenstein
Lecture Notes in Computer Science
8572
, 2014, pp. 114-125
Maximum-weight planar boxes in
O(n^2)
time (and better)
Jérémy Barbay
,
Timothy M. Chan
,
Gonzalo Navarro
,
Pablo Pérez-Lantero
Information Processing Letters
114
(8), 2014, pp. 437-445
Necklaces, convolutions, and
X+Y
David Bremner
,
Timothy M. Chan
,
Erik D. Demaine
,
Jeff Erickson
,
Ferran Hurtado
,
John Iacono
,
Stefan Langerman
,
Mihai Pȃtraşcu
,
Perouz Taslakian
Algorithmica
69
(2), 2014, pp. 294-314
Linear-space data structures for range mode query in arrays
Timothy M. Chan
,
Stephane Durocher
,
Kasper Green Larsen
,
Jason Morrison
,
Bryan T. Wilkinson
Theory of Computing Systems
55
(4), 2014, pp. 719-741
Drawing partially embedded and simultaneously planar graphs
Timothy M. Chan
,
Fabrizio Frati
,
Carsten Gutwenger
,
Anna Lubiw
,
Petra Mutzel
,
Marcus Schaefer
Lecture Notes in Computer Science
8871
, 2014, pp. 25-39
Succinct indices for path minimum, with applications to path reporting
Timothy M. Chan
,
Meng He
,
J. Ian Munro
,
Gelin Zhou
Lecture Notes in Computer Science
8737
, 2014, pp. 247-259
Smart-grid electricity allocation via strip packing with slicing
Soroush Alamdari
,
Therese Biedl
,
Timothy M. Chan
,
Elyot Grant
,
Krishnam Raju Jampani
,
Srinivasan Keshav
,
Anna Lubiw
,
Vinayak Pathak
Lecture Notes in Computer Science
8037
, 2013, pp. 25-36
Self-approaching graphs
Soroush Alamdari
,
Timothy M. Chan
,
Elyot Grant
,
Anna Lubiw
,
Vinayak Pathak
Lecture Notes in Computer Science
7704
, 2013, pp. 260-271
Minimum length embedding of planar graphs at fixed vertex locations
Timothy M. Chan
,
Hella-Franziska Hoffmann
,
Stephen Kiazyk
,
Anna Lubiw
Lecture Notes in Computer Science
8242
, 2013, pp. 376-387
Faster, space-efficient selection algorithms in read-only memory for integers
Timothy M. Chan
,
J. Ian Munro
,
Venkatesh Raman
Lecture Notes in Computer Science
8283
, 2013, pp. 405-412
The art of shaving logs
Timothy M. Chan
Lecture Notes in Computer Science
8037
, 2013, pp. 231-231
Linear-space data structures for range mode query in arrays
Timothy M. Chan
,
Stephane Durocher
,
Kasper Green Larsen
,
Jason Morrison
,
Bryan T. Wilkinson
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 290-301
Linear-space data structures for range minority query in arrays
Timothy M. Chan
,
Stephane Durocher
,
Matthew Skala
,
Bryan T. Wilkinson
Lecture Notes in Computer Science
7357
, 2012, pp. 295-306
Combinatorial geometry and approximation algorithms
Timothy M. Chan
Lecture Notes in Computer Science
7676
, 2012, pp. 2-2
Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set
Timothy M. Chan
Proceedings of the 28th Annual Symposium on Computational Geometry, SCG'2012 (Chapel Hill, NC, USA, June 17-20, 2012)
, 2012, pp. 293-302
Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
Timothy M. Chan
,
Vinayak Pathak
Lecture Notes in Computer Science
6844
, 2011, pp. 195-206
Dynamic connectivity: Connecting to networks and geometry
Timothy M. Chan
,
Mihai Pȃtraşcu
,
Liam Roditty
SIAM Journal on Computing
40
(2), 2011, pp. 333-349
Closest pair and the post office problem for stochastic points
Pegah Kamousi
,
Timothy M. Chan
,
Subhash Suri
Lecture Notes in Computer Science
6844
, 2011, pp. 548-559
A dynamic data structure for 3-
d
convex hulls and 2-
d
nearest neighbor queries
Timothy M. Chan
Journal of the ACM
57
(3), 2010, pp. 16: 1-15
More algorithms for all-pairs shortest paths in weighted graphs
Timothy M. Chan
SIAM Journal on Computing
39
(5), 2010, pp. 2075-2089
Dynamic connectivity for axis-parallel rectangles
Peyman Afshani
,
Timothy M. Chan
Algorithmica
53
(4), 2009, pp. 474-487
Transdichotomous results in computational geometry, I: Point location in sublogarithmic time
Timothy M. Chan
,
Mihai Pȃtraşcu
SIAM Journal on Computing
39
(2), 2009, pp. 703-729
A randomized algorithm for online unit clustering
Timothy M. Chan
,
Hamid Zarrabi-Zadeh
Theory of Computing Systems
45
(3), 2009, pp. 486-496
Seiten 1
2
3
>