35 citations · 114 across the 25 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.CC2017
String Matching: Communication, Circuits, and Learning
Alexander Golovnev, Mika Göös, Daniel Reichman +1
String matching is the problem of deciding whether a given -bit string contains a given -bit pattern. We study the complexity of this problem in three settings. Communication…
cs.LG2017★ 3 cited
Inference in Sparse Graphs with Pairwise Measurements and Side Information
Dylan J. Foster, Daniel Reichman, Karthik Sridharan
We consider the statistical problem of recovering a hidden "ground truth" binary labeling for the vertices of a graph up to low Hamming error from noisy edge and vertex measurement…