An Almost Non-blocking Stack
Hans-J. Boehm

Analyzing Kleinberg's (and other) Small-World Models
Charles Martel, Van Nguyen

Asynchronous Group Key Exchange with Failures
Christian Cachin, Reto Strobl

Better Wake-up in Radio Networks
Bogdan Chlebus, Dariusz Kowalski

Bounds for the Convergence Rate of Randomized Local Search in a Multiplayer Load-Balancing Game
Paul Goldberg

Bringing Practical Lock-Free Synchronization to 64-Bit Applications
Simon Doherty, Maurice Herlihy, Victor Luchangco, Mark Moir

Broadcast in Radio Networks Tolerating Byzantine Adversarial Behavior
Chiu-Yuen Koo

Byzantine Disk Paxos
Ittai Abraham, Gregory Chockler, Idit Keidar, Dahlia Malkhi

Choosing a Random Peer
Valerie King, Jared Saia

Coalition-Safe Cheap Talk
Matt Lepinski, Silvio Micali, Chris Peikert, abhi shelat

Communication-Efficient Leader Election and Consensus with Limited Link Synchrony
Marcos Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg

Compact Routing on Euclidean Metrics
Ittai Abraham, Dahlia Malkhi

Competitive On-Line Paging Strategies for Mobile Users Under Delay Constraints
Amotz Bar-Noy, Yishay Mansour

Computation in Networks of Passively Mobile Finite-State Sensors
Dana Angluin, James Aspnes, Zoe Diamadi, Michael Fischer, Rene Peralta

Eclecticism Shrinks the World
Pierre Fraigniaud, Cyril Gavoille, Christophe Paul

Efficient Algorithms for Constructing (1+\epsilon,\beta)-Spanners in the Distributed and Streaming Models
Michael Elkin, Jian Zhang

Efficient Synchronous Snapshots
Alex Brodsky, Faith Fich

Efficient Top-K Query Calculation for Distributed Networks
Pei Cao, Zhe Wang

Geometrically Aware Communication in Random Wireless Networks
Gady Kozma, Zvi Lotker, Micha Sharir, Gideon Stupp

Gradient Clock Synchronization
Rui Fan, Nancy Lynch

Group Membership: A Novel Approach and the First Single-Round Algorithm
Roger Khazan

How Fast Can a Distributed Read Be?
Partha Dutta, Rachid Guerraoui, Ron Levy, Arindam Chakraborty

Load Balancing and Locality in Range-Queriable Data Structures
James Aspnes, Jonathan Kirsch, Arvind Krishnamurthy

Lock-Free Linked Lists and Skip Lists
Mikhail Fomitchev, Eric Ruppert

Lower Bounds for Adaptive Collect and Related Objects
Hagit Attiya, Faith Fich, Yaniv Kaplan

Mechanism Design for Policy Routing
Joan Feigenbaum, Rahul Sami, Scott Shenker

A Note on Efficient Aggregate Queries in Sensor Networks
Boaz Patt-Shamir

On Spectrum Sharing Games
Magnus Haldorsson, Li Li, Vahab Mirrokni

On the Design of Distributed Protocols from Differential Equations
Indranil Gupta

On the Expected Payment of Mechanisms for Task Allocation
Artur Czumaj, Amir Ronen

On the Inherent Weakness of Conditional Synchronization Primitives
Faith Fich, Danny Hendler, Nir Shavit

A Randomized ID Selection Algorithm for Peer-to-Peer Networks
Gurmeet Singh Manku

Selfish Caching in Distributed Systems: A Game-Theoretic Analysis
Byung-Gon Chun, Kamalika Chaudhuri, Hoeteck Wee, Marco Barreno, Christos Papadimitriou, John Kubiatowicz

Signed Quorum Systems
Haifeng Yu

Specification Faithfulness in Networks with Rational Nodes
Jeffrey Shneidman, David Parkes

Tradeoff Between Stretch Factor and Load Balancing Ratio in Routing on Growth Restricted Graphs
Jie Gao, Li Zhang

The Weakest Failure Detectors to Solve Certain Fundamental Problems in Distributed Computing
Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Vassos Hadzilacos, Petr Kouznetsov, Sam Toueg

What Cannot Be Computed Locally!
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer

When Graph Theory Helps Self-Stabilization
Christian Boulinier, Franck Petit, Vincent Villain