


default search action
Distributed Computing, Volume 38
Volume 38, Number 1, March 2025
- Erica Blum, Elette Boyle, Ran Cohen
, Chen-Da Liu-Zhang:
Communication lower bounds for cryptographic broadcast protocols. 1-17 - Maxime Flin, Parth Mittal:
(Δ + 1) vertex coloring in O(n) communication. 19-29 - Taisuke Izumi, Yuval Emek, Tadashi Wadayama, Toshimitsu Masuzawa:
Deterministic fault-tolerant connectivity labeling scheme. 31-50 - Naama Ben-David, Guy E. Blelloch:
Fast and fair randomized wait-free locks. 51-72
Volume 38, Number 2, June 2025
- Carole Delporte-Gallet, Panagiota Fatourou, Hugues Fauconnier, Eric Ruppert:
When is recoverable consensus harder than consensus? 73-94 - Giuseppe Antonio Di Luna, Giovanni Viglietta:
Efficient computation in congested anonymous dynamic networks. 95-112 - Shay Kutten, Peter Robinson, Ming Ming Tan:
Tight bounds on the message complexity of distributed tree verification. 113-130 - Michal Dory, Shaked Matar:
Massively parallel algorithms for approximate shortest paths. 131-162

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.