Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Thomas Cronin
Tidjani Négadi
Kei Terayama
Daniel P. Kennedy
Barbara Aquilani
Maximilian Dürr
Jhonathan Pinzon
Liangliang Shang
Chen Ma
R. Jeya
Home
/
Paper
/
Hardness of Constant-Round Communication Complexity.
Paper Info
Open Visualization
Title
Hardness of Constant-Round Communication Complexity.
Year
DOI
Venue
2021
10.4230/LIPIcs.CCC.2021.31
CCC
DocType
Volume
Citations
Conference
28
0
PageRank
References
Authors
0.34
0
3
Authors (3 rows)
Cited by (0 rows)
References (0 rows)
Name
Order
Citations
PageRank
Shuichi Hirahara
1
3
7.48
Rahul Ilango
2
0
2.03
Bruno Loff
3
49
10.39
1