@Proceedings{disc:2003,
  title  =     {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  series =     {Lecture Notes in Computer Science},
  volume =     {2848/2003},
  publisher =  {Springer-Verlag Heidelberg},
  year =       {2003},
  ISBN =       {3-540-20184-X},
}

@InProceedings{disc:2003-1,
  author =     {Michael Merritt and Gadi Taubenfeld},
  title =      {Resilient Consensus for Infinitely Many Processes},
  pages =      {1--15},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-2,
  author =     { Marcos Aguilera and Burkhard Englert and Eli Gafni},
  title =      { Uniform Solvability with a Finite Number of MWMR Registers},
  pages =      {16--29},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-3,
  author =     {Yong-Jik Kim and James Anderson},
  title =      {Timing-based Mutual Exclusion with Local Spinning},
  pages =      {30--44},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-4,
  author =     {Victor Luchangco and Mark Moir and Nir Shavit},
  title =      {On the Uncontended Complexity of Consensus},
  pages =      {45--59},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-5,
  author =     { Ittai Abraham and Dahlia Malkhi},
  title =      { Probabilistic Quorums for Dynamic Systems},
  pages =      {60--74},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-6,
  author =     {Rui Fan and Nancy Lynch},
  title =      {Efficient Replication of Large Data Objects},
  pages =      {75--91},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-7,
  author =     {Roman Vitenberg and Roy Friedman},
  title =      {On the Locality of Consistency Conditions},
  pages =      {92--105},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-8,
  author =     {Cheng Shao and Evelyn Pierce and Jennifer Welch},
  title =      {Multi-Writer Consistency Conditions for Shared Memory Objects},
  pages =      {106--120},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-9,
  author =     {Josef Widder},
  title =      {Booting Clock Synchronization in Partially Synchronous Systems},
  pages =      {121--135},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-10,
  author =     {Yoah Bar-David and Gadi Taubenfeld},
  title =      {Automatic Discovery of Mutual Exclusion Algorithms},
  pages =      {136--150},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-11,
  author =     { Paul Attie},
  title =      {On the Implementation Complexity of Specifications of Concurrent Programs},
  pages =      {151--165},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-12,
  author =     { Nir Andelman and Yishay Mansour},
  title =      {Competitive Management of Non-Preemptive Queues with Multiple Values},
  pages =      {166--180},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-13,
  author =     {Amitabha Bagchi and Amitabh Chaudhary and Michael T. Goodrich and Shouhuai Xu},
  title =      {Constructing Disjoint Paths for Secure Communication},
  pages =      {181--195},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-14,
  author =     {Kazuo Iwama and Masaki Okita},
  title =      {Compact Routing for Flat Networks},
  pages =      {196--210},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-15,
  author =     {Pierre Fraigniaud and Cyril Gavoille},
  title =      {Lower Bounds for Oblivious Single-Message End-to-End Communication},
  pages =      {211--223},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-16,
  author =     {Chryssis Georgiou and Dariusz Kowalski and Alex Shvartsman},
  title =      {Efficient Gossip and Robust Distributed Computation},
  pages =      {224--238},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-17,
  author =     {Yoav Zibin },
  title =      {Condition-based Consensus in Synchronous Systems},
  pages =      {239--248},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-18,
  author =     {Achour Mostefaoui and Sergio Rajsbaum and Michel Raynal},
  title =      {Using Conditions to Expedite Consensus in Synchronous Distributed Systems},
  pages =      {249--263},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-19,
  author =     {Partha Dutta and Rachid Guerraoui and Bastian Pochon},
  title =      {Tight Lower Bounds on Early Local Decisions in Uniform Consensus},
  pages =      {264--278},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-20,
  author =     {Maurice Herlihy and Lucia Penso},
  title =      {Tight Bounds for k-Set Agreement with Limited-Scope Failure Detectors},
  pages =      {279--291},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-21,
  author =     {Rachid Guerraoui and Petr Kouznetsov},
  title =      {On Failure Detectors and Type Boosters},
  pages =      {292--305},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-22,
  author =     {Shlomi Dolev and Seth Gilbert and Nancy Lynch and Alex Shvartsman and Jennifer Welch},
  title =      {GeoQuorums: Implementing Atomic Memory in Ad Hoc Networks},
  pages =      {306--320},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-23,
  author =     { Kirsten Hildrum and John Kubiatowicz},
  title =      {Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks},
  pages =      {321--336},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-24,
  author =     {Qixiang Sun and Neil Daswani and Hector Garcia-Molina},
  title =      {Maximizing Remote Work in Flooding-based Peer-to-Peer Systems},
  pages =      {337--351},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-25,
  author =     {Haifeng Yu},
  title =      {Overcoming the Majority Barrier in Large-Scale Systems},
  pages =      {352--366},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-26,
  author =     {Emanuelle Anceaume and Maria Gradinariu and Matthieu Roy},
  title =      {Self-organizing Systems Case Study: peer-to-peer networks},
  pages =      {--},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-27,
  author =     {Baruch Awerbuch and Christian Scheideler},
  title =      {The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments},
  pages =      {--},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-28,
  author =     {Philippe Duchon and Nicolas Hanusse and Nasser Saheb and Akka Zemmari},
  title =      {Broadcast using Rendezvous},
  pages =      {--},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-29,
  author =     {Daniela Tulone },
  title =      {How accurately and efficiently can processes get the reference time?},
  pages =      {--},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2003-30,
  author =     { Ittai Abraham and Dahlia Malkhi},
  title =      { Probabilistic Quorums for Dynamic Systems},
  pages =      {60--74},
  booktitle =  {Distributed algorithms},
  editor =     {Faith Ellen Fich},
  year =       {2003},
  month =      {Oct},
  volume =     {2848/2003},
  ISBN =       {3-540-20184-X},
  pubisher =   {Springer-Verlag Heidelberg},
  series =     {Lecture Notes in Computer Science},
 
}