Abstract is missing.
- The art of multiprocessor programmingMaurice Herlihy. 1-2 [doi]
- Century papers at the first quarter-century milestoneDanny Dolev. 3-4 [doi]
- Distributed social systemsJon M. Kleinberg. 5-6 [doi]
- On the complexity of distributed graph coloringFabian Kuhn, Roger Wattenhofer. 7-15 [doi]
- Quorum placement in networks: minimizing network congestionDaniel Golovin, Anupam Gupta, Bruce M. Maggs, Florian Oprea, Michael K. Reiter. 16-25 [doi]
- Distributed verification of minimum spanning treesAmos Korman, Shay Kutten. 26-34 [doi]
- When selfish meets evil: byzantine players in a virus inoculation gameThomas Moscibroda, Stefan Schmid, Roger Wattenhofer. 35-44 [doi]
- Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing gamesAvrim Blum, Eyal Even-Dar, Katrina Ligett. 45-52 [doi]
- Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computationIttai Abraham, Danny Dolev, Rica Gonen, Joseph Y. Halpern. 53-62 [doi]
- EquiCast: scalable multicast with selfish usersIdit Keidar, Roie Melamed, Ariel Orda. 63-71 [doi]
- Grouped distributed queues: distributed queue, proportional share multiprocessor schedulingBogdan Caprita, Jason Nieh, Clifford Stein. 72-81 [doi]
- Sketching asynchronous streams over a sliding windowSrikanta Tirthapura, Bojian Xu, Costas Busch. 82-91 [doi]
- Adversarial queuing on the multiple-access channelBogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki. 92-101 [doi]
- Veracity radius: capturing the locality of distributed computationsYitzhak Birk, Idit Keidar, Liran Liss, Assaf Schuster, Ran Wolff. 102-111 [doi]
- Life is not a state-machine: the long road from research to productionWerner Vogels. 112 [doi]
- Computing separable functions via gossipDamon Mosk-Aoyama, Devavrat Shah. 113-122 [doi]
- Peer counting and sampling in overlay networks: random walk methodsLaurent Massoulié, Erwan Le Merrer, Anne-Marie Kermarrec, Ayalvadi J. Ganesh. 123-132 [doi]
- On the topologies formed by selfish peersThomas Moscibroda, Stefan Schmid, Roger Wattenhofer. 133-142 [doi]
- Self-stabilizing byzantine agreementAriel Daliot, Danny Dolev. 143-152 [doi]
- Irreducibility and additivity of set agreement-oriented failure detector classesAchour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Corentin Travers. 153-162 [doi]
- Optimally efficient multi-valued byzantine agreementMatthias Fitzi, Martin Hirt. 163-168 [doi]
- Timeliness, failure-detectors, and consensus performanceIdit Keidar, Alexander Shraer. 169-178 [doi]
- Oracle size: a new measure of difficulty for communication tasksPierre Fraigniaud, David Ilcinkas, Andrzej Pelc. 179-187 [doi]
- Object location using path separatorsIttai Abraham, Cyril Gavoille. 188-197 [doi]
- Optimal-stretch name-independent compact routing in doubling metricsGoran Konjevod, Andréa W. Richa, Donglin Xia. 198-207 [doi]
- Local approximation schemes for topology controlMirela Damian, Saurav Pandit, Sriram V. Pemmaraju. 208-217 [doi]
- Common2 extended to stacks and unbounded concurrencyYehuda Afek, Eli Gafni, Adam Morrison. 218-227 [doi]
- Single-scanner multi-writer snapshot implementations are fast!Panagiota Fatourou, Nikolaos D. Kallimanis. 228-237 [doi]
- An ::::O::::(1) RMRs leader election algorithmWojciech M. Golab, Danny Hendler, Philipp Woelfel. 238-247 [doi]
- How fast can a very robust read be?Rachid Guerraoui, Marko Vukolic. 248-257 [doi]
- Reliable broadcast in radio networks: the bounded collision caseChiu-Yuen Koo, Vartika Bhandari, Jonathan Katz, Nitin H. Vaidya. 258-264 [doi]
- Possibility and complexity of probabilistic reliable communication in directed networksKannan Srinathan, C. Pandu Rangan. 265-274 [doi]
- An Omega (::::n:::: log ::::n::::) lower bound on the cost of mutual exclusionRui Fan, Nancy A. Lynch. 275-284 [doi]
- Lower bound for scalable Byzantine AgreementDan Holtby, Bruce M. Kapron, Valerie King. 285-291 [doi]
- Stably computable predicates are semilinearDana Angluin, James Aspnes, David Eisenstat. 292-299 [doi]
- Synchronizing without locks is inherently expensiveHagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kouznetsov. 300-307 [doi]
- Transactional contention management as a non-clairvoyant scheduling problemHagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir. 308-315 [doi]
- Towards a theory of transactional contention managersRachid Guerraoui, Maurice Herlihy, Bastian Pochon. 316-317 [doi]