Abstract is missing.
- Communication Patterns and Input Patterns in Distributed Computing - (Invited Talk)Michel Raynal. 1-15 [doi]
- Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic ApproachOfer Feinerman, Amos Korman. 16-30 [doi]
- Node Labels in Local DecisionPierre Fraigniaud, Juho Hirvonen, Jukka Suomela. 31-45 [doi]
- Exact Bounds for Distributed Graph ColouringJoel Rybicki, Jukka Suomela. 46-60 [doi]
- Essential Traffic Parameters for Shared Memory Switch PerformancePatrick Th. Eugster, Alexander Kesselman, Kirill Kogan, Sergey I. Nikolenko, Alexander Sirotkin. 61-75 [doi]
- Scheduling Multipacket Frames with Frame DeadlinesLukasz Jez, Yishay Mansour, Boaz Patt-Shamir. 76-90 [doi]
- A Randomized Algorithm for Online Scheduling with Interval ConflictsMarcin Bienkowski, Artur Kraska, Pawel Schmidt. 91-103 [doi]
- Online Admission Control and Embedding of Service ChainsTamás Lukovszki, Stefan Schmid. 104-118 [doi]
- Optimizing Spread of Influence in Social Networks via Partial IncentivesGennaro Cordasco, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro. 119-134 [doi]
- Approximation Algorithms for Multi-budgeted Network Design ProblemsGeorgios Stamoulis. 135-148 [doi]
- Simple Distributed Δ + 1 Coloring in the SINR ModelFabian Fuchs, Roman Prutkin. 149-163 [doi]
- Nearly Optimal Local Broadcasting in the SINR Model with FeedbackLeonid Barenboim, David Peleg. 164-178 [doi]
- Byzantine Gathering in NetworksSébastien Bouchard, Yoann Dieudonné, Bertrand Ducourthial. 179-193 [doi]
- Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n2) Messages, and Constant TimeAchour Mostéfaoui, Michel Raynal. 194-208 [doi]
- A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation - (Extended Abstract)Leonid Barenboim, Michael Elkin, Cyril Gavoille. 209-223 [doi]
- Path-Fault-Tolerant Approximate Shortest-Path TreesAnnalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci 0001, Guido Proietti. 224-238 [doi]
- A Faster Computation of All the Best Swap Edges of a Tree SpannerDavide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci 0001, Guido Proietti. 239-253 [doi]
- Randomized OBDD-Based Graph AlgorithmsMarc Bury. 254-269 [doi]
- On Fast and Robust Information Spreading in the Vertex-Congest ModelKeren Censor Hillel, Tariq Toukan. 270-284 [doi]
- Information Spreading by Mobile Particles on a LineJurek Czyzowicz, Evangelos Kranakis, Eduardo Pacheco, Dominik Pajak. 285-298 [doi]
- On Space and Time Complexity of Loosely-Stabilizing Leader ElectionTaisuke Izumi. 299-312 [doi]
- Wait-Free Gathering Without ChiralityQuentin Bramas, Sébastien Tixeuil. 313-327 [doi]
- Treasure Hunt with AdviceDennis Komm, Rastislav Královic, Richard Královic, Jasmin Smula. 328-341 [doi]
- Lower Bounds for the Capture Time: Linear, Quadratic, and BeyondKlaus-Tycho Förster, Rijad Nuridini, Jara Uitto, Roger Wattenhofer. 342-356 [doi]
- Collaborative Exploration by Energy-Constrained Mobile RobotsShantanu Das 0001, Dariusz Dereniowski, Christina Karousatou. 357-369 [doi]
- Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages ModelJarkko Kari, Martín Matamala, Ivan Rapaport, Ville Salo. 370-384 [doi]
- A Separation of n-consensus and (n + 1)-consensus Based on Process SchedulingCarole Delporte-Gallet, Hugues Fauconnier, Sam Toueg. 385-398 [doi]
- Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of PriorityYoram Moses, Katia Patkin. 399-413 [doi]
- The Computability of Relaxed Data Structures: Queues and Stacks as ExamplesNir Shavit, Gadi Taubenfeld. 414-428 [doi]
- Comparison-Based Interactive Collaborative FilteringYuval Carmel, Boaz Patt-Shamir. 429-443 [doi]
- Coalescing Walks on Rotor-Router SystemsColin Cooper, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga. 444-458 [doi]
- Secure Multi-party ShufflingMahnush Movahedi, Jared Saia, Mahdi Zamani. 459-473 [doi]