Abstract is missing.
- On the Computational Complexity of MapReduceBenjamin Fish, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin, György Turán. 1-15 [doi]
- Efficient Counting with Optimal ResilienceChristoph Lenzen, Joel Rybicki. 16-30 [doi]
- The Computational Power of BeepsSeth Gilbert, Calvin C. Newport. 31-46 [doi]
- Byzantine FirefliesRachid Guerraoui, Alexandre Maurer. 47-59 [doi]
- Wait-Freedom is Harder Than Lock-Freedom Under Strong LinearizabilityOksana Denysyuk, Philipp Woelfel. 60-74 [doi]
- Simulating a Shared Register in an Asynchronous System that Never Stops Changing - (Extended Abstract)Hagit Attiya, Hyun Chul Chung, Faith Ellen, Saptaparni Kumar, Jennifer L. Welch. 75-91 [doi]
- Plane Formation by Synchronous Mobile Robots in the Three Dimensional Euclidean SpaceYukiko Yamauchi, Taichi Uehara, Shuji Kijima, Masafumi Yamashita. 92-106 [doi]
- Anonymous Graph Exploration with BinocularsJérémie Chalopin, Emmanuel Godard, Antoine Naudin. 107-122 [doi]
- Limit Behavior of the Multi-agent Rotor-Router SystemJérémie Chalopin, Shantanu Das 0001, Pawel Gawrychowski, Adrian Kosowski, Arnaud Labourel, Przemyslaw Uznanski. 123-139 [doi]
- Elastic Configuration Maintenance via a Parsimonious Speculating Snapshot SolutionEli Gafni, Dahlia Malkhi. 140-153 [doi]
- SmartMerge: A New Approach to Reconfiguration for Atomic StorageLeander Jehl, Roman Vitenberg, Hein Meling. 154-169 [doi]
- Towards Automatic Lock Removal for Scalable SynchronizationMaya Arbel, Guy Golan-Gueta, Eshcar Hillel, Idit Keidar. 170-184 [doi]
- Inherent Limitations of Hybrid Transactional MemoryDan Alistarh, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, Nir Shavit. 185-199 [doi]
- Why Non-blocking Operations Should be SelfishJoel Gibson, Vincent Gramoli. 200-214 [doi]
- Hybrid Transactional Memory RevisitedWenjia Ruan, Michael F. Spear. 215-231 [doi]
- Grasping the Gap Between Blocking and Non-Blocking Transactional MemoriesPetr Kuznetsov, Srivatsan Ravi. 232-247 [doi]
- Fast Consensus for Voting on General Expander GraphsColin Cooper, Robert Elsässer, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga. 248-262 [doi]
- Randomness vs. Time in Anonymous NetworksJochen Seidel, Jara Uitto, Roger Wattenhofer. 263-275 [doi]
- Fast Byzantine Leader Election in Dynamic NetworksJohn Augustine, Gopal Pandurangan, Peter Robinson 0002. 276-291 [doi]
- Local Information in Influence NetworksYuezhou Lv, Thomas Moscibroda. 292-308 [doi]
- Amalgamated Lock-ElisionYehuda Afek, Alexander Matveev, Oscar R. Moll, Nir Shavit. 309-324 [doi]
- Transactional Interference-Less Balanced TreeAhmed Hassan, Roberto Palmieri, Binoy Ravindran. 325-340 [doi]
- Analyzing the Performance of Lock-Free Data Structures: A Conflict-Based ModelAras Atalar, Paul Renaud-Goud, Philippas Tsigas. 341-355 [doi]
- A Constructive Approach for Proving Data Structures' LinearizabilityKfir Lev-Ari, Gregory Chockler, Idit Keidar. 356-370 [doi]
- Modular Verification of Concurrency-Aware LinearizabilityNir Hemed, Noam Rinetzky, Viktor Vafeiadis. 371-387 [doi]
- Transaction Chopping for Parallel Snapshot IsolationAndrea Cerone, Alexey Gotsman, Hongseok Yang. 388-404 [doi]
- Computing in Additive Networks with Bounded-Information CodesKeren Censor Hillel, Erez Kantor, Nancy A. Lynch, Merav Parter. 405-419 [doi]
- Specifying Concurrent Problems: Beyond Linearizability and up to Tasks - (Extended Abstract)Armando Castañeda, Sergio Rajsbaum, Michel Raynal. 420-435 [doi]
- From Geometric Semantics to Asynchronous ComputabilityEric Goubault, Samuel Mimram, Christine Tasson. 436-451 [doi]
- On the Optimal Space Complexity of Consensus for Anonymous ProcessesRati Gelashvili. 452-466 [doi]
- Compressing Communication in Distributed ProtocolsYael Tauman Kalai, Ilan Komargodski. 467-479 [doi]
- Privacy-Conscious Information Diffusion in Social NetworksGeorge Giakkoupis, Rachid Guerraoui, Arnaud Jégou, Anne-Marie Kermarrec, Nupur Mittal. 480-496 [doi]
- Fair Distributed Computation of Reactive FunctionsJuan A. Garay, Björn Tackmann, Vassilis Zikas. 497-512 [doi]
- Smoothed Analysis of Dynamic NetworksMichael Dinitz, Jeremy T. Fineman, Seth Gilbert, Calvin C. Newport. 513-527 [doi]
- Fault Tolerant Reachability for Directed GraphsSurender Baswana, Keerti Choudhary, Liam Roditty. 528-543 [doi]
- Locally Optimal Load BalancingLaurent Feuilloley, Juho Hirvonen, Jukka Suomela. 544-558 [doi]
- Distributed Large Independent Sets in One Round on Bounded-Independence GraphsMagnús M. Halldórsson, Christian Konrad. 559-572 [doi]
- Tight Bounds for MIS in Multichannel Radio NetworksSebastian Daum, Fabian Kuhn. 573-587 [doi]
- Nonuniform SINR+Voroni Diagrams Are Effectively UniformErez Kantor, Zvi Lotker, Merav Parter, David Peleg. 588-601 [doi]
- Stable Leader Election in Population Protocols Requires Linear TimeDavid Doty, David Soloveichik. 602-616 [doi]
- Hardware Transactions in Nonvolatile MemoryHillel Avni, Eliezer Levy, Avi Mendelson. 617-630 [doi]
- Space-Optimal Counting in Population ProtocolsJoffroy Beauquier, Janna Burman, Simon Clavière, Devan Sohier. 631-646 [doi]