List of papers:
Accepted Papers
-
Badishi, G. and Herzberg, A. and Keidar, I. :
Keeping Denial-of-Service Attackers in the Dark,
pages 18-32.
-
Vvlzer, H. :
On Conspiracies and Hyperfairness in Distributed Computing,
pages 33-47.
-
Aiyer, A. and Alvisi, L. and Bazzi, R.A. :
On the Availability of Non-strict Quorum Systems,
pages 48-62.
-
Gafni, E. and Rajsbaum, S. :
Musical Benches,
pages 63-77.
-
Fich, F.E. and Luchangco, V. and Moir, M. and Shavit, N. :
Obstruction-Free Algorithms Can Be Practically Wait-Free,
pages 78-92.
-
Mittal, N. and Freiling, F.C. and Venkatesan, S. and Draque-Penso, L. :
Efficient Reduction for Wait-Free Termination Detection in a Crash-Prone Distributed System,
pages 93-107.
-
Purcell, C. and Harris, T. :
Non-blocking Hashtables with Open Addressing,
pages 108-121.
-
Attiya, H. and Guerraoui, R. and Kouznetsov, P. :
Computing with Reads and Writes in the Absence of Step Contention,
pages 122-136.
-
David, M. and Brodsky, A. and Fich, F.E. :
Restricted Stack Implementations,
pages 137-151.
-
Chockler, G. and Lynch, N. and Mitra, S. and Tauber, J. :
Proving Atomicity: An Assertional Approach,
pages 152-168.
-
Attiya, H. and Hendler, D. :
Time and Space Lower Bounds for Implementations Using {k-CAS},
pages 169-183.
-
Delporte-Gallet, C. and Fauconnier, H. and Guerraoui, R. :
(Almost) All Objects Are Universal in Message Passing Systems,
pages 184-198.
-
Malkhi, D. and Oprea, F. and Zhou, L. :
Meets Paxos: Leader Election and Stability Without Eventual Timely Links,
pages 199-213.
-
Moore, B.T. and Sivilotti, P.A.G. :
Plausible Clocks with Bounded Inaccuracy,
pages 214-228.
-
Engelhardt, K. and Moses, Y. :
Causing Communication Closure: Safe Program Composition with Non-FIFO Channels,
pages 229-243.
-
Guerraoui, R. and Ruppert, E. :
What Can Be Implemented Anonymously?,
pages 244-259.
-
Pelc, A. :
Waking Up Anonymous Ad Hoc Radio Networks,
pages 260-272.
-
Kuhn, F. and Moscibroda, T. and Nieberg, T. and Wattenhofer, R. :
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs,
pages 273-287.
-
Goldwasser, S. and Sudan, M. and Vaikuntanathan, V. :
Distributed Computing with Imperfect Randomness,
pages 288-302.
-
Guerraoui, R. and Herlihy, M. and Pochon, B. :
Polymorphic Contention Management,
pages 303-323.
-
Herlihy, M. and Sun, Y. :
Distributed Transactional Memory for Metric-Space Networks,
pages 324-338.
-
Malkhi, D. and Terry, D. :
Concise Version Vectors in {WinFS},
pages 339-353.
-
Marathe, V.J. and Scherer III, W.N. and Scott, M.L. :
Adaptive Software Transactional Memory,
pages 354-368.
-
Zieli\'nski, P. :
Optimistic Generic Broadcast,
pages 369-383.
-
Afek, Y. and Levie, Y.D. :
Space and Step Complexity Efficient Adaptive Collect,
pages 384-398.
-
Beauquier, J. and Pilard, L. and Rozoy, B. :
Observing Locally Self-stabilization in a Probabilistic Way,
pages 399-413.
-
Flammini, M. and Moscardelli, L. and Navarra, A. and Perennes, S. :
Asymptotically Optimal Solutions for Small World Graphs,
pages 414-428.
-
Blesa, M. :
Deciding stability in packet-switched {FIFO} networks under the {A}dversarial {Q}ueuing model in polynomial time,
pages 429-441.
-
Abraham, I. and Gavoille, C. and Malkhi, D. :
Compact Routing for Graphs Excluding a Fixed Minor,
pages 442-456.
-
Korman, A. :
General Compact Labeling Schemes for Dynamic Trees,
pages 457-471.
-
Nadav, U. and Naor, M. :
The Dynamic And-Or Quorum System,
pages 472-486.
Brief Anouncements
-
Liskov, B. and Rodrigues, R. :
Byzantine Clients Rendered Harmless,
pages 487-489.
-
Fernandez, A. and Georgiou, C. and Lspez, L. and Santos, A. :
Reliably Executing Tasks in the Presence of Malicious Processors,
pages 490-492.
-
Fich, F.E. and Luchangco, V. and Moir, M. and Shavit, N. :
Obstruction-Free Step Complexity: Lock-Free {DCAS} as an Example,
pages 493-494.
-
Larrea, M. and Lafuente, A. :
Communication-Efficient Implementation of Failure Detector Classes Q and P,
pages 495-496.
-
Cachin, C. and Tessaro, S. :
Optimal Resilience for Erasure-Coded Byzantine Distributed Storage,
pages 497-498.
-
Okun, M. :
Agreement Among Unacquainted Byzantine Generals,
pages 499-500.
-
Zhao, Y. and Bhola, S. and Sturman, D. :
Subscription Propagation and Content-Based Routing with Delivery Guarantees,
pages 501-502.
-
Cachin, C. and Tessaro, S. :
Asynchronous Verifiable Information Dispersal,
pages 503-504.
-
Anceaume, E. and Defago, X. and Gradinariu, M. and Roy, M. :
Towards a Theory of Self-organization,
pages 505-506.
-
Lotker, Z. and Patt-Shamir, B. and Tuttle, M.R. :
Timing Games and Shared Memory,
pages 507-508.
-
Kuo, Y.-C. and Lee, H.-C. :
A Lightweight Group Mutual k-Exclusion Algorithm Using Bi-k-Arbiters,
pages 509-510.
-
Duchon, P. and Hanusse, N. and Lebhar, E. and Schabanel, N. :
Could any Graph be Turned into a Small-World?,
pages 511-513.
-
Abraham, I. and Malkhi, D. and Manku, G.S. :
Papillon: Greedy Routing in Rings,
pages 514-515.
-
Englert, B. :
An Efficient Long-Lived Adaptive Collect Algorithm,
pages 516-518.
Winner of Best Student Paper Award
-
Korman, A. :
General Compact Labeling Schemes for Dynamic Trees,
pages 457-471.
|