Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2401.11991
Cited By
Tight Bounds on the Message Complexity of Distributed Tree Verification
22 January 2024
S. Kutten
Peter Robinson
Ming Ming Tan
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Tight Bounds on the Message Complexity of Distributed Tree Verification"
1 / 1 papers shown
Title
Can We Break Symmetry with o(m) Communication?
Shreyas Pai
Gopal Pandurangan
Sriram V. Pemmaraju
Peter Robinson
LRM
48
9
0
19 May 2021
1
