| 2016 | Anonymity-Preserving Failure Detectors. Zohir Bouzid, Corentin Travers |
| 2016 | Are Byzantine Failures Really Different from Crash Failures? Damien Imbs, Michel Raynal, Julien Stainer |
| 2016 | Asynchronous Computability Theorems for t-Resilient Systems. Vikram Saraph, Maurice Herlihy, Eli Gafni |
| 2016 | Asynchronous Embedded Pattern Formation Without Orientation. Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra |
| 2016 | Buffer Size for Routing Limited-Rate Adversarial Traffic. Avery Miller, Boaz Patt-Shamir |
| 2016 | Certified Universal Gathering in \mathbb R ^2 for Oblivious Mobile Robots. Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain |
| 2016 | Depth of a Random Binary Search Tree with Concurrent Insertions. James Aspnes, Eric Ruppert |
| 2016 | Deterministic Leader Election in O(D+\log n) Time with Messages of Size O(1). Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari |
| 2016 | Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings Cyril Gavoille, David Ilcinkas |
| 2016 | Distributed Construction of Purely Additive Spanners. Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff |
| 2016 | Distributed Testing of Excluded Subgraphs. Pierre Fraigniaud, Ivan Rapaport, Ville Salo, Ioan Todinca |
| 2016 | Fast Distributed Algorithms for Testing Graph Properties. Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev |
| 2016 | Fast Two-Robot Disk Evacuation with Wireless Communication. Ioannis Lamprou, Russell Martin, Sven Schewe |
| 2016 | Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems. François Le Gall |
| 2016 | How to Discreetly Spread a Rumor in a Crowd. Mohsen Ghaffari, Calvin C. Newport |
| 2016 | Information Spreading in Dynamic Networks Under Oblivious Adversaries. John Augustine, Chen Avin, Mehraneh Liaee, Gopal Pandurangan, Rajmohan Rajaraman |
| 2016 | Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure Model. Joseph Izraelevitz, Hammurabi Mendes, Michael L. Scott |
| 2016 | Lower Bound on the Step Complexity of Anonymous Binary Consensus. Hagit Attiya, Ohad Ben-Baruch, Danny Hendler |
| 2016 | Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks. Amir Abboud, Keren Censor-Hillel, Seri Khoury |
| 2016 | Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs. Bernhard Haeupler, Taisuke Izumi, Goran Zuzic |
| 2016 | Non-Bayesian Learning in the Presence of Byzantine Agents. Lili Su, Nitin H. Vaidya |
| 2016 | Non-local Probes Do Not Help with Many Graph Problems. Mika Göös, Juho Hirvonen, Reut Levi, Moti Medina, Jukka Suomela |
| 2016 | On Composition and Implementation of Sequential Consistency. Matthieu Perrin, Matoula Petrolia, Achour Mostéfaoui, Claude Jard |
| 2016 | Online Balanced Repartitioning. Chen Avin, Andreas Loukas, Maciej Pacut, Stefan Schmid |
| 2016 | Opacity vs TMS2: Expectations and Reality. Sandeep Hans, Ahmed Hassan, Roberto Palmieri, Sebastiano Peluso, Binoy Ravindran |
| 2016 | Optimal Consistent Network Updates in Polynomial Time. Pavol Cerný, Nate Foster, Nilesh Jagnik, Jedidiah McClurg |
| 2016 | Optimal Fair Computation. Rachid Guerraoui, Jingjing Wang |
| 2016 | Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model. Dan Hefetz, Fabian Kuhn, Yannic Maus, Angelika Steger |
| 2016 | Priority Mutual Exclusion: Specification and Algorithm. Chien-Chung Huang, Prasad Jayanti |
| 2016 | Sublinear-Space Distance Labeling Using Hubs. Pawel Gawrychowski, Adrian Kosowski, Przemyslaw Uznanski |
| 2016 | Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks. Christian Scheideler, Alexander Setzer, Thim Strothmann |
| 2016 | Upper Bounds for Boundless Tagging with Bounded Objects. Zahra Aghazadeh, Philipp Woelfel |
| 2016 | k-Abortable Objects: Progress Under High Contention. Naama Ben-David, David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg |