Abstract is missing.
- Realizability of Graph Specifications: Characterizations and AlgorithmsAmotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz. 3-13 [doi]
- A Self-Stabilizing Algorithm for Maximal Matching in Link-Register ModelJohanne Cohen, George Manoussakis, Laurence Pilard, Devan Sohier. 14-19 [doi]
- Message-Efficient Self-stabilizing Transformer Using Snap-Stabilizing Quiescence DetectionAnaïs Durand, Shay Kutten. 20-24 [doi]
- Constant-Space Self-stabilizing Token Distribution in TreesYuichi Sudo, Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa. 25-29 [doi]
- Distributed Counting Along Lossy Paths Without FeedbackVitalii Demianiuk, Sergey Gorinsky, Sergey I. Nikolenko, Kirill Kogan. 30-33 [doi]
- Make&Activate-Before-Break: Policy Preserving Seamless Routes Replacement in SDNYefim Dinitz, Shlomi Dolev, Daniel Khankin. 34-37 [doi]
- Brief Announcement: Fast Approximate Counting and Leader Election in PopulationsOthon Michail, Paul G. Spirakis, Michail Theofilatos. 38-42 [doi]
- One-Max Constant-Probability Networks: Results and Future WorkMark Korenblit. 43-47 [doi]
- Reaching Distributed Equilibrium with Limited ID SpaceDor Bank, Moshe Sulamy, Eyal Waserman. 48-51 [doi]
- Crash-Tolerant Consensus in Directed Graph Revisited (Extended Abstract)Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar. 55-71 [doi]
- A Distributed Algorithm for Finding Hamiltonian Cycles in Random Graphs in O(\log n) TimeVolker Turau. 72-87 [doi]
- Simple and Local Independent Set ApproximationRavi B. Boppana, Magnús M. Halldórsson, Dror Rawitz. 88-101 [doi]
- On the Strongest Message Adversary for Consensus in Directed Dynamic NetworksUlrich Schmid 0001, Manfred Schwarz, Kyrill Winkler. 102-120 [doi]
- Symmetric Rendezvous with Advice: How to Rendezvous in a DiskKonstantinos Georgiou, Jay Griffiths, Yuval Yakubov. 121-133 [doi]
- Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique ModelPedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, Ioan Todinca. 134-148 [doi]
- Space-Efficient Uniform Deployment of Mobile Agents in Asynchronous Unidirectional RingsMasahiro Shibata, Hirotsugu Kakugawa, Toshimitsu Masuzawa. 149-164 [doi]
- Explorable Families of GraphsAndrzej Pelc. 165-177 [doi]
- A Characterization of t-Resilient Colorless Task Anonymous SolvabilityCarole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum, Nayuta Yanagisawa. 178-192 [doi]
- Deterministic Distributed Ruling Sets of Line GraphsFabian Kuhn, Yannic Maus, Simon Weidner. 193-208 [doi]
- Broadcast with Energy-Exchanging Mobile Agents Distributed on a TreeJurek Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter. 209-225 [doi]
- A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(\log N\log \varDelta /\log ^2\log \varDelta ) RoundsRan Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman. 226-236 [doi]
- Online Service with Delay on a LineMarcin Bienkowski, Artur Kraska, Pawel Schmidt. 237-248 [doi]
- Mixed Fault Tolerance in Server Assignment: Combining Reinforcement and BackupTal Navon, David Peleg. 249-263 [doi]
- Communication Complexity in Vertex Partition Whiteboard ModelTomasz Jurdzinski, Krzysztof Lorys, Krzysztof Nowicki 0002. 264-279 [doi]
- Time-Bounded Influence Diffusion with IncentivesGennaro Cordasco, Luisa Gargano, Joseph G. Peters, Adele A. Rescigno, Ugo Vaccaro. 280-295 [doi]
- Balanced Allocations and Global Clock in Population Protocols: An Accurate AnalysisYves Mocquard, Bruno Sericola, Emmanuelle Anceaume. 296-311 [doi]
- On Knowledge and Communication Complexity in Distributed SystemsDaniel Pfleger, Ulrich Schmid. 312-330 [doi]
- Connectivity and Minimum Cut Approximation in the Broadcast Congested CliqueTomasz Jurdzinski, Krzysztof Nowicki 0002. 331-344 [doi]
- Biased Clocks: A Novel Approach to Improve the Ability To Perform Predicate Detection with O(1) ClocksVidhya Tekken Valapil, Sandeep S. Kulkarni. 345-360 [doi]
- Gathering in the Plane of Location-Aware Robots in the Presence of SpiesJurek Czyzowicz, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Oscar Morales Ponce. 361-376 [doi]
- Formalizing Compute-Aggregate Problems in Cloud ComputingPavel Chuprikov, Alex Davydow, Kirill Kogan, Sergey I. Nikolenko, Alexander Sirotkin. 377-391 [doi]
- Priority Evacuation from a Disk Using Mobile Robots - (Extended Abstract)Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende. 392-407 [doi]