| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Almost global problems in the LOCAL model
|
Balliu, Alkida
|
|
|
|
4 |
p. 259-281
|
article
|
| 2 |
Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts
|
Anagnostides, Ioannis
|
|
|
|
4 |
p. 475-499
|
article
|
| 3 |
A nearly optimal upper bound for the self-stabilization time in Herman’s algorithm
|
Feng, Yuan
|
|
2015
|
|
4 |
p. 233-244
|
article
|
| 4 |
An efficient distributed algorithm for constructing small dominating sets
|
Jia, Lujun
|
|
2002
|
|
4 |
p. 193-205
|
article
|
| 5 |
A network pricing game for selfish traffic
|
Hayrapetyan, Ara
|
|
2007
|
|
4 |
p. 255-266
|
article
|
| 6 |
An improved lower bound for the time complexity of mutual exclusion
|
Anderson, James H.
|
|
2002
|
|
4 |
p. 221-253
|
article
|
| 7 |
A simple and fast asynchronous consensus protocol based on a weak failure detector
|
Hurfin, Michel
|
|
1999
|
|
4 |
p. 209-223
|
article
|
| 8 |
Asynchronous approach in the plane: a deterministic polynomial algorithm
|
Bouchard, Sébastien
|
|
2018
|
|
4 |
p. 317-337
|
article
|
| 9 |
A taxonomy of process calculi for distribution and mobility
|
Gorla, Daniele
|
|
2010
|
|
4 |
p. 273-299
|
article
|
| 10 |
Beeping a maximal independent set
|
Afek, Yehuda
|
|
2012
|
|
4 |
p. 195-208
|
article
|
| 11 |
Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model
|
Mashreghi, Ali
|
|
|
|
4 |
p. 283-299
|
article
|
| 12 |
Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding
|
Jain, Kamal
|
|
2006
|
|
4 |
p. 301-311
|
article
|
| 13 |
Coloring unstructured radio networks
|
Moscibroda, Thomas
|
|
2008
|
|
4 |
p. 271-284
|
article
|
| 14 |
Comments on deriving protocol specifications from service specifications written in LOTOS
|
Kapus-Kolar, Monika
|
|
1999
|
|
4 |
p. 175-177
|
article
|
| 15 |
Common2 extended to stacks and unbounded concurrency
|
Afek, Yehuda
|
|
2007
|
|
4 |
p. 239-252
|
article
|
| 16 |
Computation in networks of passively mobile finite-state sensors
|
Angluin, Dana
|
|
|
|
4 |
p. 235-253
|
article
|
| 17 |
Correction to: Distributed computations in fully-defective networks
|
Censor-Hillel, Keren
|
|
|
|
4 |
p. 529
|
article
|
| 18 |
Defending non-Bayesian learning against adversarial attacks
|
Su, Lili
|
|
2018
|
|
4 |
p. 277-289
|
article
|
| 19 |
Distance estimation and object location via rings of neighbors
|
Slivkins, Aleksandrs
|
|
2006
|
|
4 |
p. 313-333
|
article
|
| 20 |
Distributed algorithms for the Lovász local lemma and graph coloring
|
Chung, Kai-Min
|
|
2016
|
|
4 |
p. 261-280
|
article
|
| 21 |
Distributed computations in fully-defective networks
|
Censor-Hillel, Keren
|
|
|
|
4 |
p. 501-528
|
article
|
| 22 |
Distributed verification of minimum spanning trees
|
Korman, Amos
|
|
2007
|
|
4 |
p. 253-266
|
article
|
| 23 |
Eclecticism shrinks even small worlds
|
Fraigniaud, Pierre
|
|
|
|
4 |
p. 279-291
|
article
|
| 24 |
Editorial
|
Aspnes, James
|
|
2006
|
|
4 |
p. 253
|
article
|
| 25 |
Editorial: Time for Change
|
,
|
|
2000
|
|
4 |
p. 187
|
article
|
| 26 |
Election in partially anonymous networks with arbitrary knowledge in message passing systems
|
Chalopin, Jérémie
|
|
2012
|
|
4 |
p. 297-311
|
article
|
| 27 |
Embedded pattern formation by asynchronous robots without chirality
|
Cicerone, Serafino
|
|
2018
|
|
4 |
p. 291-315
|
article
|
| 28 |
Extending the wait-free hierarchy to multi-threaded systems
|
Perrin, Matthieu
|
|
|
|
4 |
p. 375-398
|
article
|
| 29 |
Failure detectors encapsulate fairness
|
Pike, Scott M.
|
|
2012
|
|
4 |
p. 313-333
|
article
|
| 30 |
Fast and compact self-stabilizing verification, computation, and fault detection of an MST
|
Korman, Amos
|
|
2015
|
|
4 |
p. 253-295
|
article
|
| 31 |
Fast and scalable rendezvousing
|
Afek, Yehuda
|
|
2013
|
|
4 |
p. 243-269
|
article
|
| 32 |
Faster communication in known topology radio networks
|
Gąsieniec, Leszek
|
|
2006
|
|
4 |
p. 289-300
|
article
|
| 33 |
Fast primal-dual distributed algorithms for scheduling and matching problems
|
Panconesi, Alessandro
|
|
2010
|
|
4 |
p. 269-283
|
article
|
| 34 |
Fault tolerance in distributed systems using fused state machines
|
Balasubramanian, Bharath
|
|
2014
|
|
4 |
p. 287-311
|
article
|
| 35 |
Fault-tolerant aggregation: Flow-Updating meets Mass-Distribution
|
Almeida, Paulo Sérgio
|
|
2016
|
|
4 |
p. 281-291
|
article
|
| 36 |
Four shades of deterministic leader election in anonymous networks
|
Gorain, Barun
|
|
|
|
4 |
p. 419-449
|
article
|
| 37 |
Gathering on rings under the Look–Compute–Move model
|
D’Angelo, Gianlorenzo
|
|
2014
|
|
4 |
p. 255-285
|
article
|
| 38 |
Genuinely distributed Byzantine machine learning
|
El-Mhamdi, El-Mahdi
|
|
|
|
4 |
p. 305-331
|
article
|
| 39 |
Geometric and combinatorial views on asynchronous computability
|
Goubault, Éric
|
|
2018
|
|
4 |
p. 289-316
|
article
|
| 40 |
Greedy routing in small-world networks with power-law degrees
|
Fraigniaud, Pierre
|
|
2014
|
|
4 |
p. 231-253
|
article
|
| 41 |
Improved distributed Δ-coloring
|
Ghaffari, Mohsen
|
|
|
|
4 |
p. 239-258
|
article
|
| 42 |
Introduction
|
Shavit, Nir
|
|
2002
|
|
4 |
p. 191
|
article
|
| 43 |
Introduction to the special issue of papers from DISC 2015
|
Moses, Yoram
|
|
2018
|
|
4 |
p. 255
|
article
|
| 44 |
Knowledge, level of symmetry, and time of leader election
|
Fusco, Emanuele G.
|
|
2014
|
|
4 |
p. 221-232
|
article
|
| 45 |
Locality and checkability in wait-free computing
|
Fraigniaud, Pierre
|
|
2013
|
|
4 |
p. 223-242
|
article
|
| 46 |
Localization for a system of colliding robots
|
Czyzowicz, Jurek
|
|
2014
|
|
4 |
p. 245-252
|
article
|
| 47 |
Lock-free reference counting
|
Detlefs, David L.
|
|
2002
|
|
4 |
p. 255-271
|
article
|
| 48 |
Lower and upper bounds for single-scanner snapshot implementations
|
Fatourou, Panagiota
|
|
2016
|
|
4 |
p. 231-260
|
article
|
| 49 |
Lower bound for scalable Byzantine Agreement
|
Holtby, Dan
|
|
2008
|
|
4 |
p. 239-248
|
article
|
| 50 |
Lower bounds for searching robots, some faulty
|
Kupavskii, Andrey
|
|
|
|
4 |
p. 229-237
|
article
|
| 51 |
Misleading stars: what cannot be measured in the internet?
|
Pignolet, Yvonne-Anne
|
|
2013
|
|
4 |
p. 209-222
|
article
|
| 52 |
Modelling and verifying the AODV routing protocol
|
Glabbeek, Rob van
|
|
2016
|
|
4 |
p. 279-315
|
article
|
| 53 |
Multi-shot distributed transaction commit
|
Chockler, Gregory
|
|
|
|
4 |
p. 301-318
|
article
|
| 54 |
Nearly optimal perfectly periodic schedules
|
Bar-Noy, Amotz
|
|
2002
|
|
4 |
p. 207-220
|
article
|
| 55 |
Near-optimal self-stabilising counting and firing squads
|
Lenzen, Christoph
|
|
2018
|
|
4 |
p. 339-360
|
article
|
| 56 |
Node and edge averaged complexities of local graph problems
|
Balliu, Alkida
|
|
|
|
4 |
p. 451-473
|
article
|
| 57 |
Noisy rumor spreading and plurality consensus
|
Fraigniaud, Pierre
|
|
2018
|
|
4 |
p. 257-276
|
article
|
| 58 |
On implementing omega in systems with weak reliability and synchrony assumptions
|
Aguilera, Marcos K.
|
|
2008
|
|
4 |
p. 285-314
|
article
|
| 59 |
On spectrum sharing games
|
Halldórsson, Magnús M.
|
|
2010
|
|
4 |
p. 235-248
|
article
|
| 60 |
On the establishment of distinct identities in overlay networks
|
Bazzi, Rida A.
|
|
2007
|
|
4 |
p. 267-287
|
article
|
| 61 |
On the inherent weakness of conditional primitives
|
Fich, Faith Ellen
|
|
|
|
4 |
p. 267-277
|
article
|
| 62 |
On the optimal space complexity of consensus for anonymous processes
|
Gelashvili, Rati
|
|
2018
|
|
4 |
p. 317-326
|
article
|
| 63 |
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
|
Fernández Anta, Antonio
|
|
2012
|
|
4 |
p. 279-296
|
article
|
| 64 |
Peer counting and sampling in overlay networks based on random walks
|
Ganesh, A. J.
|
|
2007
|
|
4 |
p. 267-278
|
article
|
| 65 |
Plausible clocks: constant size logical clocks for distributed systems
|
Torres-Rojas, Francisco J.
|
|
1999
|
|
4 |
p. 179-195
|
article
|
| 66 |
Progress under bounded fairness
|
Hesselink, Wim H.
|
|
1999
|
|
4 |
p. 197-207
|
article
|
| 67 |
Proof labeling schemes
|
Korman, Amos
|
|
2010
|
|
4 |
p. 215-233
|
article
|
| 68 |
Rambo: a robust, reconfigurable atomic memory service for dynamic networks
|
Gilbert, Seth
|
|
2010
|
|
4 |
p. 225-272
|
article
|
| 69 |
Restoration by path concatenation: fast recovery of MPLS paths
|
Afek, Yehuda
|
|
2002
|
|
4 |
p. 273-283
|
article
|
| 70 |
Revisiting asynchronous fault tolerant computation with optimal resilience
|
Abraham, Ittai
|
|
|
|
4 |
p. 333-355
|
article
|
| 71 |
Sequentially consistent versus linearizable counting networks
|
Mavronicolas, Marios
|
|
2008
|
|
4 |
p. 249-269
|
article
|
| 72 |
Signed quorum systems
|
Yu, Haifeng
|
|
|
|
4 |
p. 307-323
|
article
|
| 73 |
Simple dynamics for plurality consensus
|
Becchetti, Luca
|
|
2016
|
|
4 |
p. 293-306
|
article
|
| 74 |
Single-source shortest paths in the CONGEST model with improved bounds
|
Chechik, Shiri
|
|
|
|
4 |
p. 357-374
|
article
|
| 75 |
Smoothed analysis of dynamic networks
|
Dinitz, Michael
|
|
2017
|
|
4 |
p. 273-287
|
article
|
| 76 |
Special issue on DISC 2011
|
Peleg, David
|
|
2013
|
|
4 |
p. 193
|
article
|
| 77 |
Special issue on PODC 2020
|
Attiya, Hagit
|
|
|
|
4 |
p. 303
|
article
|
| 78 |
Special issue on PODC 2018 and DISC 2018
|
Attiya, Hagit
|
|
|
|
4 |
p. 227
|
article
|
| 79 |
Stable leader election in population protocols requires linear time
|
Doty, David
|
|
2016
|
|
4 |
p. 257-271
|
article
|
| 80 |
The computational power of population protocols
|
Angluin, Dana
|
|
2007
|
|
4 |
p. 279-304
|
article
|
| 81 |
The Forgiving Graph: a distributed data structure for low stretch under adversarial attack
|
Hayes, Thomas P.
|
|
2012
|
|
4 |
p. 261-278
|
article
|
| 82 |
The weakest failure detector to solve nonuniform consensus
|
Eisler, Jonathan
|
|
2007
|
|
4 |
p. 335-359
|
article
|
| 83 |
Towards worst-case churn resistant peer-to-peer systems
|
Kuhn, Fabian
|
|
2010
|
|
4 |
p. 249-267
|
article
|
| 84 |
Universal constructions that ensure disjoint-access parallelism and wait-freedom
|
Ellen, Faith
|
|
2016
|
|
4 |
p. 251-277
|
article
|
| 85 |
Upper and lower bounds for deterministic broadcast in powerline communication networks
|
Pignolet, Yvonne Anne
|
|
2016
|
|
4 |
p. 239-250
|
article
|
Journal description