T.-H. Hubert Chan

190 papers A* 27A 19B 6C 4Misc 8Journal 101Unranked 25
YearRankTypeTitle / Venue / Authors
2025 J jnl
Density Decomposition in Dual-Modular Optimization: Markets, Fairness, and Contracts.
CoRR
T.-H. Hubert Chan, Shinuo Ma
2025 J jnl
Faster and Efficient Density Decomposition via Proportional Response with Exponential Momentum.
Proc. ACM Manag. Data
Quan Xue, T.-H. Hubert Chan
2025 A conf
Game-Theoretically Secure Distributed Protocols for Fair Allocation in Coalitional Games.
AAMAS
T.-H. Hubert Chan, Qipeng Kuang, Quan Xue
2025 A conf
Indifferential Privacy: A New Paradigm and Its Applications to Optimal Matching in Dark Pool Auctions.
AAMAS
Antigoni Polychroniadou, T.-H. Hubert Chan, Adya Agrawal
2025 J jnl
Indifferential Privacy: A New Paradigm and Its Applications to Optimal Matching in Dark Pool Auctions.
CoRR
Antigoni Polychroniadou, T.-H. Hubert Chan, Adya Agrawal
2025 B conf
Mechanism Design for Automated Market Makers.
AFT
T.-H. Hubert Chan, Ke Wu, Elaine Shi
2025 A* conf
Online Clustering with Nearly Optimal Consistency.
ICLR
T.-H. Hubert Chan, Shaofeng H.-C. Jiang, Tianyi Wu, Mengshi Zhao
2025 A conf
Unraveling Universally Closest Refinements via Symmetric Density Decomposition and Fisher Market Equilibrium.
ITCS
T.-H. Hubert Chan, Quan Xue
2024 A conf
Advanced Composition Theorems for Differential Obliviousness.
ITCS
Mingxun Zhou, Mengshi Zhao, T.-H. Hubert Chan, Elaine Shi
2024 A* conf
Efficient Streaming Algorithms for Graphlet Sampling.
NeurIPS
Yann Bourreau, Marco Bressan, T.-H. Hubert Chan, Qipeng Kuang, Mauro Sozio
2024 — conf
Explaining Cryptocurrency Price Trends: Statistical Analysis of Social Media Posts vs Market Prices.
CACML
Yajing Zhi, Lanfang Kong, Samed Atouati, T.-H. Hubert Chan, Mauro Sozio
2024 J jnl
Finding Subgraphs with Maximum Total Density and Limited Overlap in Weighted Hypergraphs.
ACM Trans. Knowl. Discov. Data
Oana Balalau, Francesco Bonchi, T.-H. Hubert Chan, Francesco Gullo, Mauro Sozio, Hao Xie
2024 B conf
Fully Dynamic Algorithms for Euclidean Steiner Tree.
WALCOM
T.-H. Hubert Chan, Gramoz Goranci, Shaofeng H.-C. Jiang, Bo Wang, Quan Xue
2024 J jnl
Fully Dynamic k-Center Clustering with Outliers.
Algorithmica
T.-H. Hubert Chan, Silvio Lattanzi, Mauro Sozio, Bo Wang
2024 J jnl
Game-Theoretically Secure Distributed Protocols for Fair Allocation in Coalitional Games.
CoRR
T.-H. Hubert Chan, Qipeng Kuang, Quan Xue
2024 J jnl
Max-min greedy matching problem: Hardness for the adversary and fractional variant.
Theor. Comput. Sci.
T.-H. Hubert Chan, Zhihao Gavin Tang, Quan Xue
2024 J jnl
Mechanism Design for Automated Market Makers.
CoRR
T.-H. Hubert Chan, Ke Wu, Elaine Shi
2024 A* conf
Privacy Amplification by Iteration for ADMM with (Strongly) Convex Objective Functions.
AAAI
T.-H. Hubert Chan, Hao Xie, Mengshi Zhao
2024 J jnl
Symmetric Splendor: Unraveling Universally Closest Refinements and Fisher Market Equilibrium through Density-Friendly Decomposition.
CoRR
T.-H. Hubert Chan, Quan Xue
2023 — conf
A Theory of Composition for Differential Obliviousness.
EUROCRYPT (3)
Mingxun Zhou, Elaine Shi, T.-H. Hubert Chan, Shir Maimon
2023 J jnl
A feedforward unitary equivariant neural network.
Neural Networks
Pui-Wai Ma, T.-H. Hubert Chan
2023 J jnl
Advanced Composition Theorems for Differential Obliviousness.
IACR Cryptol. ePrint Arch.
Mingxun Zhou, Mengshi Zhao, T.-H. Hubert Chan, Elaine Shi
2023 — conf
Clustering Social Media Data for Bitcoin Price Prediction with Transformer Model.
MLNLP
Yajing Zhi, T.-H. Hubert Chan
2023 J jnl
Communication complexity of byzantine agreement, revisited.
Distributed Comput.
Ittai Abraham, T.-H. Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi
2023 J jnl
Fully Dynamic Algorithms for Euclidean Steiner Tree.
CoRR
T.-H. Hubert Chan, Gramoz Goranci, Shaofeng H.-C. Jiang, Bo Wang, Quan Xue
2023 B conf
Game-Theoretically Secure Protocols for the Ordinal Random Assignment Problem.
ACNS
T.-H. Hubert Chan, Ting Wen, Hao Xie, Quan Xue
2023 J jnl
Game-Theoretically Secure Protocols for the Ordinal Random Assignment Problem.
CoRR
T.-H. Hubert Chan, Ting Wen, Hao Xie, Quan Xue
2023 — conf
Generalized Sorting with Predictions Revisited.
IJTCS-FAW
T.-H. Hubert Chan, Enze Sun, Bo Wang
2023 — conf
Max-Min Greedy Matching Problem: Hardness for the Adversary and Fractional Variant.
IJTCS-FAW
T.-H. Hubert Chan, Zhihao Gavin Tang, Quan Xue
2023 J jnl
Privacy Amplification by Iteration for ADMM with (Strongly) Convex Objective Functions.
CoRR
T.-H. Hubert Chan, Hao Xie, Mengshi Zhao
2022 J jnl
A Feedforward Unitary Equivariant Neural Network.
CoRR
Pui-Wai Ma, T.-H. Hubert Chan
2022 J jnl
A Theory of Composition for Differential Obliviousness.
IACR Cryptol. ePrint Arch.
Mingxun Zhou, Elaine Shi, T.-H. Hubert Chan, Shir Maimon
2022 J jnl
Efficient and DoS-resistant Consensus for Permissioned Blockchains.
Perform. Evaluation
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
2022 J jnl
Efficient and DoS-resistant Consensus for Permissioned Blockchains.
SIGMETRICS Perform. Evaluation Rev.
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
2022 J jnl
Foundations of Differentially Oblivious Algorithms.
J. ACM
T.-H. Hubert Chan, Kai-Min Chung, Bruce M. Maggs, Elaine Shi
2022 J jnl
Fully Dynamic $k$k-Center Clustering With Improved Memory Efficiency.
IEEE Trans. Knowl. Data Eng.
T.-H. Hubert Chan, Arnaud Guerquin, Shuguang Hu, Mauro Sozio
2022 Misc conf
Fully Dynamic k-Center Clustering with Outliers.
COCOON
T.-H. Hubert Chan, Silvio Lattanzi, Mauro Sozio, Bo Wang
2022 J jnl
Locality-Preserving Oblivious RAM.
J. Cryptol.
Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi
2022 A* conf
Locally Differentially Private Sparse Vector Aggregation.
SP
Mingxun Zhou, Tianhao Wang, T.-H. Hubert Chan, Giulia Fanti, Elaine Shi
2022 J jnl
Opinion Dynamics Optimization by Varying Susceptibility to Persuasion via Non-Convex Local Search.
ACM Trans. Knowl. Discov. Data
Rediet Abebe, T.-H. Hubert Chan, Jon M. Kleinberg, Zhibin Liang, David C. Parkes, Mauro Sozio, Charalampos E. Tsourakakis
2021 A conf
Differentially Oblivious Database Joins: Overcoming the Worst-Case Curse of Fully Oblivious Algorithms.
ITC
Shumo Chu, Danyang Zhuo, Elaine Shi, T.-H. Hubert Chan
2021 J jnl
Differentially Oblivious Database Joins: Overcoming the Worst-Case Curse of Fully Oblivious Algorithms.
IACR Cryptol. ePrint Arch.
Shumo Chu, Danyang Zhuo, Elaine Shi, T.-H. Hubert Chan
2021 J jnl
Distributed approximate k-core decomposition and min-max edge orientation: Breaking the diameter barrier.
J. Parallel Distributed Comput.
T.-H. Hubert Chan, Mauro Sozio, Bintao Sun
2021 — conf
Game-Theoretic Fairness Meets Multi-party Protocols: The Case of Leader Election.
CRYPTO (2)
Kai-Min Chung, T.-H. Hubert Chan, Ting Wen, Elaine Shi
2021 J jnl
Locally Differentially Private Sparse Vector Aggregation.
CoRR
Mingxun Zhou, Tianhao Wang, T.-H. Hubert Chan, Giulia Fanti, Elaine Shi
2021 Misc conf
On the Hardness of Opinion Dynamics Optimization with L
COCOON
T.-H. Hubert Chan, Chui Shan Lee
2021 J jnl
On the Hardness of Opinion Dynamics Optimization with L
CoRR
T.-H. Hubert Chan, Chui Shan Lee
2021 A conf
Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions.
ITC
T.-H. Hubert Chan, Elaine Shi, Wei-Kai Lin, Kartik Nayak
2020 J jnl
A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics.
ACM Trans. Algorithms
T.-H. Hubert Chan, Haotian Jiang, Shaofeng H.-C. Jiang
2020 J jnl
Blockchain with Varying Number of Players.
IACR Cryptol. ePrint Arch.
T.-H. Hubert Chan, Naomi Ephraim, Antonio Marcedone, Andrew Morgan, Rafael Pass, Elaine Shi
2020 — conf
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort.
SOSA
Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi
2020 J jnl
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort.
CoRR
Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi
2020 J jnl
Fully Dynamic Approximate k-Core Decomposition in Hypergraphs.
ACM Trans. Knowl. Discov. Data
Bintao Sun, T.-H. Hubert Chan, Mauro Sozio
2020 J jnl
Game-Theoretically Fair Leader Election in O(log log n) Rounds under Majority Coalitions.
IACR Cryptol. ePrint Arch.
Kai-Min Chung, T.-H. Hubert Chan, Ting Wen, Elaine Shi
2020 J jnl
Generalizing the hypergraph Laplacian via a diffusion process with mediators.
Theor. Comput. Sci.
T.-H. Hubert Chan, Zhibin Liang
2020 Misc conf
Influence Maximization Under the Non-progressive Linear Threshold Model.
FAW
T.-H. Hubert Chan, Li Ning, Yong Zhang
2020 J jnl
KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs.
Proc. VLDB Endow.
Bintao Sun, Maximilien Danisch, T.-H. Hubert Chan, Mauro Sozio
2020 A conf
MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture.
ITCS
T.-H. Hubert Chan, Kai-Min Chung, Wei-Kai Lin, Elaine Shi
2020 J jnl
MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture.
IACR Cryptol. ePrint Arch.
T.-H. Hubert Chan, Kai-Min Chung, Wei-Kai Lin, Elaine Shi
2020 — conf
Maximizing the Expected Influence in Face of the Non-progressive Adversary.
WASA (1)
T.-H. Hubert Chan, Li Ning, Yong Zhang
2020 J jnl
Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search.
CoRR
Rediet Abebe, T.-H. Hubert Chan, Jon M. Kleinberg, Zhibin Liang, David C. Parkes, Mauro Sozio, Charalampos E. Tsourakakis
2020 J jnl
Optimizing Social Welfare for Network Bargaining Games in the Face of Instability, Greed and Idealism.
Theory Comput. Syst.
T.-H. Hubert Chan, Fei Chen, Li Ning
2020 J jnl
Perfectly Secure Oblivious Parallel RAM with O(log
IACR Cryptol. ePrint Arch.
T.-H. Hubert Chan, Wei-Kai Lin, Kartik Nayak, Elaine Shi
2020 J jnl
Re-Revisiting Learning on Hypergraphs: Confidence Interval, Subgradient Method, and Extension to Multiclass.
IEEE Trans. Knowl. Data Eng.
Chenzi Zhang, Shuguang Hu, Zhihao Gavin Tang, T.-H. Hubert Chan
2020 A* conf
Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels.
SODA
T.-H. Hubert Chan, Zhibin Liang, Antigoni Polychroniadou, Elaine Shi
2020 — conf
Sublinear-Round Byzantine Agreement Under Corrupt Majority.
Public Key Cryptography (2)
T.-H. Hubert Chan, Rafael Pass, Elaine Shi
2019 A* conf
Communication Complexity of Byzantine Agreement, Revisited.
PODC
Ittai Abraham, T.-H. Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi
2019 — conf
Consensus Through Herding.
EUROCRYPT (1)
T.-H. Hubert Chan, Rafael Pass, Elaine Shi
2019 J jnl
Consensus through Herding.
IACR Cryptol. ePrint Arch.
T.-H. Hubert Chan, Rafael Pass, Elaine Shi
2019 J jnl
Diffusion operator and spectral analysis for directed hypergraph Laplacian.
Theor. Comput. Sci.
T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu, Chenzi Zhang
2019 A conf
Distributed Approximate k-Core Decomposition and Min-Max Edge Orientation: Breaking the Diameter Barrier.
IPDPS
T.-H. Hubert Chan, Mauro Sozio, Bintao Sun
2019 A* conf
Foundations of Differentially Oblivious Algorithms.
SODA
T.-H. Hubert Chan, Kai-Min Chung, Bruce M. Maggs, Elaine Shi
2019 — conf
Locality-Preserving Oblivious RAM.
EUROCRYPT (2)
Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi
2019 A* conf
Revisiting Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search.
WWW
T.-H. Hubert Chan, Zhibin Liang, Mauro Sozio
2019 J jnl
Round Complexity of Byzantine Agreement, Revisited.
IACR Cryptol. ePrint Arch.
T.-H. Hubert Chan, Rafael Pass, Elaine Shi
2019 J jnl
Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels.
CoRR
T.-H. Hubert Chan, Zhibin Liang, Antigoni Polychroniadou, Elaine Shi
2018 J jnl
A PTAS for the Steiner Forest Problem in Doubling Metrics.
SIAM J. Comput.
T.-H. Hubert Chan, Shuguang Hu, Shaofeng H.-C. Jiang
2018 A conf
A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics.
ESA
T.-H. Hubert Chan, Haotian Jiang, Shaofeng H.-C. Jiang
2018 J jnl
An SDP Primal-Dual Approximation Algorithm for Directed Hypergraph Expansion and Sparsest Cut with Product Demands.
CoRR
T.-H. Hubert Chan, Bintao Sun
2018 J jnl
Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity.
ACM Trans. Algorithms
T.-H. Hubert Chan, Fei Chen, Xiaowei Wu
2018 A* conf
Cache-Oblivious and Data-Oblivious Sorting and Applications.
SODA
T.-H. Hubert Chan, Yue Guo, Wei-Kai Lin, Elaine Shi
2018 J jnl
Communication-Efficient Byzantine Agreement without Erasures.
CoRR
T.-H. Hubert Chan, Rafael Pass, Elaine Shi
2018 A* conf
Fully Dynamic
WWW
T.-H. Hubert Chan, Arnaud Guerquin, Mauro Sozio
2018 Misc conf
Generalizing the Hypergraph Laplacian via a Diffusion Process with Mediators.
COCOON
T.-H. Hubert Chan, Zhibin Liang
2018 J jnl
Generalizing the Hypergraph Laplacian via a Diffusion Process with Mediators.
CoRR
T.-H. Hubert Chan, Zhibin Liang
2018 J jnl
More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting.
CoRR
T.-H. Hubert Chan, Jonathan Katz, Kartik Nayak, Antigoni Polychroniadou, Elaine Shi
2018 J jnl
More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting.
IACR Cryptol. ePrint Arch.
T.-H. Hubert Chan, Jonathan Katz, Kartik Nayak, Antigoni Polychroniadou, Elaine Shi
2018 — conf
More is Less: Perfectly Secure Oblivious Algorithms in the Multi-server Setting.
ASIACRYPT (3)
T.-H. Hubert Chan, Jonathan Katz, Kartik Nayak, Antigoni Polychroniadou, Elaine Shi
2018 J jnl
On (1,ϵ)-Restricted Max-Min Fair Allocation Problem.
Algorithmica
T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu
2018 J jnl
Online Submodular Maximization with Free Disposal.
ACM Trans. Algorithms
T.-H. Hubert Chan, Zhiyi Huang, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin Tang
2018 J jnl
PaLa: A Simple Partially Synchronous Blockchain.
IACR Cryptol. ePrint Arch.
T.-H. Hubert Chan, Rafael Pass, Elaine Shi
2018 J jnl
Path ORAM: An Extremely Simple Oblivious RAM Protocol.
J. ACM
Emil Stefanov, Marten van Dijk, Elaine Shi, T.-H. Hubert Chan, Christopher W. Fletcher, Ling Ren, Xiangyao Yu, Srinivas Devadas
2018 — conf
Perfectly Secure Oblivious Parallel RAM.
TCC (2)
T.-H. Hubert Chan, Kartik Nayak, Elaine Shi
2018 J jnl
Perfectly Secure Oblivious Parallel RAM.
IACR Cryptol. ePrint Arch.
T.-H. Hubert Chan, Kartik Nayak, Elaine Shi
2018 J jnl
PiLi: An Extremely Simple Synchronous Blockchain.
IACR Cryptol. ePrint Arch.
T.-H. Hubert Chan, Rafael Pass, Elaine Shi
2018 J jnl
Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming.
SIAM J. Comput.
T.-H. Hubert Chan, Fei Chen, Xiaowei Wu, Zhichao Zhao
2018 J jnl
Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics.
ACM Trans. Algorithms
T.-H. Hubert Chan, Shaofeng H.-C. Jiang
2018 Misc conf
SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands.
COCOON
T.-H. Hubert Chan, Bintao Sun
2018 J jnl
Spectral Properties of Hypergraph Laplacian and Approximation Algorithms.
J. ACM
T.-H. Hubert Chan, Anand Louis, Zhihao Gavin Tang, Chenzi Zhang
2017 J jnl
A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics.
CoRR
T.-H. Hubert Chan, Haotian Jiang, Shaofeng H.-C. Jiang
2017 J jnl
Cache-Oblivious and Data-Oblivious Sorting and Applications.
IACR Cryptol. ePrint Arch.
T.-H. Hubert Chan, Yue Guo, Wei-Kai Lin, Elaine Shi
2017 — conf
Circuit OPRAM: Unifying Statistically and Computationally Secure ORAMs and OPRAMs.
TCC (2)
T.-H. Hubert Chan, Elaine Shi
2017 J jnl
Diffusion Operator and Spectral Analysis for Directed Hypergraph Laplacian.
CoRR
T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu, Chenzi Zhang
2017 J jnl
Distributed Private Data Analysis: Lower Bounds and Practical Constructions.
ACM Trans. Algorithms
Elaine Shi, T.-H. Hubert Chan, Eleanor Gilbert Rieffel, Dawn Song
2017 C conf
Double Auction for Resource Allocation in Cloud Computing.
CLOSER
Zhichao Zhao, Fei Chen, T.-H. Hubert Chan, Chuan Wu
2017 J jnl
Finding k most influential edges on flow graphs.
Inf. Syst.
Petrie Wong, Cliz Sun, Eric Lo, Man Lung Yiu, Xiaowei Wu, Zhichao Zhao, T.-H. Hubert Chan, Ben Kao
2017 J jnl
Foundations of Differentially Oblivious Algorithms.
IACR Cryptol. ePrint Arch.
T.-H. Hubert Chan, Kai-Min Chung, Bruce M. Maggs, Elaine Shi
2017 A* conf
Large Scale Density-friendly Graph Decomposition via Convex Programming.
WWW
Maximilien Danisch, T.-H. Hubert Chan, Mauro Sozio
2017 A conf
Maintaining Densest Subsets Efficiently in Evolving Hypergraphs.
CIKM
Shuguang Hu, Xiaowei Wu, T.-H. Hubert Chan
2017 J jnl
Oblivious Computation with Data Locality.
IACR Cryptol. ePrint Arch.
Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi
2017 — conf
Oblivious Hashing Revisited, and Applications to Asymptotically Efficient ORAM and OPRAM.
ASIACRYPT (1)
T.-H. Hubert Chan, Yue Guo, Wei-Kai Lin, Elaine Shi
2017 J jnl
Oblivious Hashing Revisited, and Applications to Asymptotically Efficient ORAM and OPRAM.
IACR Cryptol. ePrint Arch.
T.-H. Hubert Chan, Yue Guo, Wei-Kai Lin, Elaine Shi
2017 — conf
On the Depth of Oblivious Parallel RAM.
ASIACRYPT (1)
T.-H. Hubert Chan, Kai-Min Chung, Elaine Shi
2017 J jnl
On the Depth of Oblivious Parallel RAM.
IACR Cryptol. ePrint Arch.
T.-H. Hubert Chan, Kai-Min Chung, Elaine Shi
2017 A conf
Online Submodular Maximization Problem with Vector Packing Constraint.
ESA
T.-H. Hubert Chan, Shaofeng H.-C. Jiang, Zhihao Gavin Tang, Xiaowei Wu
2017 J jnl
Online Submodular Maximization Problem with Vector Packing Constraint.
CoRR
T.-H. Hubert Chan, Shaofeng H.-C. Jiang, Zhihao Gavin Tang, Xiaowei Wu
2017 A* conf
Online Submodular Maximization with Free Disposal: Randomization Beats ¼ for Partition Matroids.
SODA
T.-H. Hubert Chan, Zhiyi Huang, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin Tang
2017 A* conf
Re-revisiting Learning on Hypergraphs: Confidence Interval and Subgradient Method.
ICML
Chenzi Zhang, Shuguang Hu, Zhihao Gavin Tang, T.-H. Hubert Chan
2016 A* conf
A PTAS for the Steiner Forest Problem in Doubling Metrics.
FOCS
T.-H. Hubert Chan, Shuguang Hu, Shaofeng H.-C. Jiang
2016 J jnl
A PTAS for the Steiner Forest Problem in Doubling Metrics.
CoRR
T.-H. Hubert Chan, Shuguang Hu, Shaofeng H.-C. Jiang
2016 A conf
Beating Ratio 0.5 for Weighted Oblivious Matching Problems.
ESA
Melika Abolhassani, T.-H. Hubert Chan, Fei Chen, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Hamid Mahini, Xiaowei Wu
2016 J jnl
Circuit OPRAM: A (Somewhat) Tight Oblivious Parallel RAM.
IACR Cryptol. ePrint Arch.
T.-H. Hubert Chan, Elaine Shi
2016 C ed.
Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Hong Kong, China, December 16-18, 2016, Proceedings
COCOA
T.-H. Hubert Chan, Minming Li, Lusheng Wang
2016 J jnl
On ($1$, $ε$)-Restricted Max-Min Fair Allocation Problem.
CoRR
T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu
2016 B conf
On (1, epsilon)-Restricted Max-Min Fair Allocation Problem.
ISAAC
T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu
2016 J jnl
On Hierarchical Routing in Doubling Metrics.
ACM Trans. Algorithms
T.-H. Hubert Chan, Anupam Gupta, Bruce M. Maggs, Shuheng Zhou
2016 A* conf
Online Algorithms for Covering and Packing Problems with Convex Objectives.
FOCS
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 J jnl
Online Submodular Maximization with Free Disposal: Randomization Beats 0.25 for Partition Matroids.
CoRR
T.-H. Hubert Chan, Zhiyi Huang, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin Tang
2016 A* conf
Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics.
SODA
T.-H. Hubert Chan, Shaofeng H.-C. Jiang
2016 J jnl
Spectral Properties of Hypergraph Laplacian and Approximation Algorithms.
CoRR
T.-H. Hubert Chan, Anand Louis, Zhihao Gavin Tang, Chenzi Zhang
2015 Misc conf
Cheeger Inequalities for General Edge-Weighted Directed Graphs.
COCOON
T.-H. Hubert Chan, Zhihao Gavin Tang, Chenzi Zhang
2015 A* conf
Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound.
CCS
Xiao Wang, T.-H. Hubert Chan, Elaine Shi
2015 Misc conf
Dynamic Tree Shortcut with Constant Degree.
COCOON
T.-H. Hubert Chan, Xiaowei Wu, Chenzi Zhang, Zhichao Zhao
2015 A conf
Finding Subgraphs with Maximum Total Density and Limited Overlap.
WSDM
Oana Denisa Balalau, Francesco Bonchi, T.-H. Hubert Chan, Francesco Gullo, Mauro Sozio
2015 J jnl
How to Use SNARKs in Universally Composable Protocols.
IACR Cryptol. ePrint Arch.
Ahmed E. Kosba, Zhichao Zhao, Andrew Miller, Yi Qian, T.-H. Hubert Chan, Charalampos Papamanthou, Rafael Pass, Abhi Shelat, Elaine Shi
2015 C conf
How to Vote Privately Using Bitcoin.
ICICS
Zhichao Zhao, T.-H. Hubert Chan
2015 J jnl
How to Vote Privately Using Bitcoin.
IACR Cryptol. ePrint Arch.
Zhichao Zhao, T.-H. Hubert Chan
2015 J jnl
Influence Maximization under The Non-progressive Linear Threshold Model.
CoRR
T.-H. Hubert Chan, Li Ning
2015 J jnl
New Doubling Spanners: Better and Simpler.
SIAM J. Comput.
T.-H. Hubert Chan, Mingfei Li, Li Ning, Shay Solomon
2015 Misc conf
On the Complexity of the Minimum Independent Set Partition Problem.
COCOON
T.-H. Hubert Chan, Charalampos Papamanthou, Zhichao Zhao
2015 J jnl
Online Convex Covering and Packing Problems.
CoRR
T.-H. Hubert Chan, Zhiyi Huang, Ning Kang
2015 A* conf
Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online
SODA
T.-H. Hubert Chan, Fei Chen, Shaofeng H.-C. Jiang
2015 J jnl
Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree.
Algorithmica
T.-H. Hubert Chan, Mingfei Li, Li Ning
2015 J jnl
Spectral Properties of Laplacian and Stochastic Diffusion Process for Edge Expansion in Hypergraphs.
CoRR
T.-H. Hubert Chan, Zhihao Gavin Tang, Chenzi Zhang
2014 J jnl
An SDP Primal-Dual Algorithm for Approximating the Lovász-Theta Function.
Algorithmica
T.-H. Hubert Chan, Kevin L. Chang, Rajiv Raman
2014 B conf
An incentive protocol for distributed dynamic P2P video-on-demand streaming.
ICCCN
Wenbin Tang, Xiaowei Wu, T.-H. Hubert Chan
2014 J jnl
Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound.
IACR Cryptol. ePrint Arch.
Xiao Wang, T.-H. Hubert Chan, Elaine Shi
2014 J jnl
Fast Convergence for Consensus in Dynamic Networks.
ACM Trans. Algorithms
T.-H. Hubert Chan, Li Ning
2014 A* conf
Oblivious Data Structures.
CCS
Xiao Shaun Wang, Kartik Nayak, Chang Liu, T.-H. Hubert Chan, Elaine Shi, Emil Stefanov, Yan Huang
2014 A* conf
Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints.
SODA
T.-H. Hubert Chan, Fei Chen, Xiaowei Wu, Zhichao Zhao
2014 A* conf
SCORAM: Oblivious RAM for Secure Computation.
CCS
Xiao Shaun Wang, Yan Huang, T.-H. Hubert Chan, Abhi Shelat, Elaine Shi
2014 J jnl
SCORAM: Oblivious RAM for Secure Computation.
IACR Cryptol. ePrint Arch.
Xiao Shaun Wang, Yan Huang, T.-H. Hubert Chan, Abhi Shelat, Elaine Shi
2013 J jnl
A Primal-Dual Continuous LP Method on the Multi-choice Multi-best Secretary Problem.
CoRR
T.-H. Hubert Chan, Fei Chen
2013 — conf
New Doubling Spanners: Better and Simpler.
ICALP (1)
T.-H. Hubert Chan, Mingfei Li, Li Ning, Shay Solomon
2013 J jnl
Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints.
CoRR
T.-H. Hubert Chan, Fei Chen, Xiaowei Wu, Zhichao Zhao
2013 C ed.
Theory and Applications of Models of Computation, 10th International Conference, TAMC 2013, Hong Kong, China, May 20-22, 2013. Proceedings
TAMC
T.-H. Hubert Chan, Lap Chi Lau, Luca Trevisan
2012 J jnl
Approximating TSP on Metrics with Bounded Global Growth.
SIAM J. Comput.
T.-H. Hubert Chan, Anupam Gupta
2012 A conf
Differentially Private Continual Monitoring of Heavy Hitters from Distributed Streams.
Privacy Enhancing Technologies
T.-H. Hubert Chan, Mingfei Li, Elaine Shi, Wenchang Xu
2012 J jnl
Differentially Private Continual Monitoring of Heavy Hitters from Distributed Streams.
IACR Cryptol. ePrint Arch.
T.-H. Hubert Chan, Mingfei Li, Elaine Shi, Wenchang Xu
2012 J jnl
Incubators vs Zombies: Fault-Tolerant, Short, Thin and Lanky Spanners for Doubling Metrics
CoRR
T.-H. Hubert Chan, Mingfei Li, Li Ning
2012 J jnl
Optimal Lower Bound for Differentially Private Multi-Party Aggregation.
IACR Cryptol. ePrint Arch.
T.-H. Hubert Chan, Elaine Shi, Dawn Song
2012 A conf
Optimal Lower Bound for Differentially Private Multi-party Aggregation.
ESA
T.-H. Hubert Chan, Elaine Shi, Dawn Song
2012 A conf
Optimizing Social Welfare for Network Bargaining Games in the Face of Unstability, Greed and Spite.
ESA
T.-H. Hubert Chan, Fei Chen, Li Ning
2012 — conf
Privacy-Preserving Stream Aggregation with Fault Tolerance.
Financial Cryptography
T.-H. Hubert Chan, Elaine Shi, Dawn Song
2012 — conf
Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree.
ICALP (1)
T.-H. Hubert Chan, Mingfei Li, Li Ning
2011 J jnl
A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics.
Discret. Comput. Geom.
T.-H. Hubert Chan, Khaled M. Elbassioni
2011 J jnl
Capturing continuous data and answering aggregate queries in probabilistic XML.
ACM Trans. Database Syst.
Serge Abiteboul, T.-H. Hubert Chan, Evgeny Kharlamov, Werner Nutt, Pierre Senellart
2011 — conf
Fast Convergence for Consensus in Dynamic Networks.
ICALP (2)
T.-H. Hubert Chan, Li Ning
2011 J jnl
Oblivious RAM with O((log N)
IACR Cryptol. ePrint Arch.
Elaine Shi, T.-H. Hubert Chan, Emil Stefanov, Mingfei Li
2011 A conf
Oblivious RAM with O((logN)3) Worst-Case Cost.
ASIACRYPT
Elaine Shi, T.-H. Hubert Chan, Emil Stefanov, Mingfei Li
2011 A* conf
Privacy-Preserving Aggregation of Time-Series Data.
NDSS
Elaine Shi, T.-H. Hubert Chan, Eleanor Gilbert Rieffel, Richard Chow, Dawn Song
2011 J jnl
Privacy-Preserving Stream Aggregation with Fault Tolerance.
IACR Cryptol. ePrint Arch.
T.-H. Hubert Chan, Elaine Shi, Dawn Song
2011 J jnl
Private and Continual Release of Statistics.
ACM Trans. Inf. Syst. Secur.
T.-H. Hubert Chan, Elaine Shi, Dawn Song
2010 A* conf
A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics.
SODA
T.-H. Hubert Chan, Khaled M. Elbassioni
2010 A conf
Aggregate queries for discrete and continuous probabilistic XML.
ICDT
Serge Abiteboul, T.-H. Hubert Chan, Evgeny Kharlamov, Werner Nutt, Pierre Senellart
2010 — conf
Private and Continual Release of Statistics.
ICALP (2)
T.-H. Hubert Chan, Elaine Shi, Dawn Song
2010 J jnl
Private and Continual Release of Statistics.
IACR Cryptol. ePrint Arch.
T.-H. Hubert Chan, Elaine Shi, Dawn Song
2010 J jnl
Ultra-low-dimensional embeddings for doubling metrics.
J. ACM
T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar
2009 B conf
An SDP primal-dual algorithm for approximating the Lovász-theta function.
ISIT
T.-H. Hubert Chan, Kevin L. Chang, Rajiv Raman
2009 J jnl
Metric Embeddings with Relaxed Guarantees.
SIAM J. Comput.
T.-H. Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Aleksandrs Slivkins
2009 J jnl
Small Hop-diameter Sparse Spanners for Doubling Metrics.
Discret. Comput. Geom.
T.-H. Hubert Chan, Anupam Gupta
2008 A* conf
Approximating TSP on metrics with bounded global growth.
SODA
T.-H. Hubert Chan, Anupam Gupta
2008 A* conf
Ultra-low-dimensional embeddings for doubling metrics.
SODA
T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar
2007 — conf
A Theory of Loss-Leaders: Making Money by Pricing Below Cost.
WINE
Maria-Florina Balcan, Avrim Blum, T.-H. Hubert Chan, MohammadTaghi Hajiaghayi
2007 — conf
Multi-Dimensional Range Query over Encrypted Data.
S&P
Elaine Shi, John Bethencourt, T.-H. Hubert Chan, Dawn Xiaodong Song, Adrian Perrig
2006 — conf
A Random-Surfer Web-Graph Model.
ANALCO
Avrim Blum, T.-H. Hubert Chan, Mugizi Robert Rwebangira
2006 — conf
A Tight Lower Bound for the Steiner Point Removal Problem on Trees.
APPROX-RANDOM
T.-H. Hubert Chan, Donglin Xia, Goran Konjevod, Andréa W. Richa
2006 A* conf
Small hop-diameter sparse spanners for doubling metrics.
SODA
T.-H. Hubert Chan, Anupam Gupta
2006 A conf
Spanners with Slack.
ESA
T.-H. Hubert Chan, Michael Dinitz, Anupam Gupta
2005 A* conf
Metric Embeddings with Relaxed Guarantees.
FOCS
Ittai Abraham, Yair Bartal, T.-H. Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, Aleksandrs Slivkins