


default search action
Distributed Computing, Volume 35
Volume 35, Number 1, February 2022
- Rachid Guerraoui

, Petr Kuznetsov, Matteo Monti, Matej Pavlovic
, Dragos-Adrian Seredinschi:
The consensus number of a cryptocurrency. 1-15 - Rachid Guerraoui

, Petr Kuznetsov, Matteo Monti, Matej Pavlovic
, Dragos-Adrian Seredinschi:
Correction to: The consensus number of a cryptocurrency. 17 - Costas Busch

, Maurice Herlihy, Miroslav Popovic
, Gokarna Sharma
:
Dynamic scheduling in distributed transactional memory. 19-36 - Matthias Volk

, Borzoo Bonakdarpour, Joost-Pieter Katoen, Saba Aflaki:
Synthesizing optimal bias in randomized self-stabilization. 37-57 - Bogdan S. Chlebus

, Dariusz R. Kowalski, Shailesh Vaya:
Distributed bare-bones communication in wireless networks. 59-80 - Vassos Hadzilacos, Xing Hu

, Sam Toueg:
On atomic registers and randomized consensus in M&M systems. 81-103
Volume 35, Number 2, April 2022
- Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta

:
TuringMobile: a turing machine of oblivious mobile robots with limited visibility and its applications. 105-122 - Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses:

Unbeatable consensus. 123-143 - Emin Karayel

, Edgar Gonzàlez
:
Strong eventual consistency of the collaborative editing framework WOOT. 145-164 - Danupon Nanongkai, Michele Scquizzato

:
Equivalence classes and conditional hardness in massively parallel computations. 165-183 - Othon Michail

, George Skretas
, Paul G. Spirakis
:
Distributed computation and reconfiguration in actively dynamic networks. 185-206
Volume 35, Number 3, June 2022
- Talya Eden

, Nimrod Fiat, Orr Fischer, Fabian Kuhn, Rotem Oshman:
Sublinear-time distributed algorithms for detecting small cliques and even cycles. 207-234 - Sébastien Bouchard, Yoann Dieudonné

, Anissa Lamani:
Byzantine gathering in polynomial time. 235-263 - Konrad Siek

, Pawel T. Wojciechowski
:
Last-use opacity: a strong safety property for transactional memory with prerelease support. 265-301
Volume 35, Number 4, August 2022
- Hagit Attiya:

Special issue on PODC 2020. 303 - El-Mahdi El-Mhamdi, Rachid Guerraoui

, Arsany Guirguis
, Lê-Nguyên Hoang, Sébastien Rouault:
Genuinely distributed Byzantine machine learning. 305-331 - Ittai Abraham, Danny Dolev, Gilad Stern

:
Revisiting asynchronous fault tolerant computation with optimal resilience. 333-355 - Shiri Chechik, Doron Mukhtar:

Single-source shortest paths in the CONGEST model with improved bounds. 357-374 - Matthieu Perrin

, Achour Mostéfaoui, Grégoire Bonin, Ludmila Courtillat-Piazza:
Extending the wait-free hierarchy to multi-threaded systems. 375-398
Volume 35, Number 5, October 2022
- Martin Florian

, Sebastian A. Henningsen, Charmaine Ndolo, Björn Scheuermann:
The sum of its parts: Analysis of federated byzantine agreement systems. 399-417 - Michael Elkin, Ofer Neiman

:
Linear-Size hopsets with small hopbound, and constant-hopbound hopsets in RNC. 419-437 - Walter Cazzola

, Francesco Cesarini, Luca Tansini:
PerformERL: a performance testing framework for erlang. 439-454 - Leonid Barenboim, Gal Oren

:
Distributed backup placement. 455-473
Volume 35, Number 6, December 2022
- Hagit Attiya:

Special issue on DISC 2020. 475 - Petr Kuznetsov, Andrei Tonkikh

:
Asynchronous reconfiguration with Byzantine failures. 477-502 - Manuel Bravo, Gregory V. Chockler

, Alexey Gotsman:
Making Byzantine consensus live. 503-532 - Yannic Maus

, Tigran Tonoyan
:
Linial for lists. 533-546 - Da-Jung Cho, Matthias Függer, Corbin Hopper, Manish Kushwaha

, Thomas Nowak
, Quentin Soubeyran:
Distributed computation with continual population growth. 547-569

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














