Cited By
View all- Göös MWatson T(2020)A Lower Bound for Sampling Disjoint SetsACM Transactions on Computation Theory10.1145/340485812:3(1-13)Online publication date: 20-Jul-2020
We prove several results which, together with prior work, provide a nearly-complete picture of the relationships among classical communication complexity classes between $${\mathsf{P}}$$P and $${\mathsf{PSPACE}}$$PSPACE, short of proving lower bounds ...
In this paper, we study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system. In short, we show that an adaptive adversary can significantly hamper the spreading of a rumor, while an oblivious adversary cannot. ...
We prove nearly matching upper and lower bounds on the randomized communication complexity of the following problem: Alice and Bob are each given a probability distribution over n elements, and they wish to estimate within ±ε the statistical (total ...
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
Dagstuhl, Germany
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in