Accepted Papers
Mahnush Movahedi, Jared Saia and Mahdi Zamani.
Secure Multi-Party Shuffling
Keren Censor-Hillel and Tariq Toukan.
On Fast and Robust Information Spreading in the Vertex-Congest Model
Patrick Eugster, Alex Kesselman, Kirill Kogan, Sergey Nikolenko and Alexander Sirotkin.
Essential Traffic Parameters for Shared Memory Switch Performance
Nir Shavit and Gadi Taubenfeld.
The Computability of Relaxed Data Structures: Queues and Stacks as Examples
Leonid Barenboim and David Peleg.
Nearly Optimal Local Broadcasting in the SINR Model with Feedback
Sébastien Bouchard, Yoann Dieudonné and Bertrand Ducourthial.
Byzantine Gathering in Networks
Achour Mostéfaoui and Michel Raynal.
Signature-free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t<n/3, O(n^2) Messages, and Constant Time
Lukasz Jez, Yishay Mansour and Boaz Patt-Shamir.
Scheduling Multipacket Frames With Frame Deadlines
Yuval Carmel and Boaz Patt-Shamir.
Comparison-based Interactive Collaborative Filtering
Jarkko Kari, Martin Matamala, Ivan Rapaport and Ville Salo.
Solving the Induced Subgraph problem in the randomized multiparty simultaneous messages model
Marcin Bienkowski, Artur Kraska and Pawel Schmidt.
A Randomized Algorithm for Online Scheduling with Interval Conflicts
Carole Delporte-Gallet, Hugues Fauconnier and Sam Toueg.
A separation of n-consensus and (n+1)-consensus based on process scheduling
Leonid Barenboim, Michael Elkin and Cyril Gavoille.
A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation
Jurek Czyzowicz, Evangelos Kranakis, Eduardo Pacheco and Dominik Pajak.
Information Spreading by Mobile Particles on a Line
Dennis Komm, Rastislav Kralovic, Richard Královic and Jasmin Smula.
Treasure Hunt with Advice
Klaus-Tycho Förster, Rijad Nuridini, Jara Uitto and Roger Wattenhofer.
Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond
Tamas Lukovszki and Stefan Schmid.
Online Admission Control and Embedding of Service Chains
Marc Bury.
Randomized OBDD-Based Graph Algorithms
Georgios Stamoulis.
Approximation Algorithms For Multi-Budgeted Network Design Problems
Gennaro Cordasco, Luisa Gargano, Adele Rescigno and Ugo Vaccaro.
Optimizing Spread of Influence in Social Networks via Initial Partial Incentives
Fabian Fuchs and Roman Prutkin.
Simple Distributed Delta + 1 Coloring in the SINR Model
Pierre Fraigniaud, Juho Hirvonen and Jukka Suomela.
Node Labels in Local Decision
Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci and Guido Proietti.
Path-Fault-Tolerant Approximate Shortest-Path Trees
Yoram Moses and Katia Patkin.
Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of Priority
Joel Rybicki and Jukka Suomela.
Exact bounds for distributed graph colouring
Shantanu Das, Dariusz Dereniowski and Christina Karousatou.
Collaborative Exploration by Energy-Constrained Mobile Robots
Taisuke Izumi.
On Space and Time Complexity for Loosely-Stabilizing Leader Election
Quentin Bramas and Sebastien Tixeuil.
Wait-free Gathering without Chirality
Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci and Guido Proietti.
A faster computation of all the best swap edges of a tree spanner
Colin Cooper, Tomasz Radzik, Nicolas Rivera and Takeharu Shiraga.
Coalescing walks on rotor-router systems