17 citations · 24 across the 15 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
cs.DS2024
Near-Optimal Trace Reconstruction for Mildly Separated Strings
Anders Aamand, Allen Liu, Shyam Narayanan
In the trace reconstruction problem our goal is to learn an unknown string given independent traces of . A trace is obtained by independently deleting each bit…
cs.DS2024
Statistical-Computational Trade-offs for Density Estimation
Anders Aamand, Alexandr Andoni, Justin Y. Chen +4
We study the density estimation problem defined as follows: given distributions over a discrete domain , as well as a collection of samples chosen from…
cs.DS2024
Differentially Private Gomory-Hu Trees
Anders Aamand, Justin Y. Chen, Mina Dalirrooyfard +4
Given an undirected, weighted -vertex graph , a Gomory-Hu tree is a weighted tree on such that for any pair of distinct vertices , the Min-…