113
click to vote
SODA
2016
ACM
10 years 18 days ago
2016
ACM
We study efficient, deterministic interactive coding schemes that simulate any interactive protocol both under random and adversarial errors, and can achieve a constant communicat...
125
click to vote
SODA
2016
ACM
10 years 18 days ago
2016
ACM
Set cover, over a universe of size n, may be modelled as a data-streaming problem, where the m sets that comprise the instance are to be read one by one. A semi-streaming algorith...
233
click to vote
SODA
2016
ACM
10 years 18 days ago
2016
ACM
We report on a novel technique called spatial coupling and its application in the analysis of random constraint satisfaction problems (CSP). Spatial coupling was invented as an en...
123
click to vote
SODA
2016
ACM
10 years 18 days ago
2016
ACM
We initiate the study of trade-offs between sparsity and the number of measurements in sparse recovery schemes for generic norms. Specifically, for a norm · , sparsity paramete...