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
[2]
Hilfe
Suche: Author="Chan, T.-H. Hubert"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An SDP primal-dual algorithm for approximating the Lovász-Theta function
T.-H. Hubert Chan
,
Kevin L. Chang
,
Rajiv Raman
Algorithmica
69
(3), 2014, pp. 605-618
New doubling spanners: Better and simpler
T.-H. Hubert Chan
,
Mingfei Li
,
Li Ning
,
Shay Solomon
Lecture Notes in Computer Science
7965
, 2013, pp. 315-327
Optimizing social welfare for network bargaining games in the face of unstability, greed and spite
T.-H. Hubert Chan
,
Fei Chen
,
Li Ning
Lecture Notes in Computer Science
7501
, 2012, pp. 265-276
Approximating TSP on metrics with bounded global growth
T.-H. Hubert Chan
,
Anupam Gupta
SIAM Journal on Computing
41
(3), 2012, pp. 587-617
Sparse fault-tolerant spanners for doubling metrics with bounded hop-diameter or degree
T.-H. Hubert Chan
,
Mingfei Li
,
Li Ning
Lecture Notes in Computer Science
7391
, 2012, pp. 182-193
Optimal lower bound for differentially private multi-party aggregation
T.-H. Hubert Chan
,
Elaine Shi
,
Dawn Song
Lecture Notes in Computer Science
7501
, 2012, pp. 277-288
Fast convergence for consensus in dynamic networks
T.-H. Hubert Chan
,
Li Ning
Lecture Notes in Computer Science
6756
, 2011, pp. 514-525
Ultra-low-dimensional embeddings for doubling metrics
T.-H. Hubert Chan
,
Anupam Gupta
,
Kunal Talwar
Journal of the ACM
57
(4), 2010, pp. 21: 1-26
Private and continual release of statistics
T.-H. Hubert Chan
,
Elaine Shi
,
Dawn Song
Lecture Notes in Computer Science
6199
, 2010, pp. 405-417
Metric embeddings with relaxed guarantees
T.-H. Hubert Chan
,
Kedar Dhamdhere
,
Anupam Gupta
,
Jon Kleinberg
,
Aleksandrs Slivkins
SIAM Journal on Computing
38
(6), 2009, pp. 2303-2329
Spanners with slack
T.-H. Hubert Chan
,
Michael Dinitz
,
Anupam Gupta
Lecture Notes in Computer Science
4168
, 2006, pp. 196-207