default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDistributed 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
Volume 38, Number 3, September 2025
- Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum:
A speedup theorem for asynchronous computation with applications to consensus and approximate agreement. 163-183 - Orr Fischer, Adi Horowitz, Rotem Oshman:
Massively parallel computation in a heterogeneous regime. 185-206 - Dan Alistarh, Joel Rybicki, Sasha Voitovych:
Near-Optimal Leader Election in Population Protocols on Graphs. 207-245 - Peter Davies-Peck:
Optimal message-passing with noisy beeps. 247-260 - Yannic Maus, Saku Peltonen, Jara Uitto:
Distributed symmetry breaking on power graphs via sparsification. 261-296 - Benyamin Bashari, Ali Jamadi, Philipp Woelfel:
Efficient bounded timestamping from standard synchronization primitives. 297-335
Volume 38, Number 4, December 2025
- Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young:
Contention resolution with message deadlines. 337-355 - Lélia Blin, Colette Johnen, Gabriel Le Bouder, Franck Petit:
Silent anonymous snap-stabilizing termination detection. 357-375 - Yuval Emek, Noga Harlev, Taisuke Izumi:
Towards distributed two-stage stochastic optimization. 377-395 - Alkida Balliu, Sebastian Brandt, Manuela Fischer, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto:
Exponential speedup over locality in MPC with optimal memory. 397-434 - Avery Miller, Andrzej Pelc:
Fast deterministic rendezvous in labeled lines. 435-489
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.
last updated on 2025-12-09 00:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
