40 citations · 52 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2018
Tracking the Norm with Constant Update Time
Chi-Ning Chou, Zhixian Lei, Preetum Nakkiran
The \emph{ tracking problem} is the task of obtaining a streaming algorithm that, given access to a stream of items from a universe , outputs at e…
cs.DS2018★ 40 cited
(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs
Boaz Barak, Chi-Ning Chou, Zhixian Lei +2
We give a quasipolynomial time algorithm for the graph matching problem (also known as noisy or robust graph isomorphism) on correlated random graphs. Specifically, for every …