@Proceedings{disc:2005,
  title  =     {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  series =     {Lecture Notes In Computer Science},
  volume =     {3724},
  publisher =  {Springer-Verlag GmbH},
  year =       {2005},
  ISBN =       {3-540-29163-6},
}

@InProceedings{disc:2005-1,
  author =     {Badishi, G.  and Herzberg, A. and Keidar, I.},
  title =      {Keeping Denial-of-Service Attackers in the Dark},
  pages =      {18--32},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-2,
  author =     {Vvlzer, H.},
  title =      {On Conspiracies and Hyperfairness in Distributed Computing},
  pages =      {33--47},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-3,
  author =     {Aiyer, A. and Alvisi, L. and Bazzi, R.A.},
  title =      {On the Availability of Non-strict Quorum Systems},
  pages =      {48--62},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-4,
  author =     {Gafni, E. and  Rajsbaum, S.},
  title =      {Musical Benches},
  pages =      {63--77},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-5,
  author =     {Fich, F.E. and Luchangco, V. and Moir, M. and Shavit, N.},
  title =      {Obstruction-Free Algorithms Can Be Practically Wait-Free},
  pages =      {78--92},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-6,
  author =     {Mittal, N. and Freiling, F.C. and Venkatesan, S. and Draque-Penso, L.},
  title =      {Efficient Reduction for Wait-Free Termination Detection in a Crash-Prone Distributed System},
  pages =      {93--107},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-7,
  author =     {Purcell, C. and Harris, T.},
  title =      {Non-blocking Hashtables with Open Addressing},
  pages =      {108--121},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-8,
  author =     {Attiya, H. and Guerraoui, R. and Kouznetsov, P.},
  title =      {Computing with Reads and Writes in the Absence of Step Contention},
  pages =      {122--136},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-9,
  author =     {David, M. and Brodsky, A. and Fich, F.E.},
  title =      {Restricted Stack Implementations},
  pages =      {137--151},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-10,
  author =     {Chockler, G. and Lynch, N. and Mitra, S. and Tauber, J.},
  title =      {Proving Atomicity: An Assertional Approach},
  pages =      {152--168},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-11,
  author =     {Attiya, H. and Hendler, D.},
  title =      {Time and Space Lower Bounds for Implementations Using {\{}k-CAS{\}}},
  pages =      {169--183},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-12,
  author =     {Delporte-Gallet, C. and Fauconnier, H. and Guerraoui, R.},
  title =      {(Almost) All Objects Are Universal in Message Passing Systems},
  pages =      {184--198},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-13,
  author =     {Malkhi, D. and Oprea, F. and Zhou, L.},
  title =      {Meets Paxos: Leader Election and Stability Without Eventual Timely Links},
  pages =      {199--213},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-14,
  author =     {Moore, B.T. and Sivilotti, P.A.G.},
  title =      {Plausible Clocks with Bounded Inaccuracy},
  pages =      {214--228},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-15,
  author =     {Engelhardt, K. and Moses, Y.},
  title =      {Causing Communication Closure: Safe Program Composition with Non-FIFO Channels},
  pages =      {229--243},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-16,
  author =     {Guerraoui, R. and Ruppert, E.},
  title =      {What Can Be Implemented Anonymously?},
  pages =      {244--259},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-17,
  author =     {Pelc, A.},
  title =      {Waking Up Anonymous Ad Hoc Radio Networks},
  pages =      {260--272},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-18,
  author =     {Kuhn, F. and Moscibroda, T. and Nieberg, T. and Wattenhofer, R.},
  title =      {Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs},
  pages =      {273--287},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-19,
  author =     {Goldwasser, S. and Sudan, M. and Vaikuntanathan, V.},
  title =      {Distributed Computing with Imperfect Randomness},
  pages =      {288--302},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-20,
  author =     {Guerraoui, R. and Herlihy, M. and Pochon, B.},
  title =      {Polymorphic Contention Management},
  pages =      {303--323},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-21,
  author =     {Herlihy, M. and Sun, Y.},
  title =      {Distributed Transactional Memory for Metric-Space Networks},
  pages =      {324--338},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-22,
  author =     {Malkhi, D. and Terry, D.},
  title =      {Concise Version Vectors in {\{}WinFS{\}}},
  pages =      {339--353},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-23,
  author =     {Marathe, V.J. and Scherer III, W.N. and Scott, M.L.},
  title =      {Adaptive Software Transactional Memory},
  pages =      {354--368},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-24,
  author =     {Zieli\'nski, P.},
  title =      {Optimistic Generic Broadcast},
  pages =      {369--383},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-25,
  author =     {Afek, Y. and Levie, Y.D.},
  title =      {Space and Step Complexity Efficient Adaptive Collect},
  pages =      {384--398},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-26,
  author =     {Beauquier, J. and Pilard, L. and Rozoy, B.},
  title =      {Observing Locally Self-stabilization in a Probabilistic Way},
  pages =      {399--413},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-27,
  author =     {Flammini, M. and Moscardelli, L. and Navarra, A. and Perennes, S.},
  title =      {Asymptotically Optimal Solutions for Small World Graphs},
  pages =      {414--428},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-28,
  author =     {Blesa, M.},
  title =      {Deciding stability in packet-switched {\{}FIFO{\}} networks under the {\{}A{\}}dversarial {\{}Q{\}}ueuing model in polynomial time},
  pages =      {429--441},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-29,
  author =     {Abraham, I. and Gavoille, C. and Malkhi, D.},
  title =      {Compact Routing for Graphs Excluding a Fixed Minor},
  pages =      {442--456},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-30,
  author =     {Korman, A.},
  title =      {General Compact Labeling Schemes for Dynamic Trees},
  pages =      {457--471},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-31,
  author =     {Nadav, U. and Naor, M.},
  title =      {The Dynamic And-Or Quorum System},
  pages =      {472--486},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-32,
  author =     {Liskov, B. and Rodrigues, R.},
  title =      {Byzantine Clients Rendered Harmless},
  pages =      {487--489},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-33,
  author =     {Fernandez, A. and Georgiou, C. and Lspez, L. and Santos, A.},
  title =      {Reliably Executing Tasks in the Presence of Malicious Processors},
  pages =      {490--492},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-34,
  author =     {Fich, F.E. and Luchangco, V. and Moir, M. and Shavit, N.},
  title =      {Obstruction-Free Step Complexity: Lock-Free {\{}DCAS{\}} as an Example},
  pages =      {493--494},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-35,
  author =     {Larrea, M. and Lafuente, A.},
  title =      {Communication-Efficient Implementation of Failure Detector Classes Q and P},
  pages =      {495--496},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-36,
  author =     {Cachin, C. and Tessaro, S.},
  title =      {Optimal Resilience for Erasure-Coded Byzantine Distributed Storage},
  pages =      {497--498},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-37,
  author =     {Okun, M.},
  title =      {Agreement Among Unacquainted Byzantine Generals},
  pages =      {499--500},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-38,
  author =     {Zhao, Y. and Bhola, S. and Sturman, D.},
  title =      {Subscription Propagation and Content-Based Routing with Delivery Guarantees},
  pages =      {501--502},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-39,
  author =     {Cachin, C. and Tessaro, S.},
  title =      {Asynchronous Verifiable Information Dispersal},
  pages =      {503--504},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-40,
  author =     {Anceaume, E. and Defago, X. and Gradinariu, M. and Roy, M.},
  title =      {Towards a Theory of Self-organization},
  pages =      {505--506},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-41,
  author =     {Lotker, Z. and Patt-Shamir, B. and Tuttle, M.R.},
  title =      {Timing Games and Shared Memory},
  pages =      {507--508},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-42,
  author =     {Kuo, Y.-C. and Lee, H.-C.},
  title =      {A Lightweight Group Mutual k-Exclusion Algorithm Using Bi-k-Arbiters},
  pages =      {509--510},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-43,
  author =     {Duchon, P. and Hanusse, N. and Lebhar, E. and Schabanel, N.},
  title =      {Could any Graph be Turned into a Small-World?},
  pages =      {511--513},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-44,
  author =     {Abraham, I. and Malkhi, D. and Manku, G.S.},
  title =      {Papillon: Greedy Routing in Rings},
  pages =      {514--515},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-45,
  author =     {Englert, B.},
  title =      {An Efficient Long-Lived Adaptive Collect Algorithm},
  pages =      {516--518},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}

@InProceedings{disc:2005-46,
  author =     {Korman, A.},
  title =      {General Compact Labeling Schemes for Dynamic Trees},
  pages =      {457--471},
  booktitle =  {Distributed algorithms},
  editor =     {Fraigniaud, Pierre},
  year =       {2005},
  month =      {September},
  volume =     {3724},
  ISBN =       {3-540-29163-6},
  pubisher =   {Springer-Verlag GmbH},
  series =     {Lecture Notes In Computer Science},
 
}