@Proceedings{disc:2008, title = {Distributed algorithms}, editor = {}, series = {}, volume = {}, publisher = {}, year = {2008}, ISBN = {}, } @InProceedings{disc:2008-1, author = { and and }, title = {}, pages = {--}, booktitle = {Distributed algorithms}, editor = {}, year = {2008}, month = {September}, volume = {}, ISBN = {}, pubisher = {}, series = {}, } @InProceedings{disc:2008-2, author = { and }, title = {}, pages = {--}, booktitle = {Distributed algorithms}, editor = {}, year = {2008}, month = {September}, volume = {}, ISBN = {}, pubisher = {}, series = {}, } @InProceedings{disc:2008-3, author = {}, title = {}, pages = {--}, booktitle = {Distributed algorithms}, editor = {}, year = {2008}, month = {September}, volume = {}, ISBN = {}, pubisher = {}, series = {}, } @Proceedings{disc:2007, title = {Distributed algorithms}, editor = {Andrzej Pelc}, series = {Lecture Notes in Computer Science}, volume = {4731/2007}, publisher = {Springer-Verlag Heidelberg}, year = {2007}, ISBN = {978-3-540-75141-0}, } @InProceedings{disc:2007-1, author = {Burkhard Monien and Karsten Tiemann}, title = {Routing and Scheduling with Incomplete Information}, pages = {1--2}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-2, author = {David Peleg}, title = {Time-Efficient Broadcasting in Radio Networks}, pages = {3--4}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-3, author = {Raynal Michel}, title = {A Subjective Visit to Selected Topics in Distributed Computing}, pages = {5--6}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-4, author = {Amitanand S. Aiyer and Lorenzo Alvisi and Rida A. Bazzi}, title = {Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions}, pages = {7--19}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-5, author = {Dana Angluin and James Aspnes and David Eisenstat}, title = {A Simple Population Protocol for Fast Robust Approximate Majority}, pages = {20--32}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-6, author = {Baruch Awerbuch and Christian Scheideler}, title = {A Denial-of-Service Resistant DHT}, pages = {33--47}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-7, author = {Roberto Baldoni and Kleoni Ioannidou and Alessia Milani}, title = {Mobility Versus the Cost of Geocasting in Mobile Ad-Hoc Networks}, pages = {48--62}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-8, author = {Joffroy Beauquier and Julien Clement and St{\~{A}}İphane Messika and Laurent Rosaz and Brigitte Rozoy}, title = {Self-stabilizing Counting in Mobile Sensor Networks with a Base Station}, pages = {63--76}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-9, author = {Edward Bortnikov and Israel Cidon and Idit Keidar}, title = {Scalable Load-Distance Balancing}, pages = {77--91}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-10, author = {Janna Burman and Shay Kutten}, title = {Time Optimal Asynchronous Self-stabilizing Spanning Tree}, pages = {92--107}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-11, author = {J{\~{A}}İr{\~{A}}İmie Chalopin and Shantanu Das and Nicola Santoro}, title = {Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links}, pages = {108--122}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-12, author = {Wei Chen and Jialin Zhang and Xuezheng Liu}, title = {Weakening Failure Detectors for k -Set Agreement Via the Partition Approach}, pages = {123--138}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-13, author = {Gregory Chockler and Rachid Guerraoui and Idit Keidar}, title = {Amnesic Distributed Storage}, pages = {139--151}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-14, author = {Andrzej Czygrinow and Michal Hanckowiak}, title = {Distributed Approximations for Packing in Unit-Disk Graphs}, pages = {152--164}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-15, author = {Carole Delporte-Gallet and Hugues Fauconnier and Felix C. Freiling and Lucia Draque Penso and Andreas Tielmann}, title = {From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors}, pages = {165--178}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-16, author = {Bilel Derbel and Cyril Gavoille and David Peleg}, title = {Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time}, pages = {179--192}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-17, author = {Danny Dolev and Ezra N. Hoc}, title = {On Self-stabilizing Synchronous Actions Despite Byzantine Attacks}, pages = {193--207}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-18, author = {Shlomi Dolev and Seth Gilbert and Rachid Guerraoui and Calvin C. Newport}, title = {Gossiping in a Multi-channel Radio Network}, pages = {208--222}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-19, author = {Faith Ellen and Panagiota Fatourou and Eric Ruppert}, title = {The Space Complexity of Unbounded Timestamps}, pages = {223--237}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-20, author = {Simon Fischer and Lars Olbrich and Berthold V{\~{A}}{\P}cking}, title = {Approximating Wardrop Equilibria with Finitely Many Agents}, pages = {238--252}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-21, author = {Leszek Gasieniec and Erez Kantor and Dariusz R. Kowalski and David Peleg and Chang Su}, title = {Energy and Time Efficient Broadcasting in Known Topology Radio Networks}, pages = {253--267}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-22, author = {Beat Gfeller and Nicola Santoro and Peter Widmayer}, title = {A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree}, pages = {268--282}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-23, author = {Seth Gilbert and Rachid Guerraoui and Dariusz R. Kowalski}, title = {On the Message Complexity of Indulgent Consensus}, pages = {283--297}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-24, author = {Taisuke Izumi and Yoshiaki Katayama and Nobuhiro Inuzuka and Koichi Wada}, title = {Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result}, pages = {298--312}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-25, author = {Amos Korman and David Peleg}, title = {Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes}, pages = {313--327}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-26, author = {Dariusz R. Kowalski and Michal Strojnowski}, title = {On the Communication Surplus Incurred by Faulty Processors}, pages = {328--342}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-27, author = {Shay Kutten and Toshimitsu Masuzawa}, title = {Output Stability Versus Time Till Output}, pages = {343--357}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-28, author = {Matthew Lang and Paolo A. G. Sivilotti}, title = {A Distributed Maximal Scheduler for Strong Fairness}, pages = {358--372}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-29, author = {Shuang Liang and Ke Chen and Song Jiang and Xiaodong Zhang}, title = {Cost-Aware Caching Algorithms for Distributed Storage Servers}, pages = {373--387}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-30, author = {Thomas Locher and Remo Meier and Stefan Schmid and Roger Wattenhofer}, title = {Push-to-Pull Peer-to-Peer Live Streaming}, pages = {388--402}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-31, author = {Michael G. Merideth and Michael K. Reiter}, title = {Probabilistic Opaque Quorum Systems}, pages = {403--419}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-32, author = {Vinit A. Ogale and Vijay K. Garg}, title = {Detecting Temporal Logic Predicates on Distributed Computations}, pages = {420--434}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-33, author = {Mordechai Shalom and Prudence W. H. Wong and Shmuel Zaks}, title = {Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks}, pages = {435--449}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-34, author = {Gadi Taubenfeld}, title = {Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms}, pages = {450--464}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-35, author = {Piotr Zielinski}, title = {Automatic Classification of Eventual Failure Detectors}, pages = {465--479}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-36, author = {Alysson Neves Bessani and Miguel Correia and Henrique Moniz and Nuno Ferreira Neves and Paulo Ver{\~{A}}­ssimo}, title = {When 3f+1 Is Not Enough: Tradeoffs for Decentralized Asynchronous Byzantine Consensus}, pages = {480--481}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-37, author = {Cyril Gavoille and Ralf Klasing and Adrian Kosowski and Alfredo Navarra}, title = {On the Complexity of Distributed Greedy Coloring}, pages = {482--484}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-38, author = {Colette Johnen and Lisa Higham}, title = {Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks}, pages = {485--487}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-39, author = {Virendra J. Marathe and Michael F. Spear and Michael L. Scott}, title = {Transaction Safe Nonblocking Data Structures}, pages = {488--489}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-40, author = {Tal Mizrahi and Yoram Moses}, title = {Long Live Continuous Consensus}, pages = {490--491}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-41, author = {Damon Mosk-Aoyama and Tim Roughgarden and Devavrat Shah}, title = {Fully Distributed Algorithms for Convex Optimization Problems}, pages = {492--493}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-42, author = {Michael Okun}, title = {On the Power of Impersonation Attacks}, pages = {494--495}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-43, author = {Arpita Patra and Ashish Choudhary and Kannan Srinathan and C. Pandu Rangan}, title = {Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary}, pages = {496--498}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-44, author = {Rodrigo Schmidt and Fernando Pedone}, title = {A Formal Analysis of the Deferred Update Technique}, pages = {499--500}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-45, author = {Dana Angluin and James Aspnes and David Eisenstat}, title = {A Simple Population Protocol for Fast Robust Approximate Majority}, pages = {20--32}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-46, author = {Michel Raynal and Sam Toueg and Shmuel Zaks}, title = {DISC at Its 20th Anniversary (Stockholm, 2006)}, pages = {501--503}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-47, author = {Leslie Lamport}, title = {DISC 20th Anniversary: Invited Talk Time, Clocks, and the Ordering of My Ideas About Distributed Systems}, pages = {504--504}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-48, author = {Nancy A. Lynch}, title = {ISC 20th Anniversary: Invited Talk My Early Days in Distributed Computing Theory: 1979-1982}, pages = {505--506}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2007-49, author = {Michael O. Rabin}, title = {DISC 20th Anniversary: Invited Talk Provably Unbreakable Hyper-Encryption Using Distributed Systems}, pages = {506--508}, booktitle = {Distributed algorithms}, editor = {Andrzej Pelc}, year = {2007}, month = {September}, volume = {4731/2007}, ISBN = {978-3-540-75141-0}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @Proceedings{disc:2006, title = {Distributed algorithms}, editor = {Shlomi Dolev}, series = {Lecture Notes in Computer Science}, volume = {4167/2006}, publisher = {Springer-Verlag Heidelberg}, year = {2006}, ISBN = {3-540-44624-9}, } @InProceedings{disc:2006-1, author = {Anchour Mostefaoui and Michel Raynal and Corentin Travers}, title = {Exploring Gafni's reduction land: from $\Omega^k$ to wait-free adaptive $(wp - |\frac{p}{k}|) renaming via k-set agreement}, pages = {1--15}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-2, author = {Michael Okun and Amnon Barak}, title = {Renaming in Message Passing Systems with Byzantine Failures}, pages = {16--30}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-3, author = {Hagit Attiya and Eschar Hillel}, title = {Built-in Coloring for Highly-Concurrent Doubly-Linked Lists}, pages = {31--45}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-4, author = {Xavier Defago and Maria Gradinariu and Stephane Messika and Philippe Raipin-Parvedy}, title = {Fault-tolerant and Self-stabilizing Mobile Robots Gathering}, pages = {46--60}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-5, author = {Dana Angluin and James Aspnes and David Eisenstat}, title = {Fast Computation by Population Protocols With a Leader}, pages = {61--75}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-6, author = {Doina Bein and Ajoy K. Datta and Lawrence L. Larmore}, title = {On Self-stabilizing Search Trees}, pages = {76--89}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-7, author = {Yitzhak Birk and Idit Keidar and Liran Liss and Assaf Schuster}, title = {Efficient Dynamic Aggregation}, pages = {90--104}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-8, author = {J{\'{e}}r{\'{e}}mie Chalopin and Shantanu Das and Nicola Santoro}, title = {Groupings and Pairings in Anonymous Networks}, pages = {105--119}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-9, author = {Yoram Moses and Benny Shimony}, title = {A New Proof of the GHS Minimum Spanning Tree Algorithm}, pages = {120--136}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-10, author = {Joseph Y. Halpern and Sabina Petride}, title = {A Knowledge-Based Analysis of Global Function Computation}, pages = {136--150}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-11, author = {Leslie Lamport}, title = {Checking a Multithreaded Algorithm with +CAL}, pages = {151--163}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-12, author = {Lisa Higham and LillAnne Jackson and Jalal Kawash}, title = {Capturing Register and Control Dependence in Memory Consistency Models with Applications to the Itanium Architecture}, pages = {164--178}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-13, author = {Michael F. Spear and Virendra J. Marathe and William N. Scherer III and Michael L. Scott}, title = {Conflict Detection and Validation Strategies for Software Transactional Memory}, pages = {179--193}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-14, author = {David Dice and Ori Shalev and Nir Shavit}, title = {Transactional Locking II}, pages = {194--208}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-15, author = {Yehuda Afek and Eran Shalom}, title = {Less Is More: Consensus Gaps Between Restricted and Unrestricted Objects}, pages = {209--223}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-16, author = {Taisuke Izumi and Toshimitsu Masuzawa}, title = {One-Step Consensus Solvability}, pages = {224--237}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-17, author = {Ran Canetti and Ling Cheung and Dilsun Kirli Kaynar and Moses Liskov and Nancy A. Lynch and Olivier Pereira and Roberto Segala}, title = {Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols}, pages = {238--253}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-18, author = {Alina Oprea and Michael K. Reiter}, title = {On Consistency of Encrypted Files}, pages = {254--268}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-19, author = {Michael B. Greenwald and Sanjeev Khanna and Keshav Kunal and Benjamin C. Pierce and Alan Schmitt}, title = {Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data}, pages = {269--283}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-20, author = {Torvald Riegel and Pascal Felber and Christof Fetzer}, title = {A Lazy Snapshot Algorithm with Eager Validation}, pages = {284--298}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-21, author = {Rida A. Bazzi and Yin Ding}, title = {Bounded Wait-Free f-Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients}, pages = {299--313}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-22, author = {Bogdan S. Chlebus and Dariusz R. Kowalski}, title = {Time and Communication Efficient Consensus for Crash Failures}, pages = {314--328}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-23, author = {Eli Gafni and Sergio Rajsbaum and Maurice Herlihy}, title = {Subconsensus Tasks: Renaming Is Weaker Than Set Agreement}, pages = {329--338}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-24, author = {Arthur Brady and Lenore Cowen}, title = {Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes}, pages = {339--354}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-25, author = {Maleq Khan and Gopal Pandurangan}, title = {A Fast Distributed Approximation Algorithm for Minimum Spanning Trees}, pages = {355--369}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-26, author = {Robert Els{\"{a}}sser}, title = {On Randomized Broadcasting in Power Law Networks}, pages = {370--384}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-27, author = {Andrzej Czygrinow and Michal Hanckowiak}, title = {Distributed Approximation Algorithms in Unit-Disk Graphs}, pages = {385--398}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-28, author = {Rachid Guerraoui and Michal Kapalka and Petr Kouznetsov}, title = {The Weakest Failure Detectors to Boost Obstruction-Freedom}, pages = {399--412}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-29, author = {Alex Brodsky and Faith Ellen and Philipp Woelfel}, title = {Fully-Adaptive Algorithms for Long-Lived Renaming}, pages = {413--427}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-30, author = {Danny Hendler and Shay Kutten}, title = {Constructing Shared Objects That Are Both Robust and High-Throughput}, pages = {428--442}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-31, author = {Amitanand S. Aiyer and Lorenzo Alvisi and Rida A. Bazzi}, title = {Byzantine and Multi-writer K-Quorums}, pages = {443--458}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-32, author = {Michele Flammini and Mordechai Shalom and Shmuel Zaks}, title = {On Minimizing the Number of ADMs in a General Topology Optical Network}, pages = {459--473}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-33, author = {Kishori M. Konwar and Sanguthevar Rajasekaran and Alexander A. Shvartsman}, title = {Robust Network Supercomputing with Malicious Processes}, pages = {474--488}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-34, author = {Cathy H. Xia and James Broberg and Zhen Liu and Li Zhang}, title = {Distributed Resource Allocation in Stream Processing Systems}, pages = {489--504}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-35, author = {Piotr Zielinski}, title = {Low-latency Atomic Broadcast in the presence of contention}, pages = {505--519}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-36, author = {Thomas Locher and Roger Wattenhofer}, title = {Oblivious Gradient Clock Synchronization}, pages = {520--533}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-37, author = {Marcos Kawazoe Aguilera and Svend Fr{\o}lund and Vassos Hadzilacos and Stephanie Lorraine Horn and Sam Toueg}, title = {Abortable and Query-Abortable Objects}, pages = {534--536}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-38, author = {Nicolas C. Nicolaou and Alexander A. Shvartsman}, title = {Fault-Tolerant SemiFast Implementations of Atomic Read/Write Registers}, pages = {537--539}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-39, author = {Bassam Bamieh and Amr El Abbadi}, title = {Convergence Analysis of Scalable Gossip Protocols}, pages = {540--542}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-40, author = {Colette Johnen and St{\'{e}}phane Messika}, title = {Computing Automatically the Stabilization Time Against the Worst and the Best Schedules}, pages = {543--547}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-41, author = {A. Ogale and Vijay K. Garg}, title = {Many Slices Are Better Than One}, pages = {548--550}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-42, author = {Pierre Fraigniaud and Emmanuelle Lebhar and Zvi Lotker}, title = {On Augmented Graph Navigability}, pages = {551--553}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-43, author = {Alysson Neves Bessani and Miguel Correia and Joni da Silva Fraga and Lau Cheuk Lung}, title = {Decoupled Quorum-Based Byzantine-Resilient Coordination in Open Distributed Systems}, pages = {554--556}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-44, author = {Nicolas Schiper and Rodrigo Schmidt and Fernando Pedone}, title = {Optimistic Algorithms for Partial Database Replication}, pages = {557--559}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-45, author = {Frederic Tronel and Spyros Voulgari}, title = {Performance Analysis of Cyclon, an Inexpensive Membership Management for Unstructured P2P Overlays}, pages = {560--562}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-46, author = {Yu Chen and Wei Chen}, title = {Decentralized, Connectivity-Preserving, and Cost-Effective Structured Overlay Maintenance}, pages = {563--565}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-47, author = {Anton Esin and Rostislav Yavorskiy and Nikolay Zemtsov}, title = {Monitoring of Linear Distributed Computations}, pages = {563--565}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-48, author = {Mikel Larrea and Alberto Lafuenten and Joachim Wieland}, title = {Communication-Optimal Implementation of Failure Detector Class diamond-P}, pages = {569--571}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-49, author = {Srinivasan Krishnamurthy and R. Chandrasekaran and Neeraj Mittal and S. Venkatesan}, title = {Synchronous Distributed Algorithms for Node Discovery and Configuration in Multi-channel Cognitive Radio Networks}, pages = {572--574}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2006-50, author = {Maleq Khan and Gopal Pandurangan}, title = {A Fast Distributed Approximation Algorithm for Minimum Spanning Trees}, pages = {355--369}, booktitle = {Distributed algorithms}, editor = {Shlomi Dolev}, year = {2006}, month = {September}, volume = {4167/2006}, ISBN = {3-540-44624-9}, pubisher = {Springer-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @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}, } @Proceedings{disc:2004, title = {Distributed algorithms}, editor = {Rachid Guerraoui}, series = {Lecture Nodes in Computer Science}, volume = {3274/2004}, publisher = {Springer-Verlag GmbH}, year = {2004}, ISBN = {0302-9743}, } @InProceedings{disc:2004-1, author = {Achour Mostefaoui and Sergio Rajsbaum and Michel Raynal}, title = {The Synchronous Condition-Based Consensus Hierarchy}, pages = {1--15}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-2, author = {Taisuke Izumi and Toshimitsu Masuzawa}, title = {Synchronous Condition-based Consensus Adapting to Input-vector Legality}, pages = {16--29}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-3, author = {Eli Gafni}, title = {Group-Solvability}, pages = {30--40}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-4, author = {Roy Friedman and Achour Mostefaoui and Michel Raynal}, title = {On the Respective Power of P and S to Solve One-Shot Agreement Problems}, pages = {41--55}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-5, author = {Gadi Taubenfeld}, title = {The Black-White Bakery Algorithm}, pages = {56--71}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-6, author = {Robert Danek and Vassos Hadzilacos}, title = {Local-Spin Group Mutual Exclusion Algorithms}, pages = {71--85}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-7, author = {Yuh-Jzer Joung}, title = {On Quorum Systems for Group Resources with Bounded Capacity}, pages = {86--101}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-8, author = {Jose Bacelar Almeida and Paulo Sergio Almeida and Carlos Baquero}, title = {Bounded Version Vectors}, pages = {102--116}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-9, author = {Edya Ladan-Mozes and Nir Shavit}, title = {An Optimistic Approach to Lock-Free FIFO Queues}, pages = {117--131}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-10, author = {Matei David}, title = {A Single-Enqueuer Wait-Free Queue Implementation}, pages = {132--143}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-11, author = {Maged Michael}, title = {Practical Lock-Free and Wait-Free LL/SC/VL Implementations Using 64-Bit CAS}, pages = {144--158}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-12, author = {Hagit Attiya and Fabian Kuhn and Mirjam Wattenhofer and Roger Wattenhofer}, title = {Efficient Adaptive Collect using Randomization}, pages = {159--173}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-13, author = {William N.Scherer III and Michael L.Scott}, title = {Nonblocking Concurrent Data Structures with Condition Synchronization}, pages = {174--187}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-14, author = {Danny Hendler and Yossi Lev and Nir Shavit}, title = {Dynamic Memory ABP Work-Stealing}, pages = {188--200}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-15, author = {Laurent Fribourg and Stephane Messika and Claudine Picaronny}, title = {Coupling and Self-Stabilization}, pages = {201--214}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-16, author = {Philippe Duchon and Nicolas Hanusse and Sebastien Tixeuil}, title = {Optimal Self-stabilizing Mutual Exclusion on Synchronous Rings}, pages = {215--229}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-17, author = {Shlomi Dolev and Seth Gilbert and Nancy Lynch and Elad Schiller and Alex Shvartsman and Jennifer Welch}, title = {Virtual Mobile Nodes for Mobile \Adhoc Networks}, pages = {230--244}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-18, author = {Costas Busch and Malik Magdon-Ismail and Fikret Sivrikaya and Bulent Yener}, title = {Contention-Free MAC protocols for Wireless Sensor Networks}, pages = {245--259}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-19, author = {James Aspnes and Faith Fich and Eric Ruppert}, title = {Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems}, pages = {260--274}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-20, author = {Yitzhak Birk and Liran Liss and Assaf Schuster and Ran Wolff}, title = {A Local Algorithm for Ad Hoc Majority Voting via Charge Fusion}, pages = {275--289}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-21, author = {Neeraj Mittal and Sathya Peri and Subbarayan Venkatesan}, title = {Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies}, pages = {290--304}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-22, author = {Ittai Abraham and Cyril Gavoille and Dahlia Malkhi}, title = {Routing with Improved Communication-Space Trade-Off}, pages = {305--319}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-23, author = {Xiaozhou Li and Jayadev Misra and Greg Plaxton}, title = {Active and Concurrent Topology Maintenance}, pages = {320--334}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-24, author = {Mirjam Wattenhofer and Roger Wattenhofer}, title = {Distributed Weighted Matching}, pages = {335--348}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-25, author = {Lei Guo and Song Jiang, Li Xiao and Xiaodong Zhang}, title = {Fast and Low Cost P2P Searching by Exploiting Localities in Peer Community and Individual Peers}, pages = {349--364}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-26, author = {Yon Dourisboure}, title = {Compact Routing Schemes for Tree-Length {\$}\delta{\$} Graphs and for {\$}k{\$}-chordal Graphs}, pages = {365--378}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-27, author = {Ueli Maurer}, title = { Torwards a Theory of Consistency Primitives}, pages = {379--389}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-28, author = {Uri Nadav and Moni Naor}, title = {Fault-Tolerant Storage in a Dynamic Environment}, pages = {390--404}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-29, author = {Rida Bazzi and Yin Ding}, title = {Non-Skipping Timestamps for Byzantine Data Storage Systems}, pages = {405--419}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-30, author = {Rida Bazzi and Goran Konjevod}, title = {Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty}, pages = {420--434}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-31, author = {Ehab Elmallah and Mohamed Gouda and Eunjin Jung}, title = {Optimal Dispersal of Certificate Chains}, pages = {435--449}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-32, author = {Pandurangan Chandrashekaran and Ravikant D V S and Srinathan Kannan and Srikanth Venkateswaran and Muthuramakrishnan Venkitasubramaniam}, title = {On Byzantine Agreement over (2,3)-Uniform Hypergraphs}, pages = {450--}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-33, author = {Gero Muehl and Andreas Tanner}, title = {A Formalisation of Message-Complete Publish/Subscribe Systems}, pages = {--}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-34, author = {Karthikeyan Bhargavan and Marc Shapiro}, title = {A formalism for consistency and partial replication}, pages = {--}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-35, author = {Sameh Elnikety and Fernando Pedone and Willy Zwaenepoel}, title = {Generalized Snapshot Isolation and a Prefix-Consistent Implementation}, pages = {--}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-36, author = {Islene C. Garcia and LuizE. Buzato and Fernando Pedone and Rodrigo Schmidt}, title = {Optimal Asynchronous Garbage Collection for Checkpointing Protocols with Rollback-Dependency Trackability}, pages = {--}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-37, author = {Hagit Attiya and Idan Zach}, title = {Efficient Fully Adaptive Snapshots using Incremental Calculation}, pages = {--}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-38, author = {Marcos Aguilera and Carole Delporte-Gallet and Hugues Fauconnier and Sam Toueg}, title = {Consensus with Byzantine Failures and Little System Synchrony}, pages = {--}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-39, author = {Hagit Attiya and Fabian Kuhn and Mirjam Wattenhofer and Roger Wattenhofer}, title = {Efficient Adaptive Collect using Randomization}, pages = {159--173}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @InProceedings{disc:2004-40, author = {Laurent Fribourg and Stephane Messika and Claudine Picaronny}, title = {Coupling and Self-Stabilization}, pages = {201--214}, booktitle = {Distributed algorithms}, editor = {Rachid Guerraoui}, year = {2004}, month = {Oct}, volume = {3274/2004}, ISBN = {0302-9743}, pubisher = {Springer-Verlag GmbH}, series = {Lecture Nodes in Computer Science}, } @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}, } @Proceedings{disc:2002, title = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, series = {Lecture Notes in Computer Science}, volume = {2508/2002}, publisher = {Splinger-Verlag Heidelberg}, year = {2002}, ISBN = {}, } @InProceedings{disc:2002-1, author = {Ziv Bar-Joseph and Idit Keidar and Nancy Lynch }, title = {Early-Delivery Dynamic Atomic Broadcast }, pages = {1--16}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-2, author = {Shafi Goldwasser and Yehuda Lindell }, title = {Secure Computation Without Agreement }, pages = {17--32}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-3, author = {D. Agrawal and A. El Abbadi and A. Mostefaoui and M. Raynal and M. Roy}, title = {The Lord of the Rings: Efficient Maintenance of Views at Data Warehouses}, pages = {33--47}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-4, author = {Achour Mostefaoui and Sergio Rajsbaum and Michel Raynal and Matthieu Roy}, title = {Condition-Based Protocols for Set Agreement Problems }, pages = {48--62}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-5, author = {Roy Friedman and Achour Mostefaoui and Sergio Rajsbaum and Michel Raynal}, title = {Distributed Agreement and its Relation with Error-Correcting Codes}, pages = {63--87}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-6, author = {D. Koukopoulos and M. Mavronikolas and S. Nikoletseas and P. Spirakis }, title = {On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols }, pages = {88--102}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-7, author = {Kleoni Ioannidou }, title = {Transformations of Self-Stabilizing Algorithms }, pages = {103--117}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-8, author = {Paul Vitanyi }, title = {Simple Wait-free Multireader Registers }, pages = {118--132}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-9, author = {Partha Dutta and Svend Frolund and Rachid Guerraoui and Bastian Pochon}, title = {An Efficient Universal Construction for Message-Passing Systems }, pages = {133--147}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-10, author = {Svend Frolund and Fernando Pedone }, title = {Ruminations on Domain-Based Reliable Broadcast }, pages = {148--162}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-11, author = {Gideon Stupp }, title = {Stateless Termination Detection }, pages = {163--172}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-12, author = {Nancy Lynch and Alex Shvartsman }, title = {RAMBO: A Reconfigurable Atomic Memory Service }, pages = {173--190}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-13, author = {Tal Anker and Danny Dolev and Ilya Shnayderman}, title = {Ad Hoc Membership for Scalable Applications }, pages = {191--205}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-14, author = {Yongqiang Huang and Hector Garcia-Molina }, title = {Assignment-based Partitioning in a Condition Monitoring System }, pages = {206--221}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-15, author = {Michael Merritt and Omer Reingold and Gadi Taubenfeld and Rebecca Wright }, title = {Tight bounds for shared memory systems accessed by Byzantine processes}, pages = {222--236}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-16, author = {C. Delporte and H. Fauconnier and Rachid Guerraoui }, title = {Failure Detection Lower Bounds on Registers and Consensus}, pages = {237--251}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-17, author = {Yon Dourisboure and Cyril Gavoille }, title = {Improved Compact Routing Scheme for Chordal Graphs }, pages = {252--264}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-18, author = {Timothy L Harris and Keir Fraser and Ian A Pratt }, title = {A practical multi-word compare-and-swap operation }, pages = {265--279}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-19, author = {Felix C. Gartner and Stefan Pleisch }, title = {Failure detection sequencers: necessary and sufficient information about failures to solve predicate detection }, pages = {280--294}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-20, author = {Bogdan Chlebus and Leszek Gasieniec and Dariusz Kowalski and Alex A. Shvartsman }, title = {Bounding Work and Communication in Robust Cooperative Computation}, pages = {295--310}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-21, author = {Jean-Philippe Martin and Lorenzo Alvisi and Michael Dahlin }, title = {Minimal Byzantine Storage }, pages = {311--325}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-22, author = {Hagit Attiya and Zvi Avidor }, title = {Wait-Free n-set Consensus when Inputs are Restricted}, pages = {326--338}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-23, author = {Maurice Herlihy and Victor Luchangco and Mark Moir }, title = {The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures }, pages = {339--353}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-24, author = {Marcos Aguilera and Gerard Le Lann and Sam Toueg }, title = {On the impact of fast failure detectors on real-time fault-tolerant systems }, pages = {354--369}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-25, author = {Jerry James and Jed Miadowicz and Sivaprasath Murugeshan and Mangal Singh}, title = {Shifting Arguments Without Global Time }, pages = {--}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-26, author = {Philipp Blum and Lothar Thiele }, title = {Clock Synchronization using Packet Streams }, pages = {--}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-27, author = {Antonio Fern{\'{a}}ndez and Mikel Larrea and Sergio Ar{\'{e}}valo }, title = {A Sufficient Condition to Transform <>S into <>P in Asynchronous }, pages = {--}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-28, author = {Yi-Min Wang and Lili Qiu and Dimitris Achlioptas and Gautam Das and Paul Larson and Helen J. Wang }, title = {Subscription Partitioning and Routing in Content-based Publish/Subscribe Networks}, pages = {--}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2002-29, author = {Yongqiang Huang and Hector Garcia-Molina }, title = {Assignment-based Partitioning in a Condition Monitoring System}, pages = {--}, booktitle = {Distributed algorithms}, editor = {D.Malkhi(Ed.)}, year = {2002}, month = {Oct}, volume = {2508/2002}, ISBN = {}, pubisher = {Splinger-Verlag Heidelberg}, series = {Lecture Notes in Computer Science}, } @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}, } @Proceedings{disc:2000, title = {Distributed algorithms}, editor = {Maurice Herlihy}, series = {Lecture Notes in Computer Science}, volume = {1914}, publisher = {Springer}, year = {2000}, ISBN = {3-540-41143-7}, } @InProceedings{disc:2000-1, author = {Faith E. Fich and Eric Ruppert}, title = {Lower Bounds in Distributed Computing}, pages = {1--28}, booktitle = {Distributed algorithms}, editor = {Maurice Herlihy}, year = {2000}, month = {Oct}, volume = {1914}, ISBN = {3-540-41143-7}, pubisher = {Springer}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2000-2, author = {James H. Anderson and Yong-Jik Kim}, title = {Adaptive Mutual Exclusion with Local Spinning}, pages = {29--43}, booktitle = {Distributed algorithms}, editor = {Maurice Herlihy}, year = {2000}, month = {Oct}, volume = {1914}, ISBN = {3-540-41143-7}, pubisher = {Springer}, series = {Lecture Notes in Computer Science}, } @InProceedings{disc:2000-3, author = {Lisa Higham and Jalal Kawash}, title = {Bounds for Mutual Exclusion with only Processor Consistency}, pages = {44--58}, booktitle = {Distributed algorithms}