Keyword

communication complexity

Description: Communication complexity is a measure of the amount of information participants must exchange to solve a problem in a distributed computation.

Primary topic: Complexity and Algorithms in Graphs (24%)

Wikidata ID: wiki/Q5154130

OpenAlex ID: keywords/communication-complexity

Protocols for secure computations

1982 · Andrew C. Yao · Annual Symposium on Foundations of Computer Science · 3,283

Protocols for secure computations

1982 · Andrew Chi-Chih Yao · 2,660

Computational Complexity

2009 · Sanjeev Arora, Boaz Barak · Cambridge University Press eBooks · 1,687

Communication Complexity

2005 · Written Dömötör Pálvölgyi, Supervisor Zoltán Király, et al. · Springer eBooks · 1,629

Distributed Kalman filtering for sensor networks

2007 · R. Olfati-Saber · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · 1,621

Private information retrieval

1998 · Benny Chor, Eyal Kushilevitz, et al. · Journal of the ACM · 1,612

PDF

Data Streams: Algorithms and Applications

2005 · S. Muthukrishnan · now publishers, Inc. eBooks · 1,437

Scheduling multithreaded computations by work stealing

1999 · Robert D. Blumofe, Charles E. Leiserson · Journal of the ACM · 1,337

The knowledge complexity of interactive proof-systems

1985 · S Goldwasser, S Micali, et al. · 1,304

PDF

Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols

2007 · Ronald Cramer, Ivan Damgård, et al. · Springer eBooks · 1,153

Private information retrieval

2002 · B. Chor, O. Goldreich, et al. · Annual Symposium on Foundations of Computer Science · 1,116

Some complexity questions related to distributive computing(Preliminary Report)

1979 · Andrew Chi-Chih Yao · ACM Symposium on Theory of Computing (STOC) · 1,048

PDF

HotStuff

2019 · Maofan Yin, Dahlia Malkhi, et al. · ACM Symposium on Principles of Distributed Computing (PODC) · 1,033

PDF

Replication is not needed: single database, computationally-private information retrieval

2002 · E. Kushilevitz, R. Ostrovsky · Annual Symposium on Foundations of Computer Science · 932

A secure and optimally efficient multi‐authority election scheme

1997 · Ronald Cramer, Rosario Gennaro, et al. · European Transactions on Telecommunications · 791

Improved Garbled Circuit: Free XOR Gates and Applications

2008 · Vladimir Kolesnikov, Thomas Schneider · Lecture notes in computer science · 754

Data Streams: Algorithms and Applications

2005 · S. Muthukrishnan · Foundations and Trends® in Theoretical Computer Science · 718

Complexity of network synchronization

1985 · Baruch Awerbuch · Journal of the ACM · 687

PDF

Harnessing Smoothness to Accelerate Distributed Optimization

2017 · Guannan Qu, Na Li · IEEE Transactions on Control of Network Systems · 680

PDF

An Introduction to Kolmogorov Complexity and Its Applications

1993 · Ming Li, Paul Vitányi · Springer eBooks · 638

Fast Distributed Gradient Methods

2014 · Dusan Jakovetic, Joao Xavier, et al. · IEEE Transactions on Automatic Control · 622

A note on efficient zero-knowledge proofs and arguments (extended abstract)

1992 · Joe Kilian · ACM Symposium on Theory of Computing (STOC) · 609

PDF

Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures

2009 · Vadim Lyubashevsky · Lecture notes in computer science · 576

Small-Bias Probability Spaces: Efficient Constructions and Applications

1993 · Joseph Naor, Moni Naor · SIAM Journal on Computing · 560

An extended localized algorithm for connected dominating set formation in ad hoc wireless networks

2004 · F. Dai, J. Wu · IEEE Transactions on Parallel and Distributed Systems · 515

Works count: 6,824

Citation count: 131,100