Fetching the paper…
Reading the bibliography…
In a multiparty message-passing model of communication, there are $k$ players.
Noiseless coding of correlated information sources
D. Slepian and J.K. Wolf · 1973
Earlier work this paper cites.
Reaching agreement in the presence of faults
M. Pease, R. Shostak, and L. Lamport · 1980
Earlier work this paper cites.
Another advantage of free choice (extended abstract): Completely asynchronous agreement protocols
Michael Ben-Or · 1983
Earlier work this paper cites.
Impossibility of distributed consensus with one faulty process
Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson · 1985
Earlier work this paper cites.
Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract)
Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson · 1988
Earlier work this paper cites.
Sharing memory robustly in message-passing systems
Hagit Attiya, Amotz Bar-Noy, and Danny Dolev · 1990
Earlier work this paper cites.
Randomized broadcast in networks
U. Feige, David Peleg, P. Raghavan, and Eli Upfal · 1990
Earlier work this paper cites.
On ACC [circuit complexity]
R. Beigel and J. Tarui · 1991
Earlier work this paper cites.
Determinism vs. nondeterminism in multiparty communication complexity
Danny Dolev and Tomas Feder · 1992
Earlier work this paper cites.
The probabilistic communication complexity of set intersection
Bala Kalyanasundaram and Georg Schnitger · 1992
Earlier work this paper cites.
On the distributed complexity of disjointness
Razborov · 1992
Earlier work this paper cites.
Communication complexity
Eyal Kushilevitz and Noam Nisan · 1997
Earlier work this paper cites.
The part-time parliament
Leslie Lamport and Keith Marzullo · 1998
Earlier work this paper cites.
Lower bounds on the multiparty communication complexity
Jos D. P. Rolim Pavol Duris · 1998
Earlier work this paper cites.
Randomized rumor spreading
R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking · 2000
Earlier work this paper cites.
Informational complexity and the direct sum problem for simultaneous message complexity
Amit Chakrabarti, Yaoyun Shi, Anthony Wirth, and Andrew Chi-Chih Yao · 2001
Earlier work this paper cites.
Near-optimal lower bounds on the multi-party communication complexity of set disjointness
A. Chakrabarti, S. Khot, and X. Sun · 2003
Cited alongside, same era.
Gossip-based computation of aggregate information
David Kempe, Alin Dobra, and Johannes Gehrke · 2003
Cited alongside, same era.
An information statistics approach to data stream and communication complexity
Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, and D. Sivakumar · 2004
Cited alongside, same era.
A note on efficient aggregate queries in sensor networks
B. Patt-Shamir · 2004
Cited alongside, same era.
Sketching streams through the net: distributed approximate query tracking
Graham Cormode and Minos Garofalakis · 2005
Cited alongside, same era.
Finding (recently) frequent items in distributed data streams
Amit Manjhi, Vladislav Shkapenyuk, Kedar Dhamdhere, and Christopher Olston · 2005
Information equals amortized communication
Mark Braverman and Anup Rao · 2011
Later among the works it cites.
The story of set disjointness
A. Chattopadhyay and T. Pitassi · 2011
Later among the works it cites.
The complexity of data aggregation in directed networks
F. Kuhn and R. Oshman · 2011
Later among the works it cites.
The hardness of being private
Anil Ada, Arkadev Chattopadhyay, Stephen A. Cook, Lila Fontes, Michal Koucký, and Toniann Pitassi · 2012
Later among the works it cites.
Personal communication, 2012
Noga Alon · 2012
Later among the works it cites.
From information to exact communication
Mark Braverman, Ankit Garg, Denis Pankratov, and Omri Weinstein · 2012
Later among the works it cites.
The communication complexity of task allocation
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Elements of information theory (2. ed.)
Thomas M. Cover and Joy A. Thomas · 2006
Cited alongside, same era.
Communication Complexity
E. Kushilevitz and N. Nisan · 2006
Cited alongside, same era.
Multiparty communication complexity of disjointness
A. Chattopadhyay and A. Ada · 2008
Cited alongside, same era.
Gossip-based aggregate computation: computing faster with non address-oblivious schemes
Roberto Di Pietro and Pietro Michiardi · 2008
Cited alongside, same era.
Disjointness is hard in the multi-party number-on-the-forehead model
T. Lee and A. Shraibman · 2008
Cited alongside, same era.
Asymptotically optimal lower bounds on the nih-multi-party information
Andre Gronemeier · 2009
Cited alongside, same era.
A. Drucker, F. Kuhn, and R. Oshman · 2012
Later among the works it cites.
Networks cannot compute their diameter in sublinear time
Silvio Frischknecht, Stephan Holzer, and Roger Wattenhofer · 2012
Later among the works it cites.
On deterministic sketching and streaming for sparse recovery and norm estimation
Jelani Nelson, HuyL. Nguyn, and DavidP. Woodruff · 2012
Later among the works it cites.
Lower bounds for number-in-hand multiparty communication complexity, made easy
Jeff M. Phillips, Elad Verbin, and Qin Zhang · 2012
Later among the works it cites.
Distributed verification and hardness of distributed approximation
Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, and Roger Wattenhofer · 2012
Later among the works it cites.
The multiparty communication complexity of set disjointness
A.A. Sherstov · 2012
Later among the works it cites.
Tight bounds for distributed functional monitoring
David P. Woodruff and Qin Zhang · 2012
Later among the works it cites.
Communication lower bounds using directional derivatives
Alexander A Sherstov · 2013
Closest in time.
Distributed computation does not help
David P. Woodruff and Qin Zhang · 2013
Closest in time.