The following pages link to T.-H. Hubert Chan (Q650108):
Displayed 50 items.
- A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics (Q650109) (← links)
- On \((1, \epsilon )\)-restricted max-min fair allocation problem (Q724228) (← links)
- Perfectly secure oblivious parallel RAM (Q1631354) (← links)
- Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs (Q1690263) (← links)
- More is less: perfectly secure oblivious algorithms in the multi-server setting (Q1710668) (← links)
- SDP primal-dual approximation algorithms for directed hypergraph expansion and sparsest cut with product demands (Q1791038) (← links)
- Influence maximization under the non-progressive linear threshold model (Q2037963) (← links)
- Sublinear-round Byzantine agreement under corrupt majority (Q2055693) (← links)
- Game-theoretic fairness meets multi-party protocols: the case of leader election (Q2128554) (← links)
- Optimizing social welfare for network bargaining games in the face of instability, greed and idealism (Q2195569) (← links)
- An SDP primal-dual algorithm for approximating the Lovász-theta function (Q2249741) (← links)
- Sparse fault-tolerant spanners for doubling metrics with bounded hop-diameter or degree (Q2258072) (← links)
- Diffusion operator and spectral analysis for directed hypergraph Laplacian (Q2317870) (← links)
- On the depth of oblivious parallel RAM (Q2412885) (← links)
- Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM (Q2412887) (← links)
- Communication complexity of Byzantine agreement, revisited (Q2689834) (← links)
- On the hardness of opinion dynamics optimization with \(L_1\)-budget on varying susceptibility to persuasion (Q2695321) (← links)
- Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree (Q2843246) (← links)
- Approximating TSP on Metrics with Bounded Global Growth (Q2910854) (← links)
- Optimizing Social Welfare for Network Bargaining Games in the Face of Unstability, Greed and Spite (Q2912847) (← links)
- Optimal Lower Bound for Differentially Private Multi-party Aggregation (Q2912848) (← links)
- New Doubling Spanners: Better and Simpler (Q2954370) (← links)
- Oblivious RAM with O((logN)3) Worst-Case Cost (Q3102186) (← links)
- Cheeger Inequalities for General Edge-Weighted Directed Graphs (Q3196370) (← links)
- On the Complexity of the Minimum Independent Set Partition Problem (Q3196378) (← links)
- Ultra-low-dimensional embeddings for doubling metrics (Q3578200) (← links)
- (Q3579379) (← links)
- (Q3579397) (← links)
- Private and Continual Release of Statistics (Q3587456) (← links)
- A Tight Lower Bound for the Steiner Point Removal Problem on Trees (Q3595405) (← links)
- Metric Embeddings with Relaxed Guarantees (Q3654378) (← links)
- Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity (Q4554339) (← links)
- Distributed Private Data Analysis (Q4554940) (← links)
- Reducing Curse of Dimensionality (Q4554955) (← links)
- Spectral Properties of Hypergraph Laplacian and Approximation Algorithms (Q4561502) (← links)
- Path ORAM (Q4561506) (← links)
- Beating ratio 0.5 for weighted oblivious matching problems (Q4606268) (← links)
- (Q4608037) (← links)
- Online Submodular Maximization with Free Disposal (Q4629970) (← links)
- Privacy-Preserving Stream Aggregation with Fault Tolerance (Q4648489) (← links)
- On Hierarchical Routing in Doubling Metrics (Q4962632) (← links)
- A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics (Q4987441) (← links)
- Online Submodular Maximization Problem with Vector Packing Constraint. (Q5111710) (← links)
- Communication Complexity of Byzantine Agreement, Revisited (Q5145228) (← links)
- Foundations of Differentially Oblivious Algorithms (Q5236339) (← links)
- New Doubling Spanners: Better and Simpler (Q5326571) (← links)
- 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 (Q5363004) (← links)
- (Q5417622) (← links)
- Spanners with Slack (Q5449528) (← links)
- MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture (Q5875782) (← links)