default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDistributed Computing, Volume 32
Volume 32, Number 1, February 2019
- Yiyan Lin, Sandeep S. Kulkarni
, Arshad Jhumka:
Automation of fault-tolerant graceful degradation. 1-25 - Magnús M. Halldórsson, Sven Köhler, Dror Rawitz:
Distributed approximation of k-service assignment. 27-40 - Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev:
Fast distributed algorithms for testing graph properties. 41-57 - Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Gustavo Posta:
Self-stabilizing repeated balls-into-bins. 59-68 - Paulo Sérgio Almeida, Carlos Baquero:
Scalable eventually consistent counters over unreliable networks. 69-89
Volume 32, Number 2, April 2019
- Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
Asynchronous Arbitrary Pattern Formation: the effects of a rigorous approach. 91-132 - Christoph Lenzen, Boaz Patt-Shamir, David Peleg:
Distributed distance computation and routing with small messages. 133-157 - Magnús M. Halldórsson, Yuexuan Wang, Dongxiao Yu:
Leveraging multiple channels in ad hoc networks. 159-172
Volume 32, Number 3, June 2019
- Lucas Boczkowski, Amos Korman, Emanuele Natale:
Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits. 173-191 - Nicolas Tabareau, Éric Tanter:
Chemical foundations of distributed aspects. 193-216 - Pierre Fraigniaud, Boaz Patt-Shamir, Mor Perry:
Randomized proof-labeling schemes. 217-234 - Manuel Alcantara, Armando Castañeda, David Flores-Peñaloza, Sergio Rajsbaum:
The topology of look-compute-move robot wait-free algorithms with hard termination. 235-255
Volume 32, Number 4, August 2019
- Pierre Fraigniaud, Emanuele Natale:
Noisy rumor spreading and plurality consensus. 257-276 - Lili Su, Nitin H. Vaidya:
Defending non-Bayesian learning against adversarial attacks. 277-289 - Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
Embedded pattern formation by asynchronous robots without chirality. 291-315 - Sébastien Bouchard, Marjorie Bournat, Yoann Dieudonné, Swan Dubois, Franck Petit:
Asynchronous approach in the plane: a deterministic polynomial algorithm. 317-337 - Christoph Lenzen, Joel Rybicki:
Near-optimal self-stabilising counting and firing squads. 339-360
Volume 32, Number 5, October 2019
- Ning Chen, Martin Hoefer, Marvin Künnemann, Chengyu Lin, Peihan Miao:
Secretary markets with local information. 361-378 - Marek Klonowski, Dariusz R. Kowalski, Jaroslaw Mirek:
Ordered and delayed adversaries and how to work against them on a shared channel. 379-403 - Keren Censor-Hillel, Ran Gelles, Bernhard Haeupler:
Making asynchronous distributed computations robust to noise. 405-421 - Niloufar Shafiei:
Non-blocking Patricia tries with replace operations. 423-442 - Kyrill Winkler, Manfred Schwarz, Ulrich Schmid:
Consensus in rooted dynamic networks with short-lived stability. 443-458
Volume 32, Number 6, December 2019
- Hagit Attiya:
Special issue on PODC 2015 and PODC 2016. 459 - Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela:
Algebraic methods in the congested clique. 461-478 - Swan Dubois, Rachid Guerraoui, Petr Kuznetsov, Franck Petit, Pierre Sens:
The weakest failure detector for eventual consistency. 479-492 - Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny:
Search on a line with faulty robots. 493-504 - Noga Alon, Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Reliable communication over highly connected noisy networks. 505-515 - Jeremy T. Fineman, Seth Gilbert, Fabian Kuhn, Calvin Newport:
Contention resolution on a fading channel. 517-533 - Wojciech M. Golab, Aditya Ramaraju:
Recoverable mutual exclusion. 535-564 - George Giakkoupis, Philipp Woelfel:
Efficient randomized test-and-set implementations. 565-586
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-05 22:25 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:
