Table of Contents

• Completely fair SFE and coalition-safe cheap talkMatt Lepinski, Silvio Micali, Chris Peikert, Abhi Shelat. 1-10 [doi]
• Mechanism design for policy routingJoan Feigenbaum, Rahul Sami, Scott Shenker. 11-20 [doi]
• Selfish caching in distributed systems: a game-theoretic analysisByung-Gon Chun, Kamalika Chaudhuri, Hoeteck Wee, Marco Barreno, Christos H. Papadimitriou, John Kubiatowicz. 21-30 [doi]
• Bringing practical lock-free synchronization to 64-bit applicationsSimon Doherty, Maurice Herlihy, Victor Luchangco, Mark Moir. 31-39 [doi]
• An almost non-blocking stackHans-Juergen Boehm. 40-49 [doi]
• Lock-free linked lists and skip listsMikhail Fomitchev, Eric Ruppert. 50-59 [doi]
• Lower bounds for adaptive collect and related objectsHagit Attiya, Faith Ellen Fich, Yaniv Kaplan. 60-69 [doi]
• Efficient synchronous snapshotsAlex Brodsky, Faith Ellen Fich. 70-79 [doi]
• On the inherent weakness of conditional synchronization primitivesFaith Ellen Fich, Danny Hendler, Nir Shavit. 80-87 [doi]
• Specification faithfulness in networks with rational nodesJeffrey Shneidman, David C. Parkes. 88-97 [doi]
• On the expected payment of mechanisms for task allocationArtur Czumaj, Amir Ronen. 98-106 [doi]
• On spectrum sharing gamesMagnús M. Halldórsson, Joseph Y. Halpern, Erran L. Li, Vahab S. Mirrokni. 107-114 [doi]
• Load balancing and locality in range-queriable data structuresJames Aspnes, Jonathan Kirsch, Arvind Krishnamurthy. 115-124 [doi]
• Choosing a random peerValerie King, Jared Saia. 125-130 [doi]
• Bounds for the convergence rate of randomized local search in a multiplayer load-balancing gamePaul W. Goldberg. 131-140 [doi]
• Compact routing on euclidian metricsIttai Abraham, Dahlia Malkhi. 141-149 [doi]
• When graph theory helps self-stabilizationChristian Boulinier, Franck Petit, Vincent Villain. 150-159 [doi]
• Efficient algorithms for constructing (1+, varepsilon;, beta)-spanners in the distributed and streaming modelsMichael Elkin, Jian Zhang. 160-168 [doi]
• Eclecticism shrinks even small worldsPierre Fraigniaud, Cyril Gavoille, Christophe Paul. 169-178 [doi]
• Analyzing Kleinberg s (and other) small-world ModelsCharles U. Martel, Van Nguyen. 179-188 [doi]
• Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphsJie Gao, Li Zhang. 189-196 [doi]
• Balanced binary trees for ID management and load balance in distributed hash tablesGurmeet Singh Manku. 197-205 [doi]
• Efficient top-K query calculation in distributed networksPei Cao, Zhe Wang. 206-215 [doi]
• On the design of distributed protocols from differential equationsIndranil Gupta. 216-225 [doi]
• Byzantine disk paxos: optimal resilience with byzantine shared memoryIttai Abraham, Gregory Chockler, Idit Keidar, Dahlia Malkhi. 226-235 [doi]
• How fast can a distributed atomic read be?Partha Dutta, Rachid Guerraoui, Ron R. Levy, Arindam Chakraborty. 236-245 [doi]
• Signed quorum systemsHaifeng Yu. 246-255 [doi]
• Competitive on-line paging strategies for mobile users under delay constraintsAmotz Bar-Noy, Yishay Mansour. 256-265 [doi]
• A better wake-up in radio networksBogdan S. Chlebus, Dariusz R. Kowalski. 266-274 [doi]
• Broadcast in radio networks tolerating byzantine adversarial behaviorChiu-Yuen Koo. 275-282 [doi]
• A note on efficient aggregate queries in sensor networksBoaz Patt-Shamir. 283-289 [doi]
• Computation in networks of passively mobile finite-state sensorsDana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta. 290-299 [doi]
• What cannot be computed locally!Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer. 300-309 [doi]
• Geometrically aware communication in random wireless networksGady Kozma, Zvi Lotker, Micha Sharir, Gideon Stupp. 310-319 [doi]
• Gradient clock synchronizationRui Fan, Nancy A. Lynch. 320-327 [doi]
• Communication-efficient leader election and consensus with limited link synchronyMarcos Kawazoe Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg. 328-337 [doi]
• The weakest failure detectors to solve certain fundamental problems in distributed computingCarole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Vassos Hadzilacos, Petr Kouznetsov, Sam Toueg. 338-346 [doi]
• Group membership: a novel approach and the first single-round algorithmRoger I. Khazan. 347-356 [doi]
• Asynchronous group key exchange with failuresChristian Cachin, Reto Strobl. 357-366 [doi]
• Brief announcement: stretch between nearby peersKirsten Hildrum, John Kubiatowicz, Jeremy Stribling. 367 [doi]
• Brief announcement: prefix hash treeSriram Ramabhadran, Sylvia Ratnasamy, Joseph M. Hellerstein, Scott Shenker. 368 [doi]
• Brief announcement: detecting malicious routersAlper Tugay Mizrak, Keith Marzullo, Stefan Savage. 369 [doi]
• Brief announcement: a single enqueuer wait-free queue implementationMatei David. 370 [doi]
• Brief Announcement: constraint-based synchronization and verification of concurrent programsRafael Ramirez, Juanjo Martinez. 371 [doi]
• Brief announcement: completing the lock-free dynamic cycleMaged M. Michael. 372 [doi]
• Brief announcement: implementing multi-word atomic snapshots on current hardwareChris Purcell, Tim Harris. 373 [doi]
• Brief announcement: exposing and eliminating vulnerabilities to denial of service attacks in secure gossip-based multicastGal Badishi, Idit Keidar, Amir Sasson. 374 [doi]
• Brief announcement: spoofing prevention methodAnat Bremler-Barr, Hanoch Levy. 375 [doi]
• Brief announcement: concurrent maintenance of ringsXiaozhou Li, Jayadev Misra, C. Greg Plaxton. 376 [doi]
• Brief announcement: self-stabilizing distance-d distinct labels via enriched fair compositionLisa Higham, Lixiao Wang. 377 [doi]
• Brief announcement: STALK: a self-stabilizing hierarchical tracking service for sensor networksMurat Demirbas, Anish Arora, Tina Nolte, Nancy A. Lynch. 378 [doi]
• Brief announcement: linear time byzantine self-stabilizing clock synchronizationAriel Daliot, Danny Dolev, Hanna Parnas. 379 [doi]
• Brief announcement: randomized rumor spreading with fewer phone callsKirsten Hildrum, Sean Ma, Satish Rao. 380 [doi]
• Brief announcement: an incremental algorithm for calculation of backup-paths in link-state networksPierre Fransson, Lenka Carr-Motycková. 381 [doi]
• Brief announcement: name-independent compact routing in treesKofi A. Laing. 382 [doi]
• Brief announcement: towards a secure indirection infrastructureKarthik Lakshminarayanan, Daniel Adkins, Adrian Perrig, Ion Stoica. 383 [doi]
• Brief announcement: Trilix: a scalable unstructured lookup system for dynamic environmentsIdit Keidar, Roie Melamed. 384 [doi]
• Brief announcement: virtual mobile nodes for mobile ad hoc networksShlomi Dolev, Seth Gilbert, Nancy A. Lynch, Elad Schiller, Alexander A. Shvartsman, Jennifer L. Welch. 385 [doi]
• Brief announcement: reconfigurable byzantine-fault-tolerant atomic memoryRodrigo Rodrigues, Barbara Liskov. 386 [doi]
• Brief announcement: adaptive balancing networksSrikanta Tirthapura. 387 [doi]
• Brief announcement: building an adaptive distributed web server system on the fly for handling web hotspotsWeibin Zhao, Henning Schulzrinne. 388 [doi]
• Brief announcement: the design of an internet-scale monitoring and assertion-checking infrastructureMonica Brockmeyer, Chunbo Chu. 389 [doi]
• Brief announcement: Cataclysm: handling extreme overloads in internet servicesBhuvan Urgaonkar, Prashant J. Shenoy. 390 [doi]
• Brief announcement: polygonal broadcast, secret maturity and the firing sensorsShlomi Dolev, Ted Herman, Limor Lahiani. 391 [doi]
• Brief announcement: optimal asynchronous garbage collection for checkpointing protocols with rollback-dependency trackabilityRodrigo Schmidt, Islene C. Garcia, Fernando Pedone, Luiz Eduardo Buzato. 392 [doi]
• Brief announcement: RT oblivious erasure correctingAmos Beimel, Shlomi Dolev, Noam Singer. 393 [doi]
• Brief announcement: secret handshakes from CA-oblivious encryptionClaude Castelluccia, Stanislaw Jarecki, Gene Tsudik. 394 [doi]
• Brief announcement: degree: optimal deterministic routing for P2P systemsGennaro Cordasco, Luisa Gargano, Mikael Hammar, Vittorio Scarano. 395 [doi]
• Brief announcement: efficient clustering in unstructured radio networksFabian Kuhn, Thomas Moscibroda, Roger Wattenhofer. 396 [doi]
• Brief announcement: on the round complexity of distributed consensus over synchronous networksD. V. S. Ravikant, Muthuramakrishnan Venkitasubramaniam, V. Srikanth, K. Srinathan, C. Pandu Rangan. 397 [doi]
• Brief announcement: veto number and the respective power of eventual failure detectorsRoy Friedman, Achour Mostéfaoui, Michel Raynal. 398 [doi]
• Brief announcement: the synchronous condition-based consensus hierarchyAchour Mostéfaoui, Sergio Rajsbaum, Michel Raynal. 399 [doi]
• Brief announcement: efficient implementation of a byzantine data storage systemRida A. Bazzi, Yin Ding. 400 [doi]
• Brief announcement: on the inherent cost of generic broadcastFernando Pedone, André Schiper. 401 [doi]
• Brief announcement: on the possibility of consensus in asynchronous systems with finite average response timesChristof Fetzer, Ulrich Schmid. 402 [doi]