default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDT.-H. Hubert Chan
Hubert Tsz-Hong Chan – 陳子康
Person information
- unicode name: 陳子康
- affiliation: University of Hong Kong, Department of Computer Science, Hong Kong
- affiliation (former): Max Planck Institute for Informatics, Saarbrücken, Germany
- affiliation (former): Carnegie Mellon University, Computer Science Department, Pittsburgh, PA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c84]T.-H. Hubert Chan, Quan Xue:
Unraveling Universally Closest Refinements via Symmetric Density Decomposition and Fisher Market Equilibrium. ITCS 2025: 35:1-35:23- [i58]Antigoni Polychroniadou, T.-H. Hubert Chan, Adya Agrawal:
Indifferential Privacy: A New Paradigm and Its Applications to Optimal Matching in Dark Pool Auctions. CoRR abs/2502.13415 (2025) - 2024
- [j41]T.-H. Hubert Chan, Silvio Lattanzi, Mauro Sozio, Bo Wang:
Fully Dynamic k-Center Clustering with Outliers. Algorithmica 86(1): 171-193 (2024) - [j40]T.-H. Hubert Chan, Zhihao Gavin Tang, Quan Xue
:
Max-min greedy matching problem: Hardness for the adversary and fractional variant. Theor. Comput. Sci. 986: 114329 (2024) - [j39]Oana Balalau, Francesco Bonchi, T.-H. Hubert Chan, Francesco Gullo, Mauro Sozio, Hao Xie:
Finding Subgraphs with Maximum Total Density and Limited Overlap in Weighted Hypergraphs. ACM Trans. Knowl. Discov. Data 18(4): 95:1-95:21 (2024) - [c83]T.-H. Hubert Chan, Hao Xie, Mengshi Zhao:
Privacy Amplification by Iteration for ADMM with (Strongly) Convex Objective Functions. AAAI 2024: 11204-11211 - [c82]Yajing Zhi, Lanfang Kong, Samed Atouati, T.-H. Hubert Chan, Mauro Sozio:
Explaining Cryptocurrency Price Trends: Statistical Analysis of Social Media Posts vs Market Prices. CACML 2024: 234-239 - [c81]Mingxun Zhou, Mengshi Zhao, T.-H. Hubert Chan, Elaine Shi:
Advanced Composition Theorems for Differential Obliviousness. ITCS 2024: 103:1-103:24 - [c80]Yann Bourreau, Marco Bressan, T.-H. Hubert Chan, Qipeng Kuang, Mauro Sozio:
Efficient Streaming Algorithms for Graphlet Sampling. NeurIPS 2024 - [c79]T.-H. Hubert Chan, Gramoz Goranci, Shaofeng H.-C. Jiang, Bo Wang, Quan Xue:
Fully Dynamic Algorithms for Euclidean Steiner Tree. WALCOM 2024: 62-75 - [i57]T.-H. Hubert Chan, Ke Wu, Elaine Shi:
Mechanism Design for Automated Market Makers. CoRR abs/2402.09357 (2024) - [i56]T.-H. Hubert Chan, Quan Xue:
Symmetric Splendor: Unraveling Universally Closest Refinements and Fisher Market Equilibrium through Density-Friendly Decomposition. CoRR abs/2406.17964 (2024) - [i55]T.-H. Hubert Chan, Qipeng Kuang, Quan Xue:
Game-Theoretically Secure Distributed Protocols for Fair Allocation in Coalitional Games. CoRR abs/2412.19192 (2024) - 2023
- [j38]Ittai Abraham, T.-H. Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
Communication complexity of byzantine agreement, revisited. Distributed Comput. 36(1): 3-28 (2023) - [j37]Pui-Wai Ma, T.-H. Hubert Chan:
A feedforward unitary equivariant neural network. Neural Networks 161: 154-164 (2023) - [c78]T.-H. Hubert Chan, Ting Wen, Hao Xie, Quan Xue:
Game-Theoretically Secure Protocols for the Ordinal Random Assignment Problem. ACNS 2023: 582-610 - [c77]Mingxun Zhou, Elaine Shi, T.-H. Hubert Chan, Shir Maimon:
A Theory of Composition for Differential Obliviousness. EUROCRYPT (3) 2023: 3-34 - [c76]T.-H. Hubert Chan, Enze Sun, Bo Wang:
Generalized Sorting with Predictions Revisited. IJTCS-FAW 2023: 29-41 - [c75]T.-H. Hubert Chan, Zhihao Gavin Tang, Quan Xue:
Max-Min Greedy Matching Problem: Hardness for the Adversary and Fractional Variant. IJTCS-FAW 2023: 85-104 - [c74]Yajing Zhi, T.-H. Hubert Chan:
Clustering Social Media Data for Bitcoin Price Prediction with Transformer Model. MLNLP 2023: 135-140 - [i54]T.-H. Hubert Chan, Ting Wen, Hao Xie, Quan Xue:
Game-Theoretically Secure Protocols for the Ordinal Random Assignment Problem. CoRR abs/2304.13338 (2023) - [i53]T.-H. Hubert Chan, Gramoz Goranci, Shaofeng H.-C. Jiang, Bo Wang, Quan Xue:
Fully Dynamic Algorithms for Euclidean Steiner Tree. CoRR abs/2311.18365 (2023) - [i52]T.-H. Hubert Chan, Hao Xie, Mengshi Zhao:
Privacy Amplification by Iteration for ADMM with (Strongly) Convex Objective Functions. CoRR abs/2312.08685 (2023) - [i51]Mingxun Zhou, Mengshi Zhao, T.-H. Hubert Chan, Elaine Shi:
Advanced Composition Theorems for Differential Obliviousness. IACR Cryptol. ePrint Arch. 2023: 842 (2023) - 2022
- [j36]T.-H. Hubert Chan, Kai-Min Chung, Bruce M. Maggs, Elaine Shi:
Foundations of Differentially Oblivious Algorithms. J. ACM 69(4): 27:1-27:49 (2022) - [j35]Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
Locality-Preserving Oblivious RAM. J. Cryptol. 35(2): 6 (2022) - [j34]Xusheng Chen, Shixiong Zhao, Ji Qi, Jianyu Jiang, Haoze Song, Cheng Wang, Tsz On Li, T.-H. Hubert Chan, Fengwei Zhang, Xiapu Luo, Sen Wang, Gong Zhang, Heming Cui:
Efficient and DoS-resistant Consensus for Permissioned Blockchains. Perform. Evaluation 153: 102244 (2022) - [j33]Xusheng Chen, Shixiong Zhao, Ji Qi, Jianyu Jiang, Haoze Song, Cheng Wang, Tsz On Li, T.-H. Hubert Chan, Fengwei Zhang, Xiapu Luo, Sen Wang, Gong Zhang, Heming Cui:
Efficient and DoS-resistant Consensus for Permissioned Blockchains. SIGMETRICS Perform. Evaluation Rev. 49(3): 61-62 (2022) - [j32]Rediet Abebe, T.-H. Hubert Chan, Jon M. Kleinberg, Zhibin Liang, David C. Parkes, Mauro Sozio, Charalampos E. Tsourakakis:
Opinion Dynamics Optimization by Varying Susceptibility to Persuasion via Non-Convex Local Search. ACM Trans. Knowl. Discov. Data 16(2): 33:1-33:34 (2022) - [j31]T.-H. Hubert Chan, Arnaud Guerquin, Shuguang Hu, Mauro Sozio:
Fully Dynamic $k$k-Center Clustering With Improved Memory Efficiency. IEEE Trans. Knowl. Data Eng. 34(7): 3255-3266 (2022) - [c73]T.-H. Hubert Chan, Silvio Lattanzi, Mauro Sozio, Bo Wang:
Fully Dynamic k-Center Clustering with Outliers. COCOON 2022: 150-161 - [c72]Mingxun Zhou, Tianhao Wang, T.-H. Hubert Chan, Giulia Fanti, Elaine Shi:
Locally Differentially Private Sparse Vector Aggregation. SP 2022: 422-439 - [i50]Pui-Wai Ma, T.-H. Hubert Chan:
A Feedforward Unitary Equivariant Neural Network. CoRR abs/2208.12146 (2022) - [i49]Mingxun Zhou, Elaine Shi, T.-H. Hubert Chan, Shir Maimon:
A Theory of Composition for Differential Obliviousness. IACR Cryptol. ePrint Arch. 2022: 1357 (2022) - 2021
- [j30]T.-H. Hubert Chan, Mauro Sozio, Bintao Sun:
Distributed approximate k-core decomposition and min-max edge orientation: Breaking the diameter barrier. J. Parallel Distributed Comput. 147: 87-99 (2021) - [c71]T.-H. Hubert Chan, Elaine Shi, Wei-Kai Lin, Kartik Nayak:
Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions. ITC 2021: 8:1-8:23 - [c70]Shumo Chu, Danyang Zhuo, Elaine Shi, T.-H. Hubert Chan:
Differentially Oblivious Database Joins: Overcoming the Worst-Case Curse of Fully Oblivious Algorithms. ITC 2021: 19:1-19:24 - [c69]T.-H. Hubert Chan, Chui Shan Lee:
On the Hardness of Opinion Dynamics Optimization with L1-Budget on Varying Susceptibility to Persuasion. COCOON 2021: 515-527 - [c68]Kai-Min Chung, T.-H. Hubert Chan, Ting Wen, Elaine Shi:
Game-Theoretic Fairness Meets Multi-party Protocols: The Case of Leader Election. CRYPTO (2) 2021: 3-32 - [i48]T.-H. Hubert Chan, Chui Shan Lee:
On the Hardness of Opinion Dynamics Optimization with L1-Budget on Varying Susceptibility to Persuasion. CoRR abs/2105.04105 (2021) - [i47]Mingxun Zhou, Tianhao Wang, T.-H. Hubert Chan, Giulia Fanti, Elaine Shi:
Locally Differentially Private Sparse Vector Aggregation. CoRR abs/2112.03449 (2021) - [i46]Shumo Chu, Danyang Zhuo, Elaine Shi, T.-H. Hubert Chan:
Differentially Oblivious Database Joins: Overcoming the Worst-Case Curse of Fully Oblivious Algorithms. IACR Cryptol. ePrint Arch. 2021: 593 (2021) - 2020
- [j29]T.-H. Hubert Chan, Fei Chen, Li Ning:
Optimizing Social Welfare for Network Bargaining Games in the Face of Instability, Greed and Idealism. Theory Comput. Syst. 64(6): 999-1027 (2020) - [j28]Bintao Sun, Maximilien Danisch, T.-H. Hubert Chan, Mauro Sozio:
KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs. Proc. VLDB Endow. 13(10): 1628-1640 (2020) - [j27]T.-H. Hubert Chan, Haotian Jiang, Shaofeng H.-C. Jiang:
A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics. ACM Trans. Algorithms 16(2): 24:1-24:23 (2020) - [j26]T.-H. Hubert Chan, Zhibin Liang:
Generalizing the hypergraph Laplacian via a diffusion process with mediators. Theor. Comput. Sci. 806: 416-428 (2020) - [j25]Bintao Sun, T.-H. Hubert Chan, Mauro Sozio:
Fully Dynamic Approximate k-Core Decomposition in Hypergraphs. ACM Trans. Knowl. Discov. Data 14(4): 39:1-39:21 (2020) - [j24]Chenzi Zhang, Shuguang Hu, Zhihao Gavin Tang, T.-H. Hubert Chan:
Re-Revisiting Learning on Hypergraphs: Confidence Interval, Subgradient Method, and Extension to Multiclass. IEEE Trans. Knowl. Data Eng. 32(3): 506-518 (2020) - [c67]T.-H. Hubert Chan, Li Ning, Yong Zhang:
Influence Maximization Under the Non-progressive Linear Threshold Model. FAW 2020: 37-48 - [c66]T.-H. Hubert Chan, Kai-Min Chung, Wei-Kai Lin, Elaine Shi:
MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture. ITCS 2020: 75:1-75:52 - [c65]T.-H. Hubert Chan, Rafael Pass, Elaine Shi:
Sublinear-Round Byzantine Agreement Under Corrupt Majority. Public Key Cryptography (2) 2020: 246-265 - [c64]Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. SOSA 2020: 8-14 - [c63]T.-H. Hubert Chan, Zhibin Liang, Antigoni Polychroniadou, Elaine Shi:
Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels. SODA 2020: 2349-2365 - [c62]T.-H. Hubert Chan, Li Ning, Yong Zhang:
Maximizing the Expected Influence in Face of the Non-progressive Adversary. WASA (1) 2020: 28-39 - [i45]Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. CoRR abs/2008.01765 (2020) - [i44]Rediet Abebe, T.-H. Hubert Chan, Jon M. Kleinberg, Zhibin Liang, David C. Parkes, Mauro Sozio, Charalampos E. Tsourakakis:
Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search. CoRR abs/2011.02583 (2020) - [i43]T.-H. Hubert Chan, Kai-Min Chung, Wei-Kai Lin, Elaine Shi:
MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture. IACR Cryptol. ePrint Arch. 2020: 240 (2020) - [i42]T.-H. Hubert Chan, Wei-Kai Lin, Kartik Nayak, Elaine Shi:
Perfectly Secure Oblivious Parallel RAM with O(log3 N/ log log N) Overhead. IACR Cryptol. ePrint Arch. 2020: 604 (2020) - [i41]T.-H. Hubert Chan, Naomi Ephraim, Antonio Marcedone, Andrew Morgan, Rafael Pass, Elaine Shi:
Blockchain with Varying Number of Players. IACR Cryptol. ePrint Arch. 2020: 677 (2020) - [i40]Kai-Min Chung, T.-H. Hubert Chan, Ting Wen, Elaine Shi:
Game-Theoretically Fair Leader Election in O(log log n) Rounds under Majority Coalitions. IACR Cryptol. ePrint Arch. 2020: 1591 (2020)
2010 – 2019
- 2019
- [j23]T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu, Chenzi Zhang:
Diffusion operator and spectral analysis for directed hypergraph Laplacian. Theor. Comput. Sci. 784: 46-64 (2019) - [c61]Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
Locality-Preserving Oblivious RAM. EUROCRYPT (2) 2019: 214-243 - [c60]T.-H. Hubert Chan, Rafael Pass, Elaine Shi:
Consensus Through Herding. EUROCRYPT (1) 2019: 720-749 - [c59]T.-H. Hubert Chan, Mauro Sozio, Bintao Sun:
Distributed Approximate k-Core Decomposition and Min-Max Edge Orientation: Breaking the Diameter Barrier. IPDPS 2019: 345-354 - [c58]Ittai Abraham, T.-H. Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
Communication Complexity of Byzantine Agreement, Revisited. PODC 2019: 317-326 - [c57]T.-H. Hubert Chan, Kai-Min Chung, Bruce M. Maggs, Elaine Shi:
Foundations of Differentially Oblivious Algorithms. SODA 2019: 2448-2467 - [c56]T.-H. Hubert Chan, Zhibin Liang, Mauro Sozio:
Revisiting Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search. WWW 2019: 173-183 - [i39]T.-H. Hubert Chan, Zhibin Liang, Antigoni Polychroniadou, Elaine Shi:
Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels. CoRR abs/1910.12175 (2019) - [i38]T.-H. Hubert Chan, Rafael Pass, Elaine Shi:
Consensus through Herding. IACR Cryptol. ePrint Arch. 2019: 251 (2019) - [i37]T.-H. Hubert Chan, Rafael Pass, Elaine Shi:
Round Complexity of Byzantine Agreement, Revisited. IACR Cryptol. ePrint Arch. 2019: 886 (2019) - 2018
- [j22]T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu:
On (1,ϵ)-Restricted Max-Min Fair Allocation Problem. Algorithmica 80(7): 2181-2200 (2018) - [j21]T.-H. Hubert Chan, Anand Louis, Zhihao Gavin Tang, Chenzi Zhang:
Spectral Properties of Hypergraph Laplacian and Approximation Algorithms. J. ACM 65(3): 15:1-15:48 (2018) - [j20]Emil Stefanov, Marten van Dijk, Elaine Shi, T.-H. Hubert Chan, Christopher W. Fletcher, Ling Ren, Xiangyao Yu, Srinivas Devadas:
Path ORAM: An Extremely Simple Oblivious RAM Protocol. J. ACM 65(4): 18:1-18:26 (2018) - [j19]T.-H. Hubert Chan, Fei Chen, Xiaowei Wu, Zhichao Zhao:
Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming. SIAM J. Comput. 47(4): 1529-1546 (2018) - [j18]T.-H. Hubert Chan, Shuguang Hu, Shaofeng H.-C. Jiang:
A PTAS for the Steiner Forest Problem in Doubling Metrics. SIAM J. Comput. 47(4): 1705-1734 (2018) - [j17]T.-H. Hubert Chan, Shaofeng H.-C. Jiang:
Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics. ACM Trans. Algorithms 14(1): 9:1-9:18 (2018) - [j16]T.-H. Hubert Chan, Fei Chen, Xiaowei Wu:
Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity. ACM Trans. Algorithms 14(2): 12:1-12:25 (2018) - [j15]T.-H. Hubert Chan, Zhiyi Huang, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin Tang:
Online Submodular Maximization with Free Disposal. ACM Trans. Algorithms 14(4): 56:1-56:29 (2018) - [c55]T.-H. Hubert Chan, Jonathan Katz, Kartik Nayak, Antigoni Polychroniadou, Elaine Shi:
More is Less: Perfectly Secure Oblivious Algorithms in the Multi-server Setting. ASIACRYPT (3) 2018: 158-188 - [c54]T.-H. Hubert Chan, Zhibin Liang:
Generalizing the Hypergraph Laplacian via a Diffusion Process with Mediators. COCOON 2018: 441-453 - [c53]T.-H. Hubert Chan, Bintao Sun:
SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands. COCOON 2018: 688-700 - [c52]T.-H. Hubert Chan, Haotian Jiang, Shaofeng H.-C. Jiang:
A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics. ESA 2018: 15:1-15:13 - [c51]T.-H. Hubert Chan, Yue Guo, Wei-Kai Lin, Elaine Shi:
Cache-Oblivious and Data-Oblivious Sorting and Applications. SODA 2018: 2201-2220 - [c50]T.-H. Hubert Chan, Kartik Nayak, Elaine Shi:
Perfectly Secure Oblivious Parallel RAM. TCC (2) 2018: 636-668 - [c49]T.-H. Hubert Chan, Arnaud Guerquin, Mauro Sozio:
Fully Dynamic k-Center Clustering. WWW 2018: 579-587 - [i36]T.-H. Hubert Chan, Zhibin Liang:
Generalizing the Hypergraph Laplacian via a Diffusion Process with Mediators. CoRR abs/1804.11128 (2018) - [i35]T.-H. Hubert Chan, Bintao Sun:
An SDP Primal-Dual Approximation Algorithm for Directed Hypergraph Expansion and Sparsest Cut with Product Demands. CoRR abs/1805.02042 (2018) - [i34]T.-H. Hubert Chan, Rafael Pass, Elaine Shi:
Communication-Efficient Byzantine Agreement without Erasures. CoRR abs/1805.03391 (2018) - [i33]T.-H. Hubert Chan, Jonathan Katz, Kartik Nayak, Antigoni Polychroniadou, Elaine Shi:
More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting. CoRR abs/1809.00825 (2018) - [i32]T.-H. Hubert Chan, Kartik Nayak, Elaine Shi:
Perfectly Secure Oblivious Parallel RAM. IACR Cryptol. ePrint Arch. 2018: 364 (2018) - [i31]T.-H. Hubert Chan, Jonathan Katz, Kartik Nayak, Antigoni Polychroniadou, Elaine Shi:
More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting. IACR Cryptol. ePrint Arch. 2018: 851 (2018) - [i30]T.-H. Hubert Chan, Rafael Pass, Elaine Shi:
PiLi: An Extremely Simple Synchronous Blockchain. IACR Cryptol. ePrint Arch. 2018: 980 (2018) - [i29]T.-H. Hubert Chan, Rafael Pass, Elaine Shi:
PaLa: A Simple Partially Synchronous Blockchain. IACR Cryptol. ePrint Arch. 2018: 981 (2018) - 2017
- [j14]Petrie Wong, Cliz Sun, Eric Lo, Man Lung Yiu, Xiaowei Wu, Zhichao Zhao, T.-H. Hubert Chan, Ben Kao:
Finding k most influential edges on flow graphs. Inf. Syst. 65: 93-105 (2017) - [j13]Elaine Shi, T.-H. Hubert Chan, Eleanor Gilbert Rieffel, Dawn Song:
Distributed Private Data Analysis: Lower Bounds and Practical Constructions. ACM Trans. Algorithms 13(4): 50:1-50:38 (2017) - [c48]T.-H. Hubert Chan, Kai-Min Chung, Elaine Shi:
On the Depth of Oblivious Parallel RAM. ASIACRYPT (1) 2017: 567-597 - [c47]T.-H. Hubert Chan, Yue Guo, Wei-Kai Lin, Elaine Shi:
Oblivious Hashing Revisited, and Applications to Asymptotically Efficient ORAM and OPRAM. ASIACRYPT (1) 2017: 660-690 - [c46]Shuguang Hu, Xiaowei Wu, T.-H. Hubert Chan:
Maintaining Densest Subsets Efficiently in Evolving Hypergraphs. CIKM 2017: 929-938 - [c45]Zhichao Zhao, Fei Chen, T.-H. Hubert Chan, Chuan Wu:
Double Auction for Resource Allocation in Cloud Computing. CLOSER 2017: 273-280 - [c44]T.-H. Hubert Chan, Shaofeng H.-C. Jiang, Zhihao Gavin Tang, Xiaowei Wu:
Online Submodular Maximization Problem with Vector Packing Constraint. ESA 2017: 24:1-24:14 - [c43]Chenzi Zhang, Shuguang Hu, Zhihao Gavin Tang, T.-H. Hubert Chan:
Re-revisiting Learning on Hypergraphs: Confidence Interval and Subgradient Method. ICML 2017: 4026-4034 - [c42]T.-H. Hubert Chan, Zhiyi Huang, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin Tang:
Online Submodular Maximization with Free Disposal: Randomization Beats ¼ for Partition Matroids. SODA 2017: 1204-1223 - [c41]T.-H. Hubert Chan, Elaine Shi:
Circuit OPRAM: Unifying Statistically and Computationally Secure ORAMs and OPRAMs. TCC (2) 2017: 72-107 - [c40]Maximilien Danisch, T.-H. Hubert Chan, Mauro Sozio:
Large Scale Density-friendly Graph Decomposition via Convex Programming. WWW 2017: 233-242 - [i28]T.-H. Hubert Chan, Shaofeng H.-C. Jiang, Zhihao Gavin Tang, Xiaowei Wu:
Online Submodular Maximization Problem with Vector Packing Constraint. CoRR abs/1706.06922 (2017) - [i27]T.-H. Hubert Chan, Haotian Jiang, Shaofeng H.-C. Jiang:
A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics. CoRR abs/1710.07774 (2017) - [i26]T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu, Chenzi Zhang:
Diffusion Operator and Spectral Analysis for Directed Hypergraph Laplacian. CoRR abs/1711.01560 (2017) - [i25]Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
Oblivious Computation with Data Locality. IACR Cryptol. ePrint Arch. 2017: 772 (2017) - [i24]T.-H. Hubert Chan, Kai-Min Chung, Elaine Shi:
On the Depth of Oblivious Parallel RAM. IACR Cryptol. ePrint Arch. 2017: 861 (2017) - [i23]T.-H. Hubert Chan, Yue Guo, Wei-Kai Lin, Elaine Shi:
Cache-Oblivious and Data-Oblivious Sorting and Applications. IACR Cryptol. ePrint Arch. 2017: 914 (2017) - [i22]T.-H. Hubert Chan, Yue Guo, Wei-Kai Lin, Elaine Shi:
Oblivious Hashing Revisited, and Applications to Asymptotically Efficient ORAM and OPRAM. IACR Cryptol. ePrint Arch. 2017: 924 (2017) - [i21]T.-H. Hubert Chan, Kai-Min Chung, Bruce M. Maggs, Elaine Shi:
Foundations of Differentially Oblivious Algorithms. IACR Cryptol. ePrint Arch. 2017: 1033 (2017) - 2016
- [j12]T.-H. Hubert Chan, Anupam Gupta, Bruce M. Maggs, Shuheng Zhou:
On Hierarchical Routing in Doubling Metrics. ACM Trans. Algorithms 12(4): 55:1-55:22 (2016) - [c39]Melika Abolhassani, T.-H. Hubert Chan, Fei Chen, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Hamid Mahini, Xiaowei Wu:
Beating Ratio 0.5 for Weighted Oblivious Matching Problems. ESA 2016: 3:1-3:18 - [c38]Yossi Azar, Niv Buchbinder, T.-H. Hubert Chan, Shahar Chen, Ilan Reuven Cohen, Anupam Gupta, Zhiyi Huang, Ning Kang, Viswanath Nagarajan, Joseph Naor, Debmalya Panigrahi:
Online Algorithms for Covering and Packing Problems with Convex Objectives. FOCS 2016: 148-157 - [c37]T.-H. Hubert Chan, Shuguang Hu, Shaofeng H.-C. Jiang:
A PTAS for the Steiner Forest Problem in Doubling Metrics. FOCS 2016: 810-819 - [c36]T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu:
On (1, epsilon)-Restricted Max-Min Fair Allocation Problem. ISAAC 2016: 23:1-23:13 - [c35]T.-H. Hubert Chan, Shaofeng H.-C. Jiang:
Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics. SODA 2016: 754-765 - [e2]T.-H. Hubert Chan, Minming Li, Lusheng Wang:
Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Hong Kong, China, December 16-18, 2016, Proceedings. Lecture Notes in Computer Science 10043, Springer 2016, ISBN 978-3-319-48748-9 [contents] - [i20]T.-H. Hubert Chan, Anand Louis, Zhihao Gavin Tang, Chenzi Zhang:
Spectral Properties of Hypergraph Laplacian and Approximation Algorithms. CoRR abs/1605.01483 (2016) - [i19]T.-H. Hubert Chan, Shuguang Hu, Shaofeng H.-C. Jiang:
A PTAS for the Steiner Forest Problem in Doubling Metrics. CoRR abs/1608.06325 (2016) - [i18]T.-H. Hubert Chan, Zhiyi Huang, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin Tang:
Online Submodular Maximization with Free Disposal: Randomization Beats 0.25 for Partition Matroids. CoRR abs/1610.07770 (2016) - [i17]T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu:
On ($1$, $ε$)-Restricted Max-Min Fair Allocation Problem. CoRR abs/1611.08060 (2016) - [i16]T.-H. Hubert Chan, Elaine Shi:
Circuit OPRAM: A (Somewhat) Tight Oblivious Parallel RAM. IACR Cryptol. ePrint Arch. 2016: 1084 (2016) - 2015
- [j11]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]T.-H. Hubert Chan, Mingfei Li, Li Ning, Shay Solomon:
New Doubling Spanners: Better and Simpler. SIAM J. Comput. 44(1): 37-53 (2015) - [c34]Xiao Wang, T.-H. Hubert Chan, Elaine Shi:
Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound. CCS 2015: 850-861 - [c33]T.-H. Hubert Chan, Zhihao Gavin Tang, Chenzi Zhang:
Cheeger Inequalities for General Edge-Weighted Directed Graphs. COCOON 2015: 30-41 - [c32]T.-H. Hubert Chan, Charalampos Papamanthou, Zhichao Zhao:
On the Complexity of the Minimum Independent Set Partition Problem. COCOON 2015: 121-132 - [c31]T.-H. Hubert Chan, Xiaowei Wu, Chenzi Zhang, Zhichao Zhao:
Dynamic Tree Shortcut with Constant Degree. COCOON 2015: 433-444 - [c30]Zhichao Zhao, T.-H. Hubert Chan:
How to Vote Privately Using Bitcoin. ICICS 2015: 82-96 - [c29]T.-H. Hubert Chan, Fei Chen, Shaofeng H.-C. Jiang:
Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online K-Item Auction and Bipartite K-Matching with Random Arrival Order. SODA 2015: 1169-1188 - [c28]Oana Denisa Balalau, Francesco Bonchi, T.-H. Hubert Chan, Francesco Gullo, Mauro Sozio:
Finding Subgraphs with Maximum Total Density and Limited Overlap. WSDM 2015: 379-388 - [i15]T.-H. Hubert Chan, Zhiyi Huang, Ning Kang:
Online Convex Covering and Packing Problems. CoRR abs/1502.01802 (2015) - [i14]T.-H. Hubert Chan, Li Ning:
Influence Maximization under The Non-progressive Linear Threshold Model. CoRR abs/1504.00427 (2015) - [i13]T.-H. Hubert Chan, Zhihao Gavin Tang, Chenzi Zhang:
Spectral Properties of Laplacian and Stochastic Diffusion Process for Edge Expansion in Hypergraphs. CoRR abs/1510.01520 (2015) - [i12]Zhichao Zhao, T.-H. Hubert Chan:
How to Vote Privately Using Bitcoin. IACR Cryptol. ePrint Arch. 2015: 1007 (2015) - [i11]Ahmed E. Kosba, Zhichao Zhao, Andrew Miller, Yi Qian, T.-H. Hubert Chan, Charalampos Papamanthou, Rafael Pass, Abhi Shelat, Elaine Shi:
How to Use SNARKs in Universally Composable Protocols. IACR Cryptol. ePrint Arch. 2015: 1093 (2015) - 2014
- [j9]T.-H. Hubert Chan, Kevin L. Chang, Rajiv Raman:
An SDP Primal-Dual Algorithm for Approximating the Lovász-Theta Function. Algorithmica 69(3): 605-618 (2014) - [j8]T.-H. Hubert Chan, Li Ning:
Fast Convergence for Consensus in Dynamic Networks. ACM Trans. Algorithms 10(3): 15:1-15:15 (2014) - [c27]Xiao Shaun Wang, Yan Huang, T.-H. Hubert Chan, Abhi Shelat, Elaine Shi:
SCORAM: Oblivious RAM for Secure Computation. CCS 2014: 191-202 - [c26]Xiao Shaun Wang, Kartik Nayak, Chang Liu, T.-H. Hubert Chan, Elaine Shi, Emil Stefanov, Yan Huang:
Oblivious Data Structures. CCS 2014: 215-226 - [c25]Wenbin Tang, Xiaowei Wu, T.-H. Hubert Chan:
An incentive protocol for distributed dynamic P2P video-on-demand streaming. ICCCN 2014: 1-6 - [c24]T.-H. Hubert Chan, Fei Chen, Xiaowei Wu, Zhichao Zhao:
Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints. SODA 2014: 1112-1122 - [i10]Xiao Shaun Wang, Yan Huang, T.-H. Hubert Chan, Abhi Shelat, Elaine Shi:
SCORAM: Oblivious RAM for Secure Computation. IACR Cryptol. ePrint Arch. 2014: 671 (2014) - [i9]Xiao Wang, T.-H. Hubert Chan, Elaine Shi:
Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound. IACR Cryptol. ePrint Arch. 2014: 672 (2014) - 2013
- [c23]T.-H. Hubert Chan, Mingfei Li, Li Ning, Shay Solomon:
New Doubling Spanners: Better and Simpler. ICALP (1) 2013: 315-327 - [e1]T.-H. Hubert Chan, Lap Chi Lau, Luca Trevisan:
Theory and Applications of Models of Computation, 10th International Conference, TAMC 2013, Hong Kong, China, May 20-22, 2013. Proceedings. Lecture Notes in Computer Science 7876, Springer 2013, ISBN 978-3-642-38235-2 [contents] - [i8]T.-H. Hubert Chan, Fei Chen:
A Primal-Dual Continuous LP Method on the Multi-choice Multi-best Secretary Problem. CoRR abs/1307.0624 (2013) - [i7]T.-H. Hubert Chan, Fei Chen, Xiaowei Wu, Zhichao Zhao:
Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints. CoRR abs/1307.2696 (2013) - 2012
- [j7]T.-H. Hubert Chan, Anupam Gupta:
Approximating TSP on Metrics with Bounded Global Growth. SIAM J. Comput. 41(3): 587-617 (2012) - [c22]T.-H. Hubert Chan, Fei Chen, Li Ning:
Optimizing Social Welfare for Network Bargaining Games in the Face of Unstability, Greed and Spite. ESA 2012: 265-276 - [c21]T.-H. Hubert Chan, Elaine Shi, Dawn Song:
Optimal Lower Bound for Differentially Private Multi-party Aggregation. ESA 2012: 277-288 - [c20]T.-H. Hubert Chan, Elaine Shi, Dawn Song:
Privacy-Preserving Stream Aggregation with Fault Tolerance. Financial Cryptography 2012: 200-214 - [c19]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]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]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]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) - [i4]T.-H. Hubert Chan, Elaine Shi, Dawn Song:
Optimal Lower Bound for Differentially Private Multi-Party Aggregation. IACR Cryptol. ePrint Arch. 2012: 373 (2012) - 2011
- [j6]T.-H. Hubert Chan, Khaled M. Elbassioni:
A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics. Discret. Comput. Geom. 46(4): 704-723 (2011) - [j5]T.-H. Hubert Chan, Elaine Shi, Dawn Song:
Private and Continual Release of Statistics. ACM Trans. Inf. Syst. Secur. 14(3): 26:1-26:24 (2011) - [j4]Serge Abiteboul, T.-H. Hubert Chan, Evgeny Kharlamov, Werner Nutt, Pierre Senellart:
Capturing continuous data and answering aggregate queries in probabilistic XML. ACM Trans. Database Syst. 36(4): 25:1-25:45 (2011) - [c17]Elaine Shi, T.-H. Hubert Chan, Emil Stefanov, Mingfei Li:
Oblivious RAM with O((logN)3) Worst-Case Cost. ASIACRYPT 2011: 197-214 - [c16]T.-H. Hubert Chan, Li Ning:
Fast Convergence for Consensus in Dynamic Networks. ICALP (2) 2011: 514-525 - [c15]Elaine Shi, T.-H. Hubert Chan, Eleanor Gilbert Rieffel, Richard Chow, Dawn Song:
Privacy-Preserving Aggregation of Time-Series Data. NDSS 2011 - [i3]Elaine Shi, T.-H. Hubert Chan, Emil Stefanov, Mingfei Li:
Oblivious RAM with O((log N)3) Worst-Case Cost. IACR Cryptol. ePrint Arch. 2011: 407 (2011) - [i2]T.-H. Hubert Chan, Elaine Shi, Dawn Song:
Privacy-Preserving Stream Aggregation with Fault Tolerance. IACR Cryptol. ePrint Arch. 2011: 655 (2011) - 2010
- [j3]T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar:
Ultra-low-dimensional embeddings for doubling metrics. J. ACM 57(4): 21:1-21:26 (2010) - [c14]T.-H. Hubert Chan, Elaine Shi, Dawn Song:
Private and Continual Release of Statistics. ICALP (2) 2010: 405-417 - [c13]Serge Abiteboul, T.-H. Hubert Chan, Evgeny Kharlamov, Werner Nutt, Pierre Senellart:
Aggregate queries for discrete and continuous probabilistic XML. ICDT 2010: 50-61 - [c12]T.-H. Hubert Chan, Khaled M. Elbassioni:
A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics. SODA 2010: 256-267 - [i1]T.-H. Hubert Chan, Elaine Shi, Dawn Song:
Private and Continual Release of Statistics. IACR Cryptol. ePrint Arch. 2010: 76 (2010)
2000 – 2009
- 2009
- [j2]T.-H. Hubert Chan, Anupam Gupta:
Small Hop-diameter Sparse Spanners for Doubling Metrics. Discret. Comput. Geom. 41(1): 28-44 (2009) - [j1]T.-H. Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Aleksandrs Slivkins:
Metric Embeddings with Relaxed Guarantees. SIAM J. Comput. 38(6): 2303-2329 (2009) - [c11]T.-H. Hubert Chan, Kevin L. Chang, Rajiv Raman:
An SDP primal-dual algorithm for approximating the Lovász-theta function. ISIT 2009: 2808-2812 - 2008
- [c10]T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar:
Ultra-low-dimensional embeddings for doubling metrics. SODA 2008: 333-342 - [c9]T.-H. Hubert Chan, Anupam Gupta:
Approximating TSP on metrics with bounded global growth. SODA 2008: 690-699 - 2007
- [c8]Elaine Shi, John Bethencourt, T.-H. Hubert Chan, Dawn Xiaodong Song, Adrian Perrig:
Multi-Dimensional Range Query over Encrypted Data. S&P 2007: 350-364 - [c7]Maria-Florina Balcan, Avrim Blum, T.-H. Hubert Chan, MohammadTaghi Hajiaghayi:
A Theory of Loss-Leaders: Making Money by Pricing Below Cost. WINE 2007: 293-299 - 2006
- [c6]Avrim Blum, T.-H. Hubert Chan, Mugizi Robert Rwebangira:
A Random-Surfer Web-Graph Model. ANALCO 2006: 238-246 - [c5]T.-H. Hubert Chan, Donglin Xia, Goran Konjevod, Andréa W. Richa:
A Tight Lower Bound for the Steiner Point Removal Problem on Trees. APPROX-RANDOM 2006: 70-81 - [c4]T.-H. Hubert Chan, Michael Dinitz, Anupam Gupta:
Spanners with Slack. ESA 2006: 196-207 - [c3]T.-H. Hubert Chan, Anupam Gupta:
Small hop-diameter sparse spanners for doubling metrics. SODA 2006: 70-78 - 2005
- [c2]Ittai Abraham, Yair Bartal, T.-H. Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, Aleksandrs Slivkins:
Metric Embeddings with Relaxed Guarantees. FOCS 2005: 83-100 - [c1]Hubert Tsz-Hong Chan, Anupam Gupta, Bruce M. Maggs, Shuheng Zhou:
On hierarchical routing in doubling metrics. SODA 2005: 762-771
Coauthor Index
[c81] [i57] [j38] [c77] [i51] [j36] [j35] [c72] [i49] [c71] [c70] [c68] [i47] [i46] [c66] [c65] [c64] [c63] [i45] [i43] [i42] [i41] [i40] [c61] [c60] [c58] [c57] [i39] [i38] [i37] [j20] [c55] [c51] [c50] [i34] [i33] [i32] [i31] [i30] [i29] [j13] [c48] [c47] [c41] [i25] [i24] [i23] [i22] [i21] [i16] [c34] [i11] [c27] [c26] [i10] [i9] [c21] [c20] [c18] [i5] [i4] [j5] [c17] [c15] [i3] [i2] [c14] [i1] [c8]
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-21 02:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
