T.-H. Hubert Chan
Orcid: 0000-0002-8340-235XAffiliations:
- University of Hong Kong, Department of Computer Science, Hong Kong
- Max Planck Institute for Informatics, Saarbrücken, Germany (former)
- Carnegie Mellon University, Computer Science Department, Pittsburgh, PA, USA (former)
According to our database1,
T.-H. Hubert Chan
authored at least 121 papers
between 2005 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on i.cs.hku.hk
-
on hub.hku.hk
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
Finding Subgraphs with Maximum Total Density and Limited Overlap in Weighted Hypergraphs.
ACM Trans. Knowl. Discov. Data, May, 2024
Theor. Comput. Sci., February, 2024
Proceedings of the WALCOM: Algorithms and Computation, 2024
Privacy Amplification by Iteration for ADMM with (Strongly) Convex Objective Functions.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
2023
Distributed Comput., March, 2023
IACR Cryptol. ePrint Arch., 2023
Proceedings of the 6th International Conference on Machine Learning and Natural Language Processing, 2023
Proceedings of the Frontiers of Algorithmics - 17th International Joint Conference, 2023
Proceedings of the Applied Cryptography and Network Security, 2023
2022
IEEE Trans. Knowl. Data Eng., 2022
Opinion Dynamics Optimization by Varying Susceptibility to Persuasion via Non-Convex Local Search.
ACM Trans. Knowl. Discov. Data, 2022
SIGMETRICS Perform. Evaluation Rev., 2022
IACR Cryptol. ePrint Arch., 2022
Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022
2021
Distributed approximate k-core decomposition and min-max edge orientation: Breaking the diameter barrier.
J. Parallel Distributed Comput., 2021
Differentially Oblivious Database Joins: Overcoming the Worst-Case Curse of Fully Oblivious Algorithms.
IACR Cryptol. ePrint Arch., 2021
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021
On the Hardness of Opinion Dynamics Optimization with L<sub>1</sub>-Budget on Varying Susceptibility to Persuasion.
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021
Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021
2020
Re-Revisiting Learning on Hypergraphs: Confidence Interval, Subgradient Method, and Extension to Multiclass.
IEEE Trans. Knowl. Data Eng., 2020
ACM Trans. Knowl. Discov. Data, 2020
Theor. Comput. Sci., 2020
A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics.
ACM Trans. Algorithms, 2020
Proc. VLDB Endow., 2020
Optimizing Social Welfare for Network Bargaining Games in the Face of Instability, Greed and Idealism.
Theory Comput. Syst., 2020
Game-Theoretically Fair Leader Election in O(log log n) Rounds under Majority Coalitions.
IACR Cryptol. ePrint Arch., 2020
Perfectly Secure Oblivious Parallel RAM with O(log<sup>3</sup> N/ log log N) Overhead.
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search.
CoRR, 2020
Proceedings of the Wireless Algorithms, Systems, and Applications, 2020
Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020
Proceedings of the Public-Key Cryptography - PKC 2020, 2020
Proceedings of the Frontiers in Algorithmics - 14th International Workshop, 2020
2019
Theor. Comput. Sci., 2019
Revisiting Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search.
Proceedings of the World Wide Web Conference, 2019
2018
Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics.
ACM Trans. Algorithms, 2018
Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity.
ACM Trans. Algorithms, 2018
SIAM J. Comput., 2018
J. ACM, 2018
IACR Cryptol. ePrint Arch., 2018
An SDP Primal-Dual Approximation Algorithm for Directed Hypergraph Expansion and Sparsest Cut with Product Demands.
CoRR, 2018
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018
SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018
2017
ACM Trans. Algorithms, 2017
Oblivious Hashing Revisited, and Applications to Asymptotically Efficient ORAM and OPRAM.
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
Proceedings of the 26th International Conference on World Wide Web, 2017
Proceedings of the Theory of Cryptography - 15th International Conference, 2017
Online Submodular Maximization with Free Disposal: Randomization Beats ¼ for Partition Matroids.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
Proceedings of the 34th International Conference on Machine Learning, 2017
Proceedings of the 25th Annual European Symposium on Algorithms, 2017
Double Auction for Resource Allocation in Cloud Computing.
Proceedings of the CLOSER 2017, 2017
Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, 2017
2016
IACR Cryptol. ePrint Arch., 2016
Online Submodular Maximization with Free Disposal: Randomization Beats 0.25 for Partition Matroids.
CoRR, 2016
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016
Proceedings of the 24th Annual European Symposium on Algorithms, 2016
2015
IACR Cryptol. ePrint Arch., 2015
Spectral Properties of Laplacian and Stochastic Diffusion Process for Edge Expansion in Hypergraphs.
CoRR, 2015
Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree.
Algorithmica, 2015
Proceedings of the Eighth ACM International Conference on Web Search and Data Mining, 2015
Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online <i>K</i>-Item Auction and Bipartite <i>K</i>-Matching with Random Arrival Order.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015
2014
IACR Cryptol. ePrint Arch., 2014
Algorithmica, 2014
Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
Proceedings of the 23rd International Conference on Computer Communication and Networks, 2014
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014
2013
CoRR, 2013
2012
IACR Cryptol. ePrint Arch., 2012
Differentially Private Continual Monitoring of Heavy Hitters from Distributed Streams.
IACR Cryptol. ePrint Arch., 2012
Incubators vs Zombies: Fault-Tolerant, Short, Thin and Lanky Spanners for Doubling Metrics
CoRR, 2012
Optimizing Social Welfare for Network Bargaining Games in the Face of Unstability, Greed and Spite.
Proceedings of the Algorithms - ESA 2012, 2012
2011
ACM Trans. Database Syst., 2011
IACR Cryptol. ePrint Arch., 2011
IACR Cryptol. ePrint Arch., 2011
Discret. Comput. Geom., 2011
Proceedings of the Network and Distributed System Security Symposium, 2011
Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011
2010
Proceedings of the Database Theory, 2010
2009
Discret. Comput. Geom., 2009
2007
Proceedings of the Internet and Network Economics, Third International Workshop, 2007
Proceedings of the 2007 IEEE Symposium on Security and Privacy (S&P 2007), 2007
2006
Proceedings of the Approximation, 2006
Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, 2006
2005
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005