| 2025 | AFT | Mechanism Design for Automated Market Makers. | T.-H. Hubert Chan, Ke Wu, Elaine Shi |
| 2025 | ICLR | Online Clustering with Nearly Optimal Consistency. | T.-H. Hubert Chan, Shaofeng H.-C. Jiang, Tianyi Wu, Mengshi Zhao |
| 2024 | AAAI | Privacy Amplification by Iteration for ADMM with (Strongly) Convex Objective Functions. | T.-H. Hubert Chan, Hao Xie, Mengshi Zhao |
| 2024 | WALCOM | Fully Dynamic Algorithms for Euclidean Steiner Tree. | T.-H. Hubert Chan, Gramoz Goranci, Shaofeng H.-C. Jiang, Bo Wang, Quan Xue |
| 2023 | ACNS | Game-Theoretically Secure Protocols for the Ordinal Random Assignment Problem. | T.-H. Hubert Chan, Ting Wen, Hao Xie, Quan Xue |
| 2023 | EuroCrypt | A Theory of Composition for Differential Obliviousness. | Mingxun Zhou, Elaine Shi, T.-H. Hubert Chan, Shir Maimon |
| 2023 | FAW | Generalized Sorting with Predictions Revisited. | T.-H. Hubert Chan, Enze Sun, Bo Wang |
| 2023 | FAW | Max-Min Greedy Matching Problem: Hardness for the Adversary and Fractional Variant. | T.-H. Hubert Chan, Zhihao Gavin Tang, Quan Xue |
| 2022 | COCOON | Fully Dynamic k-Center Clustering with Outliers. | T.-H. Hubert Chan, Silvio Lattanzi, Mauro Sozio, Bo Wang |
| 2022 | SP | Locally Differentially Private Sparse Vector Aggregation. | Mingxun Zhou, Tianhao Wang, T.-H. Hubert Chan, Giulia Fanti, Elaine Shi |
| 2021 | COCOON | On the Hardness of Opinion Dynamics Optimization with L | T.-H. Hubert Chan, Chui Shan Lee |
| 2021 | CRYPTO | Game-Theoretic Fairness Meets Multi-party Protocols: The Case of Leader Election. | Kai-Min Chung, T.-H. Hubert Chan, Ting Wen, Elaine Shi |
| 2020 | FAW | Influence Maximization Under the Non-progressive Linear Threshold Model. | T.-H. Hubert Chan, Li Ning, Yong Zhang |
| 2020 | PKC | Sublinear-Round Byzantine Agreement Under Corrupt Majority. | T.-H. Hubert Chan, Rafael Pass, Elaine Shi |
| 2020 | SODA | Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. | Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi |
| 2020 | SODA | Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels. | T.-H. Hubert Chan, Zhibin Liang, Antigoni Polychroniadou, Elaine Shi |
| 2019 | EuroCrypt | Locality-Preserving Oblivious RAM. | Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi |
| 2019 | EuroCrypt | Consensus Through Herding. | T.-H. Hubert Chan, Rafael Pass, Elaine Shi |
| 2019 | PODC | Communication Complexity of Byzantine Agreement, Revisited. | Ittai Abraham, T.-H. Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi |
| 2019 | WWW | Revisiting Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search. | T.-H. Hubert Chan, Zhibin Liang, Mauro Sozio |
| 2019 | SODA | Foundations of Differentially Oblivious Algorithms. | T.-H. Hubert Chan, Kai-Min Chung, Bruce M. Maggs, Elaine Shi |
| 2018 | ASIACRYPT | More is Less: Perfectly Secure Oblivious Algorithms in the Multi-server Setting. | T.-H. Hubert Chan, Jonathan Katz, Kartik Nayak, Antigoni Polychroniadou, Elaine Shi |
| 2018 | COCOON | Generalizing the Hypergraph Laplacian via a Diffusion Process with Mediators. | T.-H. Hubert Chan, Zhibin Liang |
| 2018 | COCOON | SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands. | T.-H. Hubert Chan, Bintao Sun |
| 2018 | ESA | A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics. | T.-H. Hubert Chan, Haotian Jiang, Shaofeng H.-C. Jiang |
| 2018 | WWW | Fully Dynamic | T.-H. Hubert Chan, Arnaud Guerquin, Mauro Sozio |
| 2018 | SODA | Cache-Oblivious and Data-Oblivious Sorting and Applications. | T.-H. Hubert Chan, Yue Guo, Wei-Kai Lin, Elaine Shi |
| 2018 | TCC | Perfectly Secure Oblivious Parallel RAM. | T.-H. Hubert Chan, Kartik Nayak, Elaine Shi |
| 2017 | ASIACRYPT | On the Depth of Oblivious Parallel RAM. | T.-H. Hubert Chan, Kai-Min Chung, Elaine Shi |
| 2017 | ASIACRYPT | Oblivious Hashing Revisited, and Applications to Asymptotically Efficient ORAM and OPRAM. | T.-H. Hubert Chan, Yue Guo, Wei-Kai Lin, Elaine Shi |
| 2017 | CIKM | Maintaining Densest Subsets Efficiently in Evolving Hypergraphs. | Shuguang Hu, Xiaowei Wu, T.-H. Hubert Chan |
| 2017 | CLOSER | Double Auction for Resource Allocation in Cloud Computing. | Zhichao Zhao, Fei Chen, T.-H. Hubert Chan, Chuan Wu |
| 2017 | ESA | Online Submodular Maximization Problem with Vector Packing Constraint. | T.-H. Hubert Chan, Shaofeng H.-C. Jiang, Zhihao Gavin Tang, Xiaowei Wu |
| 2017 | ICML | Re-revisiting Learning on Hypergraphs: Confidence Interval and Subgradient Method. | Chenzi Zhang, Shuguang Hu, Zhihao Gavin Tang, T.-H. Hubert Chan |
| 2017 | WWW | Large Scale Density-friendly Graph Decomposition via Convex Programming. | Maximilien Danisch, T.-H. Hubert Chan, Mauro Sozio |
| 2017 | SODA | Online Submodular Maximization with Free Disposal: Randomization Beats ¼ for Partition Matroids. | T.-H. Hubert Chan, Zhiyi Huang, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin Tang |
| 2017 | TCC | Circuit OPRAM: Unifying Statistically and Computationally Secure ORAMs and OPRAMs. | T.-H. Hubert Chan, Elaine Shi |
| 2016 | ESA | Beating Ratio 0.5 for Weighted Oblivious Matching Problems. | Melika Abolhassani, T.-H. Hubert Chan, Fei Chen, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Hamid Mahini, Xiaowei Wu |
| 2016 | FOCS | Online Algorithms for Covering and Packing Problems with Convex Objectives. | 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 |
| 2016 | FOCS | A PTAS for the Steiner Forest Problem in Doubling Metrics. | T.-H. Hubert Chan, Shuguang Hu, Shaofeng H.-C. Jiang |
| 2016 | ISAAC | On (1, epsilon)-Restricted Max-Min Fair Allocation Problem. | T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu |
| 2016 | SODA | Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics. | T.-H. Hubert Chan, Shaofeng H.-C. Jiang |
| 2015 | CCS | Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound. | Xiao Wang, T.-H. Hubert Chan, Elaine Shi |
| 2015 | COCOON | On the Complexity of the Minimum Independent Set Partition Problem. | T.-H. Hubert Chan, Charalampos Papamanthou, Zhichao Zhao |
| 2015 | COCOON | Cheeger Inequalities for General Edge-Weighted Directed Graphs. | T.-H. Hubert Chan, Zhihao Gavin Tang, Chenzi Zhang |
| 2015 | COCOON | Dynamic Tree Shortcut with Constant Degree. | T.-H. Hubert Chan, Xiaowei Wu, Chenzi Zhang, Zhichao Zhao |
| 2015 | ICICS | How to Vote Privately Using Bitcoin. | Zhichao Zhao, T.-H. Hubert Chan |
| 2015 | SODA | Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online | T.-H. Hubert Chan, Fei Chen, Shaofeng H.-C. Jiang |
| 2015 | WSDM | Finding Subgraphs with Maximum Total Density and Limited Overlap. | Oana Denisa Balalau, Francesco Bonchi, T.-H. Hubert Chan, Francesco Gullo, Mauro Sozio |
| 2014 | CCS | SCORAM: Oblivious RAM for Secure Computation. | Xiao Shaun Wang, Yan Huang, T.-H. Hubert Chan, Abhi Shelat, Elaine Shi |
| 2014 | CCS | Oblivious Data Structures. | Xiao Shaun Wang, Kartik Nayak, Chang Liu, T.-H. Hubert Chan, Elaine Shi, Emil Stefanov, Yan Huang |
| 2014 | ICCCN | An incentive protocol for distributed dynamic P2P video-on-demand streaming. | Wenbin Tang, Xiaowei Wu, T.-H. Hubert Chan |
| 2014 | SODA | Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints. | T.-H. Hubert Chan, Fei Chen, Xiaowei Wu, Zhichao Zhao |
| 2013 | ICALP | New Doubling Spanners: Better and Simpler. | T.-H. Hubert Chan, Mingfei Li, Li Ning, Shay Solomon |
| 2012 | ESA | Optimizing Social Welfare for Network Bargaining Games in the Face of Unstability, Greed and Spite. | T.-H. Hubert Chan, Fei Chen, Li Ning |
| 2012 | ESA | Optimal Lower Bound for Differentially Private Multi-party Aggregation. | T.-H. Hubert Chan, Elaine Shi, Dawn Song |
| 2012 | FC | Privacy-Preserving Stream Aggregation with Fault Tolerance. | T.-H. Hubert Chan, Elaine Shi, Dawn Song |
| 2012 | ICALP | Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree. | T.-H. Hubert Chan, Mingfei Li, Li Ning |
| 2011 | ASIACRYPT | Oblivious RAM with O((logN)3) Worst-Case Cost. | Elaine Shi, T.-H. Hubert Chan, Emil Stefanov, Mingfei Li |
| 2011 | ICALP | Fast Convergence for Consensus in Dynamic Networks. | T.-H. Hubert Chan, Li Ning |
| 2011 | NDSS | Privacy-Preserving Aggregation of Time-Series Data. | Elaine Shi, T.-H. Hubert Chan, Eleanor Gilbert Rieffel, Richard Chow, Dawn Song |
| 2010 | ICALP | Private and Continual Release of Statistics. | T.-H. Hubert Chan, Elaine Shi, Dawn Song |
| 2010 | ICDT | Aggregate queries for discrete and continuous probabilistic XML. | Serge Abiteboul, T.-H. Hubert Chan, Evgeny Kharlamov, Werner Nutt, Pierre Senellart |
| 2010 | SODA | A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics. | T.-H. Hubert Chan, Khaled M. Elbassioni |
| 2009 | ISIT | An SDP primal-dual algorithm for approximating the Lovsz-theta function. | T.-H. Hubert Chan, Kevin L. Chang, Rajiv Raman |
| 2008 | SODA | Approximating TSP on metrics with bounded global growth. | T.-H. Hubert Chan, Anupam Gupta |
| 2008 | SODA | Ultra-low-dimensional embeddings for doubling metrics. | T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar |
| 2007 | SP | Multi-Dimensional Range Query over Encrypted Data. | Elaine Shi, John Bethencourt, T.-H. Hubert Chan, Dawn Xiaodong Song, Adrian Perrig |
| 2006 | ESA | Spanners with Slack. | T.-H. Hubert Chan, Michael Dinitz, Anupam Gupta |
| 2006 | SODA | Small hop-diameter sparse spanners for doubling metrics. | T.-H. Hubert Chan, Anupam Gupta |
| 2005 | FOCS | Metric Embeddings with Relaxed Guarantees. | Ittai Abraham, Yair Bartal, T.-H. Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, Aleksandrs Slivkins |