External Links

    Journal: Distributed Computing

    Volume 36, Issue 4

    419 -- 449Barun Gorain, Avery Miller, Andrzej Pelc. Four shades of deterministic leader election in anonymous networks
    451 -- 473Alkida Balliu, Mohsen Ghaffari 0001, Fabian Kuhn, Dennis Olivetti. Node and edge averaged complexities of local graph problems
    475 -- 499Ioannis Anagnostides, Christoph Lenzen 0001, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis. Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts
    501 -- 528Keren Censor Hillel, Shir Cohen, Ran Gelles, Gal Sela 0001. Distributed computations in fully-defective networks
    529 -- 0Keren Censor Hillel, Shir Cohen, Ran Gelles, Gal Sela 0001. Correction to: Distributed computations in fully-defective networks

    Volume 36, Issue 3

    209 -- 218Philipp Czerner, Javier Esparza, Jérôme Leroux. Lower bounds on the state complexity of population protocols
    219 -- 252Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, Alin Tomescu. Reaching consensus for asynchronous distributed key generation
    253 -- 275Guy Goren, Shay Vargaftik, Yoram Moses. Stochastic coordination in heterogeneous load balancing systems
    277 -- 311Alkida Balliu, Sebastian Brandt 0002, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela, Aleksandr Tereshchenko. Locally checkable problems in rooted trees
    313 -- 347Thorsten Götte, Kristian Hinnenthal, Christian Scheideler, Julian Werthmann. Time-optimal construction of overlay networks
    349 -- 371Petr Kuznetsov, Yvonne Anne Pignolet, Pavel Ponomarev, Andrei Tonkikh. Permissionless and asynchronous asset transfer
    373 -- 384Varsha Dani, Aayush Gupta, Thomas P. Hayes, Seth Pettie. Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks
    385 -- 394Michael Elkin, Yuval Gitlitz, Ofer Neiman. Improved weighted additive spanners
    395 -- 418Vitaly Aksenov, Dan Alistarh, Alexandra Drozdova, Amirkeivan Mohtashami. The splay-list: a distribution-adaptive concurrent skip-list

    Volume 36, Issue 2

    89 -- 106Armando Castañeda, Sergio Rajsbaum, Michel Raynal. Set-Linearizable Implementations from Read/Write Operations: Sets, Fetch &Increment, Stacks and Queues with Multiplicity
    107 -- 135Emilio Cruciani, Hlafo Alfie Mimun, Matteo Quattropani, Sara Rizzo. Phase transition of the k-majority dynamics in biased communication models
    137 -- 157Rob van Glabbeek, Vincent Gramoli, Pierre Tholoniat. Cross-chain payment protocols with success guarantees
    159 -- 192Joshua J. Daymude, Andréa W. Richa, Christian Scheideler. The canonical amoebot model: algorithms and concurrency control
    193 -- 207Walter Hussak, Amitabh Trehan. Termination of amnesiac flooding

    Volume 36, Issue 1

    1 -- 0Hagit Attiya. Special issue on DISC 2019
    3 -- 28Ittai Abraham, T.-H. Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren 0001, Elaine Shi. Communication complexity of byzantine agreement, revisited
    29 -- 43Mirza Ahad Baig, Danny Hendler, Alessia Milani, Corentin Travers. Long-lived counters with polylogarithmic amortized step complexity
    45 -- 55Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman. Optimal distributed covering algorithms
    57 -- 87Orr Fischer, Rotem Oshman. A distributed algorithm for directed minimum-weight spanning tree
    runs on