T-H. Hubert Chan

Dr. T-H. Hubert Chan


Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2010
Verified
Book Chapter
Open access
PDF file
TCT-H. Hubert Chan
T-H. Hubert Chan
ESElaine Shi
Elaine Shi
DSDawn Song
Dawn Song
We ask the question – how can websites and data aggregators continually release updated statistics, and meanwhile preserve each individual user’s privacy? Given a stream of 0’s and 1’s, we propose a differentially private continual counter that outputs at every time step the approximate number of 1’s seen thus far. Our counter construction has error that is only poly-log in the number of time steps. We can extend the basic counter construction to allow websites to continually give top-k and hot items suggestions while preserving users’ privacy.

30 November 2017
Verified
Book Chapter
Closed access
PDF file
TCT-H. Hubert Chan
T-H. Hubert Chan
YGYue Guo
Yue Guo
WLWei-Kai Lin
Wei-Kai Lin
ESElaine Shi
Elaine Shi

18 March 2011 in Discrete & Computational Geometry
Verified
Journal Article
Open access
PDF file
TCT-H. Hubert Chan
T-H. Hubert Chan
KEKhaled Elbassioni
Khaled Elbassioni
We consider the Traveling Salesman Problem with Neighborhoods (TSPN) in doubling metrics. The goal is to find a shortest tour that visits each of a collection of n subsets (regions or neighborhoods) in the underlying metric space. We give a quasi-polynomial time approximation scheme (QPTAS) when the regions are what we call α-fat weakly disjoint. This notion combines the existing notions of diameter variation, fatness and disjointness for geometric objects and generalizes these notions to any arbitrary metric space. Intuitively, the regions can be grouped into a bounded number of types, where in each type, the regions have similar upper bounds for their diameters, and each such region can designate a point such that these points are far away from one another. Our result generalizes the polynomial time approximation scheme (PTAS) for TSPN on the Euclidean plane by Mitchell (in SODA, pp. 11–18, 2007) and the QPTAS for TSP on doubling metrics by Talwar (in 36th STOC, pp. 281–290, 2004). We also observe that our techniques directly extend to a QPTAS for the Group Steiner Tree Problem on doubling metrics, with the same assumption on the groups.

29 April 2020
Verified
Book Chapter
Closed access
PDF file
TCT-H. Hubert Chan
T-H. Hubert Chan
RPRafael Pass
Rafael Pass
ESElaine Shi
Elaine Shi

17 July 2022 in Distributed Computing
Verified
Journal Article
Closed access
PDF file
IAIttai Abraham
Ittai Abraham
TCT-H. Hubert Chan
T-H. Hubert Chan
DDDanny Dolev
Danny Dolev
KNKartik Nayak
Kartik Nayak
RPRafael Pass
Rafael Pass
ESElaine Shi
Elaine Shi

8 November 2018
Verified
Book Chapter
Closed access
PDF file
TCT-H. Hubert Chan
T-H. Hubert Chan
KNKartik Nayak
Kartik Nayak
ESElaine Shi
Elaine Shi