Abstract is missing.
- From Distributed Algorithms to Machine Learning and BackRoger Wattenhofer. 1 [doi]
- A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of StatesDaisuke Yokota, Yuichi Sudo, Fukuhito Ooshita, Toshimitsu Masuzawa. 2-12 [doi]
- Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol ModelTalley Amir, James Aspnes, Petra Berenbrink, Felix Biermeier, Christopher Hahn, Dominik Kaaser, John Lazarsfeld. 13-23 [doi]
- Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-NextRomain Cosson, Laurent Massoulié, Laurent Viennot. 24-27 [doi]
- Brief Announcement: Population Protocols Decide Double-exponential ThresholdsPhilipp Czerner. 28-31 [doi]
- The Complexity of Distributed Approximation of Packing and Covering Integer Linear ProgramsYi-Jun Chang, Zeyong Li. 32-43 [doi]
- n) Time in the Distributed and Parallel SettingsShang-En Huang, Hsin-Hao Su. 44-54 [doi]
- Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their ApplicationsYi-Jun Chang. 55-66 [doi]
- Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar GraphsJinfeng Dou, Thorsten Götte, Henning Hillebrandt, Christian Scheideler, Julian Werthmann. 67-70 [doi]
- Brief Announcement: Minimum Cost Maximum Flow in the CONGEST ModelTijn de Vos. 71-74 [doi]
- Brief Announcement: The Laplacian Paradigm in Deterministic Congested CliqueSebastian Forster, Tijn de Vos. 75-78 [doi]
- Word-Size RMR Tradeoffs for Recoverable Mutual ExclusionDavid Yu Cheng Chan, George Giakkoupis, Philipp Woelfel. 79-89 [doi]
- Asynchronous Wait-Free Runtime Verification and Enforcement of LinearizabilityArmando Castañeda, Gilde Valeria Rodríguez. 90-101 [doi]
- The ERA Theorem for Safe Memory ReclamationGali Sheffi, Erez Petrank. 102-112 [doi]
- Efficient Bounded Timestamping from Standard Synchronization PrimitivesBenyamin Bashari, Ali Jamadi, Philipp Woelfel. 113-123 [doi]
- A Wait-free Queue with Polylogarithmic Step ComplexityHossein Naderibeni, Eric Ruppert. 124-134 [doi]
- Distributed MIS in O(log log n) Awake ComplexityFabien Dufoulon, William K. Moses Jr., Gopal Pandurangan. 135-145 [doi]
- Distributed MIS with Low Energy and Time ComplexitiesMohsen Ghaffari 0001, Julian Portmann. 146-156 [doi]
- Distributed Symmetry Breaking on Power Graphs via SparsificationYannic Maus, Saku Peltonen, Jara Uitto. 157-167 [doi]
- Brief Announcement: What Can We Compute in a Single Round of the Congested Clique?Peter Robinson. 168-171 [doi]
- Brief Announcement: Local Problems in the SUPPORTED ModelAkanksha Agrawal, John Augustine, David Peleg, Srikkanth Ramachandran. 172-175 [doi]
- Brief Announcement: Efficient Computation in Congested Anonymous Dynamic NetworksGiuseppe Antonio Di Luna, Giovanni Viglietta. 176-179 [doi]
- A Near-Optimal Deterministic Distributed SynchronizerMohsen Ghaffari 0001, Anton Trygub. 180-189 [doi]
- Deterministic Fault-Tolerant Connectivity Labeling SchemeTaisuke Izumi, Yuval Emek, Tadashi Wadayama, Toshimitsu Masuzawa. 190-199 [doi]
- Universally Composable Simultaneous Broadcast against a Dishonest Majority and ApplicationsMyrto Arapinis, Ábel Kocsis, Nikolaos Lamprou, Liam Medley, Thomas Zacharias 0001. 200-210 [doi]
- Distributed Averaging in Opinion DynamicsPetra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzagão, Frederik Mallmann-Trenn, Tomasz Radzik, Nicolas Rivera. 211-221 [doi]
- Sparse Semi-Oblivious Routing: Few Random Paths SufficeGoran Zuzic, Bernhard Haeupler, Antti Roeyskoe. 222-232 [doi]
- BeeGees: Stayin' Alive in Chained BFTNeil Giridharan, Florian Suri-Payer, Matthew Ding, Heidi Howard, Ittai Abraham, Natacha Crooks. 233-243 [doi]
- Optimal Eventual Byzantine Agreement Protocols with Omission FailuresKaya Alpturer, Joseph Y. Halpern, Ron van der Meyden. 244-252 [doi]
- On the Amortized Communication Complexity of Byzantine BroadcastJun Wan, Atsuki Momose, Ling Ren 0001, Elaine Shi, Zhuolun Xiang. 253-261 [doi]
- Distributed CONGEST Algorithms against Mobile AdversariesOrr Fischer, Merav Parter. 262-273 [doi]
- f + 1 ValidationsRida A. Bazzi, Sara Tucci Piergiovanni. 274-277 [doi]
- Brief Announcement: Discrete Incremental VotingColin Cooper, Tomasz Radzik, Takeharu Shiraga. 278-281 [doi]
- Brief Announcement: The MBroadcast AbstractionMathilde Déprés, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal. 282-285 [doi]
- Brief Announcement: Improved Consensus in Quantum NetworksMohammadTaghi Hajiaghayi, Dariusz Rafal Kowalski, Jan Olkowski. 286-289 [doi]
- Uniting General-Graph and Geometric-Based Radio Networks via Independence Number ParametrizationPeter Davies. 290-299 [doi]
- Optimal Message-Passing with Noisy BeepsPeter Davies. 300-309 [doi]
- Distributed Self-Stabilizing MIS with Few States and Weak CommunicationGeorge Giakkoupis, Isabella Ziccardi. 310-320 [doi]
- The Impact of Cooperation in Bilateral Network CreationTobias Friedrich 0001, Hans Gawendowicz, Pascal Lenzner, Arthur Zahn. 321-331 [doi]
- On the Validity of ConsensusPierre Civit, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira. 332-343 [doi]
- Deterministic Fault-Tolerant Distributed Computing in Linear Time and CommunicationBogdan S. Chlebus, Dariusz Rafal Kowalski, Jan Olkowski. 344-354 [doi]
- Improved Tradeoffs for Leader ElectionShay Kutten, Peter Robinson 0002, Ming Ming Tan, Xianbin Zhu 0002. 355-365 [doi]
- Brief Announcement: Efficient Recoverable Writable-CASPrasad Jayanti, Siddhartha Visveswara Jayanti, Sucharita Jayanti. 366-369 [doi]
- Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower BoundsAnh Tran, Edward Talmage. 370-373 [doi]
- Brief Announcement: CausalEC: A Causally Consistent Data Storage Algorithm based on Cross-Object Erasure CodingViveck R. Cadambe, Shihang Lyu. 374-377 [doi]