"Tight bounds on the message complexity of distributed tree verification."

Shay Kutten, Peter Robinson, Ming Ming Tan (2025)

> Home

Details and statistics

DOI: 10.1007/S00446-025-00483-X

access: closed

type: Journal Article

metadata version: 2025-05-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dc/KuttenRT25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dc/KuttenRT25
Shay Kutten, Peter Robinson, Ming Ming Tan:
Tight bounds on the message complexity of distributed tree verification. Distributed Comput. 38(2): 113-130 (2025)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.