@Proceedings{disc:2001,
  title  =     {Distributed algorithms},
  editor =     {Jennifer L. Welch},
  series =     {Lecture Notes in Computer Science},
  volume =     {2180},
  publisher =  {Springer},
  year =       {2001},
  ISBN =       {3-540-42605-1},
}

@InProceedings{disc:2001-1,
  author =     {Yong-Jik Kim and James H. Anderson},
  title =      {A Time Complexity Bound for Adaptive Mutual Exclusion},
  pages =      {1--15},
  booktitle =  {Distributed algorithms},
  editor =     {Jennifer L. Welch},
  year =       {2001},
  month =      {Oct},
  volume =     {2180},
  ISBN =       {3-540-42605-1},
  pubisher =   {Springer},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2001-2,
  author =     {Yuh-Jzer Joung},
  title =      {Quorum-Based Algorithms for Group Mutual Exclusion},
  pages =      {16--32},
  booktitle =  {Distributed algorithms},
  editor =     {Jennifer L. Welch},
  year =       {2001},
  month =      {Oct},
  volume =     {2180},
  ISBN =       {3-540-42605-1},
  pubisher =   {Springer},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2001-3,
  author =     {Paolo Boldi and Sebastiano Vigna},
  title =      {An Effective Characterization of Computability in Anonymous Networks},
  pages =      {33--47},
  booktitle =  {Distributed algorithms},
  editor =     {Jennifer L. Welch},
  year =       {2001},
  month =      {Oct},
  volume =     {2180},
  ISBN =       {3-540-42605-1},
  pubisher =   {Springer},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2001-4,
  author =     {John R. Douceur and Roger P. Wattenhofer},
  title =      {Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System},
  pages =      {48--62},
  booktitle =  {Distributed algorithms},
  editor =     {Jennifer L. Welch},
  year =       {2001},
  month =      {Oct},
  volume =     {2180},
  ISBN =       {3-540-42605-1},
  pubisher =   {Springer},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2001-5,
  author =     {Dahlia Malkhi and Elan Pavlov and Yaron Sella},
  title =      {Optimal Unconditional Information Diffusion},
  pages =      {63--77},
  booktitle =  {Distributed algorithms},
  editor =     {Jennifer L. Welch},
  year =       {2001},
  month =      {Oct},
  volume =     {2180},
  ISBN =       {3-540-42605-1},
  pubisher =   {Springer},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2001-6,
  author =     {Neeraj Mittal  and Vijay K. Garg},
  title =      {Computation Slicing: Techniques and Theory},
  pages =      {78--92},
  booktitle =  {Distributed algorithms},
  editor =     {Jennifer L. Welch},
  year =       {2001},
  month =      {Oct},
  volume =     {2180},
  ISBN =       {3-540-42605-1},
  pubisher =   {Springer},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2001-7,
  author =     {R. Jim{\'{e}}nez and Peris, M. Patino-Mart{\'{i}}nez and G. Alonso and S. Ar{\'{e}}valo},
  title =      { A Low-Latency Non-blocking Commit Service},
  pages =      {93--107},
  booktitle =  {Distributed algorithms},
  editor =     {Jennifer L. Welch},
  year =       {2001},
  month =      {Oct},
  volume =     {2180},
  ISBN =       {3-540-42605-1},
  pubisher =   {Springer},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2001-8,
  author =     {Marcos K. Aguilera and Carole Delporte-Gallet and Hugues Fauconnier and Sam Toueg},
  title =      {Stable Leader Election},
  pages =      {108--122},
  booktitle =  {Distributed algorithms},
  editor =     {Jennifer L. Welch},
  year =       {2001},
  month =      {Oct},
  volume =     {2180},
  ISBN =       {3-540-42605-1},
  pubisher =   {Springer},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2001-9,
  author =     {Michiko Inoue and Shinya Umetani and Toshimitsu Masuzawa and Hideo Fujiwara},
  title =      {Adaptive Long-Lived {O}(k2)-Renaming with {O}(k2) Steps},
  pages =      {123--135},
  booktitle =  {Distributed algorithms},
  editor =     {Jennifer L. Welch},
  year =       {2001},
  month =      {Oct},
  volume =     {2180},
  ISBN =       {3-540-42605-1},
  pubisher =   {Springer},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2001-10,
  author =     {Maurice Herlihy and ergio Rajsbaum and Mark Tuttle},
  title =      {A New Synchronous Lower Bound for Set Agreement},
  pages =      {136--150},
  booktitle =  {Distributed algorithms},
  editor =     {Jennifer L. Welch},
  year =       {2001},
  month =      {Oct},
  volume =     {2180},
  ISBN =       {3-540-42605-1},
  pubisher =   {Springer},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2001-11,
  author =     {Chryssis Georgiou and Alexander Russell and Alex A. Shvartsman},
  title =      {The Complexity of Synchronous Iterative Do-All with Crashes},
  pages =      {151--165},
  booktitle =  {Distributed algorithms},
  editor =     {Jennifer L. Welch},
  year =       {2001},
  month =      {Oct},
  volume =     {2180},
  ISBN =       {3-540-42605-1},
  pubisher =   {Springer},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2001-12,
  author =     {Stefan Dobrev and Paola Flocchini and Giuseppe Prencipe and Nicola Santoro},
  title =      {Mobile Search for a Black Hole in an Anonymous Ring},
  pages =      {166--179},
  booktitle =  {Distributed algorithms},
  editor =     {Jennifer L. Welch},
  year =       {2001},
  month =      {Oct},
  volume =     {2180},
  ISBN =       {3-540-42605-1},
  pubisher =   {Springer},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2001-13,
  author =     {Jaap-Henk Hoepman},
  title =      {Randomised Mutual Search for $k > 2$ Agents},
  pages =      {180--193},
  booktitle =  {Distributed algorithms},
  editor =     {Jennifer L. Welch},
  year =       {2001},
  month =      {Oct},
  volume =     {2180},
  ISBN =       {3-540-42605-1},
  pubisher =   {Springer},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2001-14,
  author =     {Lisa Higham and Hiying Liang},
  title =      {Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks},
  pages =      {194--208},
  booktitle =  {Distributed algorithms},
  editor =     {Jennifer L. Welch},
  year =       {2001},
  month =      {Oct},
  volume =     {2180},
  ISBN =       {3-540-42605-1},
  pubisher =   {Springer},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2001-15,
  author =     {Maurice Herlihy and Srikanta Tirthapura},
  title =      {Self Stabilizing Distributed Queuing},
  pages =      {209--223},
  booktitle =  {Distributed algorithms},
  editor =     {Jennifer L. Welch},
  year =       {2001},
  month =      {Oct},
  volume =     {2180},
  ISBN =       {3-540-42605-1},
  pubisher =   {Springer},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2001-16,
  author =     {Faith E. Fich and Colette Johnen},
  title =      {A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings},
  pages =      {224--239},
  booktitle =  {Distributed algorithms},
  editor =     {Jennifer L. Welch},
  year =       {2001},
  month =      {Oct},
  volume =     {2180},
  ISBN =       {3-540-42605-1},
  pubisher =   {Springer},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2001-17,
  author =     {Marie Duflot and Laurent Fribourg and Claudine Picaronny},
  title =      {Randomized Finite-State Distributed Algorithms as {M}arkov Chains},
  pages =      {240--254},
  booktitle =  {Distributed algorithms},
  editor =     {Jennifer L. Welch},
  year =       {2001},
  month =      {Oct},
  volume =     {2180},
  ISBN =       {3-540-42605-1},
  pubisher =   {Springer},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2001-18,
  author =     {David Peleg  and Uri Pincas},
  title =      {The Average Hop Count Measure for Virtual Path Layouts},
  pages =      {255--269},
  booktitle =  {Distributed algorithms},
  editor =     {Jennifer L. Welch},
  year =       {2001},
  month =      {Oct},
  volume =     {2180},
  ISBN =       {3-540-42605-1},
  pubisher =   {Springer},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2001-19,
  author =     {Lali Barri{\`{e}}re and Pierre Fraigniaud and Evangelos Kranakis and Danny Krizanc},
  title =      {Efficient Routing in Networks with Long Range Contacts},
  pages =      {270--284},
  booktitle =  {Distributed algorithms},
  editor =     {Jennifer L. Welch},
  year =       {2001},
  month =      {Oct},
  volume =     {2180},
  ISBN =       {3-540-42605-1},
  pubisher =   {Springer},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2001-20,
  author =     {I. Chatzigiannakis and S. Nikoletseas and P. Spirakis},
  title =      {An Efficient Communication Strategy for Ad-hoc Mobile Networks},
  pages =      {285--299},
  booktitle =  {Distributed algorithms},
  editor =     {Jennifer L. Welch},
  year =       {2001},
  month =      {Oct},
  volume =     {2180},
  ISBN =       {3-540-42605-1},
  pubisher =   {Springer},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2001-21,
  author =     {Timothy L. Harris},
  title =      {A Pragmatic Implementation of Non-blocking Linked-Lists},
  pages =      {300--314},
  booktitle =  {Distributed algorithms},
  editor =     {Jennifer L. Welch},
  year =       {2001},
  month =      {Oct},
  volume =     {2180},
  ISBN =       {3-540-42605-1},
  pubisher =   {Springer},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2001-22,
  author =     {Ted Herman and Toshimitsu Masuzawa},
  title =      {Stabilizing Replicated Search Trees},
  pages =      {315--329},
  booktitle =  {Distributed algorithms},
  editor =     {Jennifer L. Welch},
  year =       {2001},
  month =      {Oct},
  volume =     {2180},
  ISBN =       {3-540-42605-1},
  pubisher =   {Springer},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2001-23,
  author =     {Panagiota Fatourou and Maurice Herlihy},
  title =      {Adding Networks},
  pages =      {330--342},
  booktitle =  {Distributed algorithms},
  editor =     {Jennifer L. Welch},
  year =       {2001},
  month =      {Oct},
  volume =     {2180},
  ISBN =       {3-540-42605-1},
  pubisher =   {Springer},
  series =     {Lecture Notes in Computer Science},
 
}

@InProceedings{disc:2001-24,
  author =     {Yong-Jik Kim and James H. Anderson},
  title =      {A Time Complexity Bound for Adaptive Mutual Exclusion},
  pages =      {1--15},
  booktitle =  {Distributed algorithms},
  editor =     {Jennifer L. Welch},
  year =       {2001},
  month =      {Oct},
  volume =     {2180},
  ISBN =       {3-540-42605-1},
  pubisher =   {Springer},
  series =     {Lecture Notes in Computer Science},
 
}