Distributed Complexity is a theoretical framework in parallel complexity theory that characterizes the inherent difficulty of computational problems in terms of the minimum amount of communication and coordination required among distributed processors to solve them efficiently.
79
Publications
8.6K
Citations
143
Authors
74
Institutions
Publications per year
2017–2026
19
Parents
Publications
79
Reaching Agreement in the Presence of Faults
Marshall C. Pease, Robert E. Shostak, Leslie Lamport · Journal of the ACM · 1980 · 2.4K citations · Full text
On the complexity of distributed graph coloring
Fabian Kühn, Rogert Wattenhofer · 2006 · 196 citations
1–5 of 79
Authors
143
- MG
8
h-index
- FK
5
h-index
- AP
4
h-index
- RW
3
h-index
- MF
3
h-index
1–5 of 143
Institutions
74
ETH Zurich
Zurich, Switzerland
9 h-index
17 publications
1.2K citations
Massachusetts Institute of Technology
Cambridge, United States
7 h-index
11 publications
317 citations
Weizmann Institute of Science
Rehovot, Israel
5 h-index
8 publications
491 citations
Emory University
Atlanta, United States
3 h-index
5 publications
252 citations
Princeton University
Princeton, United States
3 h-index
3 publications
124 citations
Adam Mickiewicz University in Poznań
Poznan, Poland
3 h-index
6 publications
291 citations
University of Freiburg
Freiburg im Breisgau, Germany
3 h-index
4 publications
272 citations
University of Waterloo
Waterloo, Canada
3 h-index
5 publications
66 citations
1–8 of 74
Venues
- arXiv (Cornell University)
Repository · 9 publications · 194 citations
9
h-index
- Journal of the ACM
JACM · 5 publications · 2.6K citations
5
h-index
- DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
Repository · 3 publications · 67 citations
3
h-index
- IEEE Transactions on Parallel and Distributed Systems
TPDS · 2 publications · 71 citations
2
h-index
- Distributed Computing
2 publications · 60 citations
2
h-index
1–5