Abstract is missing.
- A topological characterization of weaknessCindy Eisner, Dana Fisman, John Havlicek. 1-8 [doi]
- Proof labeling schemesAmos Korman, Shay Kutten, David Peleg. 9-18 [doi]
- Efficient dependency tracking for relevant events in shared-memory systemsAnurag Agarwal, Vijay K. Garg. 19-28 [doi]
- Policy-hiding access control in open environmentJiangtao Li, Ninghui Li. 29-38 [doi]
- Brief announcement: a flexible framework for secret handshakesGene Tsudik, Shouhuai Xu. 39 [doi]
- Brief announcement: strong detection of misconfigurationsRaj Kumar Rajendran, Vishal Misra, Dan Rubenstein. 40 [doi]
- Distance estimation and object location via rings of neighborsAleksandrs Slivkins. 41-50 [doi]
- Building scalable and robust peer-to-peer overlay networks for broadcasting using network codingKamal Jain, László Lovász, Philip A. Chou. 51-59 [doi]
- On the locality of bounded growthFabian Kuhn, Thomas Moscibroda, Roger Wattenhofer. 60-68 [doi]
- Skip-webs: efficient distributed data structures for multi-dimensional data setsLars Arge, David Eppstein, Michael T. Goodrich. 69-76 [doi]
- Efficient lookup on unstructured topologiesRuggero Morselli, Bobby Bhattacharjee, Aravind Srinivasan, Michael A. Marsh. 77-86 [doi]
- Quorum placement in networks to minimize access delaysAnupam Gupta, Bruce M. Maggs, Florian Oprea, Michael K. Reiter. 87-96 [doi]
- Brief announcement: ring-like DHTs and the postage stamp problemMahadev Konar, Alexander E. Mohr. 97 [doi]
- Brief announcement: the overlay network content distribution problemChip Killian, Michael Vrable, Alex C. Snoeren, Amin Vahdat, Joseph Pasquale. 98 [doi]
- The price of selfish behavior in bilateral network formationJacomo Corbo, David C. Parkes. 99-107 [doi]
- Facility location: distributed approximationThomas Moscibroda, Roger Wattenhofer. 108-117 [doi]
- Primal-dual based distributed algorithms for vertex cover with semi-hard capacitiesFabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio. 118-125 [doi]
- Brief announcement: on the expected overpayment of VCG mechanisms in large networksDavid R. Karger, Evdokia Nikolova. 126 [doi]
- Brief announcement: an incentive-compatible capacity assignment algorithm for bulk data distribution using P2PSimon G. M. Koo, C. S. George Lee, Karthik Kannan. 127 [doi]
- Brief announcement: distributed algorithmic mechanism design for schedulingThomas E. Carroll, Daniel Grosu. 128 [doi]
- Faster communication in known topology radio networksLeszek Gasieniec, David Peleg, Qin Xin. 129-137 [doi]
- On reliable broadcast in a radio networkVartika Bhandari, Nitin H. Vaidya. 138-147 [doi]
- Maximal independent sets in radio networksThomas Moscibroda, Roger Wattenhofer. 148-157 [doi]
- On selection problem in radio networksDariusz R. Kowalski. 158-166 [doi]
- Brief announcement: broadcast in radio networks in the presence of byzantine adversariesVinod Vaikuntanathan. 167 [doi]
- Brief announcement: exploring the consistency problem spaceNishith Krishna, Marc Shapiro, Karthikeyan Bhargavan. 168 [doi]
- Fast fault-tolerant agreement algorithmsCarole Delporte-Gallet, Hugues Fauconnier, Stephanie Lorraine Horn, Sam Toueg. 169-178 [doi]
- The combined power of conditions and failure detectors to solve asynchronous set agreementAchour Mostéfaoui, Sergio Rajsbaum, Michel Raynal. 179-188 [doi]
- The weakest failure detector to solve nonuniform consensusJonathan Eisler, Vassos Hadzilacos, Sam Toueg. 189-196 [doi]
- Consensus and collision detectors in wireless Ad Hoc networksGregory Chockler, Murat Demirbas, Seth Gilbert, Calvin C. Newport, Tina Nolte. 197-206 [doi]
- Brief announcement: minimal system conditions to implement unreliable failure detectorsAntonio Fernández, Ernesto Jiménez, Sergio Arévalo. 207 [doi]
- Brief announcement: on the possibility and the impossibility of message-driven self-stabilizing failure detectionMartin Hutle, Josef Widder. 208 [doi]
- Routing complexity of faulty networksOmer Angel, Itai Benjamini, Eran Ofek, Udi Wieder. 209-217 [doi]
- Feedback control for router congestion resolutionXiaojie Gao, Leonard J. Schulman. 218-226 [doi]
- Competitive weighted throughput analysis of greedy protocols on DAGsEyal Gordon, Adi Rosén. 227-236 [doi]
- Brief announcement: continuous containment and local stabilization in path-vector routingHongwei Zhang, Anish Arora. 237 [doi]
- Brief announcement: gradient clock synchronization in sensor networksLennart Meier, Lothar Thiele. 238 [doi]
- Brief announcement: evaluation of tree-based data gathering algorithms for wireless sensor networksW. Melody Moh, Marie Dumont, Teng-Sheng Moh, Takeo Hamada, Ching-Fong Su. 239 [doi]
- Advanced contention management for dynamic software transactional memoryWilliam N. Scherer III, Michael L. Scott. 240-248 [doi]
- Efficient multi-word locking using randomizationPhuong Hoai Ha, Philippas Tsigas, Mirjam Wattenhofer, Roger Wattenhofer. 249-257 [doi]
- Toward a theory of transactional contention managersRachid Guerraoui, Maurice Herlihy, Bastian Pochon. 258-264 [doi]
- Stochastic analysis of distributed deadlock schedulingShigang Chen, Yibei Ling. 265-273 [doi]
- Brief announcement: analysis of a randomized contention-resolution protocol for distributed accessGopal Pandurangan, GaHyun Park. 274 [doi]
- Brief announcement: improved asynchronous group mutual exclusion in token-passing networksDavid Lin, Teng-Sheng Moh, W. Melody Moh. 275 [doi]
- Adaptive routing with stale informationSimon Fischer, Berthold Vöcking. 276-283 [doi]
- A network pricing game for selfish trafficAra Hayrapetyan, Éva Tardos, Tom Wexler. 284-291 [doi]
- Correctness of a gossip based membership protocolAndré Allavena, Alan J. Demers, John E. Hopcroft. 292-301 [doi]
- A scheme for load balancing in heterogenous distributed hash tablesGeorge Giakkoupis, Vassos Hadzilacos. 302-311 [doi]
- On the establishment of distinct identities in overlay networksRida A. Bazzi, Goran Konjevod. 312-320 [doi]
- Brief announcement: controlled quorum selection in arbitrary topologiesXinjie Li, Monica Brockmeyer. 321 [doi]
- Brief announcement: coupling for Markov decision processes - application to self-stabilization with arbitrary schedulersLaurent Fribourg, Stéphane Messika. 322 [doi]
- Brief announcement: virtual stationary automata for mobile networksShlomi Dolev, Limor Lahiani, Seth Gilbert, Nancy A. Lynch, Tina Nolte. 323 [doi]
- Simultaneous broadcast revisitedAlejandro Hevia, Daniele Micciancio. 324-333 [doi]
- Feasibility and complexity of broadcasting with random transmission failuresAndrzej Pelc, David Peleg. 334-341 [doi]
- Reliable broadcast in unknown fixed-identity networksLakshminarayanan Subramanian, Randy H. Katz, Volker Roth, Scott Shenker, Ion Stoica. 342-351 [doi]
- Brief announcement: dynamic interoperable point-to-point connection of MPI implementationsMichal Kouril, Jerome L. Paul. 352 [doi]
- Brief announcement: wait-free implementation of multiple-writers/multiple-readers atomic byzantine data storage systemsRida A. Bazzi, Yin Ding. 353 [doi]
- Brief announcement: abstractions for implementing atomic objects in dynamic systemsRoy Friedman, Michel Raynal, Corentin Travers. 354 [doi]