Abstract is missing.
- Plenary talkMichael Merritt. 1 [doi]
- Athena lecture: distributed computing theory for wireless networks and mobile systemsNancy A. Lynch. 2 [doi]
- Programming models for extreme-scale computingMarc Snir. 3 [doi]
- On deterministic abortable objectsVassos Hadzilacos, Sam Toueg. 4-12 [doi]
- Pragmatic primitives for non-blocking data structuresTrevor Brown, Faith Ellen, Eric Ruppert. 13-22 [doi]
- The SkipTrie: low-depth concurrent search without rebalancingRotem Oshman, Nir Shavit. 23-32 [doi]
- Compact routing schemes with improved stretchShiri Chechik. 33-41 [doi]
- Optimal deterministic routing and sorting on the congested cliqueChristoph Lenzen. 42-50 [doi]
- Brief announcement: fair maximal independent sets in treesJeremy T. Fineman, Calvin C. Newport, Tonghe Wang. 51-53 [doi]
- Brief announcement: threshold load balancing in networksMartin Hoefer, Thomas Sauerwald. 54-56 [doi]
- Fast byzantine agreementNicolas Braud-Santoni, Rachid Guerraoui, Florian Huc. 57-64 [doi]
- Byzantine vector consensus in complete graphsNitin H. Vaidya, Vijay K. Garg. 65-73 [doi]
- Fast byzantine agreement in dynamic networksJohn Augustine, Gopal Pandurangan, Peter Robinson. 74-83 [doi]
- Synchronous byzantine agreement with nearly a cubic number of communication bits: synchronous byzantine agreement with nearly a cubic number of communication bitsDariusz R. Kowalski, Achour Mostéfaoui. 84-91 [doi]
- How to meet asynchronously at polynomial costYoann Dieudonné, Andrzej Pelc, Vincent Villain. 92-99 [doi]
- On the complexity of universal leader electionShay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan. 100-109 [doi]
- Brief announcement: a simple stretch 2 distance oracleRachit Agarwal 0001, Philip Brighten Godfrey. 110-112 [doi]
- Brief announcement: pareto optimal solutions to consensus and set consensusArmando Castañeda, Yannai A. Gonczarowski, Yoram Moses. 113-115 [doi]
- Brief announcement: self-stabilizing resource discovery algorithmSeda Davtyan, Kishori M. Konwar, Alexander A. Shvartsman. 116-118 [doi]
- Brief announcement: parameterized model checking of fault-tolerant distributed algorithms by abstractionAnnu John, Igor Konnov, Ulrich Schmid, Helmut Veith, Josef Widder. 119-121 [doi]
- Brief announcement: on minimum interaction time for continuous distributed interactive computingLu Zhang 0021, Xueyan Tang, Bingsheng He. 122-124 [doi]
- Brief announcement: deterministic self-stabilizing leader election with O(log log n)-bitsLélia Blin, Sébastien Tixeuil. 125-127 [doi]
- Brief announcement: scalable anonymous communication with byzantine adversaryJosh R. Karlin, Joud Khoury, Jared Saia, Mahdi Zamani. 128-130 [doi]
- Brief announcement: brokerage and closure in a strategic model of social capitalSamuel D. Johnson, Raissa M. D'Souza. 131-133 [doi]
- Brief announcement: techniques for programmatically troubleshooting distributed systemsSam Whitlock, Colin Scott, Scott Shenker. 134-136 [doi]
- Stone age distributed computingYuval Emek, Roger Wattenhofer. 137-146 [doi]
- Feedback from nature: an optimal distributed algorithm for maximal independent set selectionAlex Scott, Peter Jeavons, Lei Xu 0002. 147-156 [doi]
- What can be decided locally without identifiers?Pierre Fraigniaud, Mika Göös, Amos Korman, Jukka Suomela. 157-165 [doi]
- Synchrony weakened by message adversaries vs asynchrony restricted by failure detectorsMichel Raynal, Julien Stainer. 166-175 [doi]
- Highly dynamic distributed computing with byzantine failuresRachid Guerraoui, Florian Huc, Anne-Marie Kermarrec. 176-183 [doi]
- Brief announcement: constructing fault-tolerant overlay networks for topic-based publish/subscribeChen Chen, Roman Vitenberg, Hans-Arno Jacobsen. 184-186 [doi]
- Brief announcement: byzantine agreement with a strong adversary in polynomial expected timeValerie King, Jared Saia. 187-189 [doi]
- Upper bound on the complexity of solving hard renamingHagit Attiya, Armando Castañeda, Maurice Herlihy, Ami Paz. 190-199 [doi]
- n) timeDan Alistarh, James Aspnes, George Giakkoupis, Philipp Woelfel. 200-209 [doi]
- Byzantine renaming in synchronous systems with t<NOksana Denysyuk, Luís Rodrigues. 210-219 [doi]
- An O(1)-barriers optimal RMRs mutual exclusion algorithm: extended abstractHagit Attiya, Danny Hendler, Smadar Levy. 220-229 [doi]
- Fair and resilient incentive tree mechanismsYuezhou Lv, Thomas Moscibroda. 230-239 [doi]
- What's a little collusion between friends?Edmund L. Wong, Lorenzo Alvisi. 240-249 [doi]
- A distributed algorithm for gathering many fat mobile robots in the planeChrysovalandis Agathangelou, Chryssis Georgiou, Marios Mavronicolas. 250-259 [doi]
- Stable and scalable universal swarmsJi Zhu, Stratis Ioannidis, Nidhi Hegde, Laurent Massoulié. 260-269 [doi]
- Early-deciding consensus is expensiveDanny Dolev, Christoph Lenzen. 270-279 [doi]
- On the complexity of asynchronous agreement against powerful adversariesAllison B. Lewko, Mark Lewko. 280-289 [doi]
- Introducing speculation in self-stabilization: an application to mutual exclusionSwan Dubois, Rachid Guerraoui. 290-298 [doi]
- Leaplist: lessons learned in designing tm-supported range queriesHillel Avni, Nir Shavit, Adi Suissa. 299-308 [doi]
- A programming language perspective on transactional memory consistencyHagit Attiya, Alexey Gotsman, Sandeep Hans, Noam Rinetzky. 309-318 [doi]
- Brief announcement: an asymmetric flat-combining based queue algorithmMichael Gorelik, Danny Hendler. 319-321 [doi]
- Brief announcement: resettable objects and efficient memory reclamation for concurrent algorithmsZahra Aghazadeh, Wojciech M. Golab, Philipp Woelfel. 322-324 [doi]
- Randomized broadcast in radio networks with collision detectionMohsen Ghaffari, Bernhard Haeupler, Majid Khabbazian. 325-334 [doi]
- Maximal independent sets in multichannel radio networksSebastian Daum, Mohsen Ghaffari, Seth Gilbert, Fabian Kuhn, Calvin C. Newport. 335-344 [doi]
- The cost of radio network broadcast for different models of unreliable linksMohsen Ghaffari, Nancy A. Lynch, Calvin C. Newport. 345-354 [doi]
- Connectivity and aggregation in multihop wireless networksMarijke H. L. Bodlaender, Magnús M. Halldórsson, Pradipta Mitra. 355-364 [doi]
- The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walksRalf Klasing, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald. 365-374 [doi]
- Efficient distributed source detection with limited bandwidthChristoph Lenzen, David Peleg. 375-382 [doi]
- Distributed algorithms for barrier coverage using relocatable sensorsMohsen Eftekhari Hesari, Evangelos Kranakis, Danny Krizanc, Oscar Morales Ponce, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende. 383-392 [doi]
- Delegation of computation with verification outsourcing: curious verifiersGang Xu, George T. Amariucai, Yong Guan. 393-402 [doi]
- Brief announcement: a shorter and stronger proof of an Ω(d log(n/d)) lower bound for broadcast in radio networksCalvin C. Newport. 403-405 [doi]
- Brief announcement: a local approximation algorithm for MDS problem in anonymous planar networksWojciech Wawrzyniak. 406-408 [doi]