Tight bounds on the message complexity of distributed tree verification.
- Published in:
- Distributed Computing, 2025, v. 38, n. 2, p. 113, doi. 10.1007/s00446-025-00483-x
- By:
- Publication type:
- Article
Works matching IS 01782770 AND DT 2025 AND VI 38 AND IP 2
Results: 4
1
2
Massively parallel algorithms for approximate shortest paths.
- Published in:
- Distributed Computing, 2025, v. 38, n. 2, p. 131, doi. 10.1007/s00446-025-00482-y
- By:
- Publication type:
- Article
3
Efficient computation in congested anonymous dynamic networks.
- Published in:
- Distributed Computing, 2025, v. 38, n. 2, p. 95, doi. 10.1007/s00446-025-00481-z
- By:
- Publication type:
- Article
4
When is recoverable consensus harder than consensus?
- Published in:
- Distributed Computing, 2025, v. 38, n. 2, p. 73, doi. 10.1007/s00446-025-00476-w
- By:
- Publication type:
- Article