@inproceedings{10216,
  abstract     = {This paper reports a new concurrent graph data structure that supports updates of both edges and vertices and queries: Breadth-first search, Single-source shortest-path, and Betweenness centrality. The operations are provably linearizable and non-blocking.},
  author       = {Chatterjee, Bapi and Peri, Sathya and Sa, Muktikanta},
  booktitle    = {35th International Symposium on Distributed Computing},
  isbn         = {9-783-9597-7210-5},
  issn         = {1868-8969},
  location     = {Freiburg, Germany},
  publisher    = {Schloss Dagstuhl - Leibniz Zentrum für Informatik},
  title        = {{Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds}},
  doi          = {10.4230/LIPIcs.DISC.2021.52},
  volume       = {209},
  year         = {2021},
}

@inproceedings{10217,
  abstract     = {This paper gives tight logarithmic lower bounds on the solo step complexity of leader election in an asynchronous shared-memory model with single-writer multi-reader (SWMR) registers, for both deterministic and randomized obstruction-free algorithms. The approach extends to lower bounds for deterministic and randomized obstruction-free algorithms using multi-writer registers under bounded write concurrency, showing a trade-off between the solo step complexity of a leader election algorithm, and the worst-case number of stalls incurred by a processor in an execution.},
  author       = {Alistarh, Dan-Adrian and Gelashvili, Rati and Nadiradze, Giorgi},
  booktitle    = {35th International Symposium on Distributed Computing},
  isbn         = {9-783-9597-7210-5},
  issn         = {1868-8969},
  location     = {Freiburg, Germany},
  publisher    = {Schloss Dagstuhl - Leibniz Zentrum für Informatik},
  title        = {{Lower bounds for shared-memory leader election under bounded write contention}},
  doi          = {10.4230/LIPIcs.DISC.2021.4},
  volume       = {209},
  year         = {2021},
}

@inproceedings{10218,
  abstract     = {Let G be a graph on n nodes. In the stochastic population protocol model, a collection of n indistinguishable, resource-limited nodes collectively solve tasks via pairwise interactions. In each interaction, two randomly chosen neighbors first read each other’s states, and then update their local states. A rich line of research has established tight upper and lower bounds on the complexity of fundamental tasks, such as majority and leader election, in this model, when G is a clique. Specifically, in the clique, these tasks can be solved fast, i.e., in n polylog n pairwise interactions, with high probability, using at most polylog n states per node. In this work, we consider the more general setting where G is an arbitrary graph, and present a technique for simulating protocols designed for fully-connected networks in any connected regular graph. Our main result is a simulation that is efficient on many interesting graph families: roughly, the simulation overhead is polylogarithmic in the number of nodes, and quadratic in the conductance of the graph. As an example, this implies that, in any regular graph with conductance φ, both leader election and exact majority can be solved in φ^{-2} ⋅ n polylog n pairwise interactions, with high probability, using at most φ^{-2} ⋅ polylog n states per node. This shows that there are fast and space-efficient population protocols for leader election and exact majority on graphs with good expansion properties.},
  author       = {Alistarh, Dan-Adrian and Gelashvili, Rati and Rybicki, Joel},
  booktitle    = {35th International Symposium on Distributed Computing},
  isbn         = {9-783-9597-7210-5},
  issn         = {1868-8969},
  location     = {Freiburg, Germany},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Brief announcement: Fast graphical population protocols}},
  doi          = {10.4230/LIPIcs.DISC.2021.43},
  volume       = {209},
  year         = {2021},
}

@inproceedings{10219,
  abstract     = {We show that any algorithm that solves the sinkless orientation problem in the supported LOCAL model requires Ω(log n) rounds, and this is tight. The supported LOCAL is at least as strong as the usual LOCAL model, and as a corollary this also gives a new, short and elementary proof that shows that the round complexity of the sinkless orientation problem in the deterministic LOCAL model is Ω(log n).},
  author       = {Korhonen, Janne and Paz, Ami and Rybicki, Joel and Schmid, Stefan and Suomela, Jukka},
  booktitle    = {35th International Symposium on Distributed Computing},
  isbn         = {9-783-9597-7210-5},
  issn         = {1868-8969},
  location     = {Freiburg, Germany},
  publisher    = {Schloss Dagstuhl - Leibniz Zentrum für Informatik},
  title        = {{Brief announcement: Sinkless orientation is hard also in the supported LOCAL model}},
  doi          = {10.4230/LIPIcs.DISC.2021.58},
  volume       = {209},
  year         = {2021},
}