Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

T.-H. Hubert Chan

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Mingfei Li

> Home > Persons > T.-H. Hubert Chan

Publications

2015
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/ChanLN15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/ChanLN15
T.-H. Hubert Chan, Mingfei Li, Li Ning:
Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree. Algorithmica 71(1): 53-65 (2015)
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/ChanLNS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/ChanLNS15
T.-H. Hubert Chan, Mingfei Li, Li Ning, Shay Solomon:
New Doubling Spanners: Better and Simpler. SIAM J. Comput. 44(1): 37-53 (2015)
2013
[c23]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/ChanLNS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/ChanLNS13
T.-H. Hubert Chan, Mingfei Li, Li Ning, Shay Solomon:
New Doubling Spanners: Better and Simpler. ICALP (1) 2013: 315-327
2012
[c19]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/ChanLN12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/ChanLN12
T.-H. Hubert Chan, Mingfei Li, Li Ning:
Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree. ICALP (1) 2012: 182-193
[c18]
- view
  authority control:
- export record
  dblp key:
  - conf/pet/ChanLSX12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pet/ChanLSX12
T.-H. Hubert Chan, Mingfei Li, Elaine Shi, Wenchang Xu:
Differentially Private Continual Monitoring of Heavy Hitters from Distributed Streams. Privacy Enhancing Technologies 2012: 140-159
[i6]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1207-0892
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1207-0892
T.-H. Hubert Chan, Mingfei Li, Li Ning:
Incubators vs Zombies: Fault-Tolerant, Short, Thin and Lanky Spanners for Doubling Metrics. CoRR abs/1207.0892 (2012)
[i5]
- view
  - electronic edition @ iacr.org (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/iacr/ChanLSX12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iacr/ChanLSX12
T.-H. Hubert Chan, Mingfei Li, Elaine Shi, Wenchang Xu:
Differentially Private Continual Monitoring of Heavy Hitters from Distributed Streams. IACR Cryptol. ePrint Arch. 2012: 218 (2012)
2011
[c17]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/asiacrypt/ShiCSL11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/asiacrypt/ShiCSL11
Elaine Shi, T.-H. Hubert Chan, Emil Stefanov, Mingfei Li:
Oblivious RAM with O((logN)3) Worst-Case Cost. ASIACRYPT 2011: 197-214
[i3]
- view
  - electronic edition @ iacr.org (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/iacr/ShiCSL11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iacr/ShiCSL11
Elaine Shi, T.-H. Hubert Chan, Emil Stefanov, Mingfei Li:
Oblivious RAM with O((log N)³) Worst-Case Cost. IACR Cryptol. ePrint Arch. 2011: 407 (2011)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.