9 citations · 23 across the 5 of their papers we have counts for
11 papers
On the Hardness of Opinion Dynamics Optimization with -Budget on Varying Susceptibility to Persuasion
T-H. Hubert Chan, Chui Shan Lee
Recently, Abebe et al. (KDD 2018) and Chan et al. (WWW 2019) have considered an opinion dynamics optimization problem that is based on a popular model for social opinion dynamics,…
Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search
Rediet Abebe, T-H. Hubert Chan, Jon Kleinberg +4
A long line of work in social psychology has studied variations in people's susceptibility to persuasion -- the extent to which they are willing to modify their opinions on a topic…
Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels
T-H. Hubert Chan, Zhibin Liang, Antigoni Polychroniadou +1
We revisit the problem of low-memory robust simulation of interactive protocols over noisy channels. Haeupler [FOCS 2014] considered robust simulation of two-party interactive prot…
More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting
T-H. Hubert Chan, Jonathan Katz, Kartik Nayak +2
The problem of Oblivious RAM (ORAM) has traditionally been studied in a single-server setting, but more recently the multi-server setting has also been considered. Yet it is still…
An SDP Primal-Dual Approximation Algorithm for Directed Hypergraph Expansion and Sparsest Cut with Product Demands
T-H. Hubert Chan, Bintao Sun
We give approximation algorithms for the edge expansion and sparsest cut with product demands problems on directed hypergraphs, which subsume previous graph models such as undirect…
Communication Complexity of Byzantine Agreement, Revisited
Ittai Abraham, T-H. Hubert Chan, Danny Dolev +4
As Byzantine Agreement (BA) protocols find application in large-scale decentralized cryptocurrencies, an increasingly important problem is to design BA protocols with improved comm…