Tight bounds on the message complexity of distributed tree verification.
Saved in:
| Title: | Tight bounds on the message complexity of distributed tree verification. |
|---|---|
| Authors: | Kutten, Shay1, Robinson, Peter2, Tan, Ming Ming2, mtan@augusta.edu |
| Source: | Distributed Computing; Jun2025, Vol. 38 Issue 2, p113-130, 18p |
| Database: | Applied Science & Technology Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| ISSN: | 01782770 |
|---|---|
| DOI: | 10.1007/s00446-025-00483-x |