Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > DAVID WOODRUFF:
All reports by Author David Woodruff:

TR15-083 | 14th May 2015
Omri Weinstein, David Woodruff

The Simultaneous Communication of Disjointness with Applications to Data Streams

We study $k$-party set disjointness in the simultaneous message-passing model, and show that even if each element $i\in[n]$ is guaranteed to either belong to all $k$ parties or to at most $O(1)$ parties in expectation (and to at most $O(\log n)$ parties with high probability), then $\Omega(n \min(\log 1/\delta, \log ... more >>>


TR15-031 | 2nd March 2015
Marco Molinaro, David Woodruff, Grigory Yaroslavtsev

Amplification of One-Way Information Complexity via Codes and Noise Sensitivity

Revisions: 1

We show a new connection between the information complexity of one-way communication problems under product distributions and a relaxed notion of list-decodable codes. As a consequence, we obtain a characterization of the information complexity of one-way problems under product distributions for any error rate based on covering numbers. This generalizes ... more >>>




ISSN 1433-8092 | Imprint