T-H. Hubert Chan | DeepAI

DeepAI AI Chat

Featured Co-authors

Tianhao Wang
49 publications
Xiaowei Wu
38 publications
Giulia Fanti
30 publications
Zhihao Gavin Tang
25 publications
Elaine Shi
18 publications
Ling Ren
14 publications
Kartik Nayak
14 publications
Jonathan Katz
9 publications
Rafael Pass
8 publications
Hao Xie
7 publications
Antigoni Polychroniadou
6 publications

∙ 04/26/2023

Game-Theoretically Secure Protocols for the Ordinal Random Assignment Problem

We study game-theoretically secure protocols for the classical ordinal a...

0 T-H. Hubert Chan, et al. ∙

∙ 08/25/2022

A Feedforward Unitary Equivariant Neural Network

We devise a new type of feedforward neural network. It is equivariant wi...

0 Pui-Wai Ma, et al. ∙

∙ 12/07/2021

Locally Differentially Private Sparse Vector Aggregation

Vector mean estimation is a central primitive in federated analytics. In...

0 Mingxun Zhou, et al. ∙

∙ 05/10/2021

On the Hardness of Opinion Dynamics Optimization with L_1-Budget on Varying Susceptibility to Persuasion

Recently, Abebe et al. (KDD 2018) and Chan et al. (WWW 2019) have consid...

0 T-H. Hubert Chan, et al. ∙

∙ 08/04/2020

Bucket Oblivious Sort: An Extremely Simple Oblivious Sort

We propose a conceptually simple oblivious sort and oblivious random per...

0 Gilad Asharov, et al. ∙

∙ 10/27/2019

Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels

We revisit the problem of low-memory robust simulation of interactive pr...

0 T-H. Hubert Chan, et al. ∙

∙ 09/04/2018

More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting

The problem of Oblivious RAM (ORAM) has traditionally been studied in a ...

0 T-H. Hubert Chan, et al. ∙

∙ 05/09/2018

Communication-Efficient Byzantine Agreement without Erasures

Byzantine agreement (BA) is one of the most fundamental building blocks ...

0 T-H. Hubert Chan, et al. ∙

∙ 05/05/2018

An SDP Primal-Dual Approximation Algorithm for Directed Hypergraph Expansion and Sparsest Cut with Product Demands

We give approximation algorithms for the edge expansion and sparsest cut...

0 T-H. Hubert Chan, et al. ∙

∙ 04/30/2018

Generalizing the Hypergraph Laplacian via a Diffusion Process with Mediators

In a recent breakthrough STOC 2015 paper, a continuous diffusion process...

0 T-H. Hubert Chan, et al. ∙

∙ 11/05/2017

Diffusion Operator and Spectral Analysis for Directed Hypergraph Laplacian

In spectral graph theory, the Cheeger's inequality gives upper and lower...

0 T-H. Hubert Chan, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world