18. PODC 1999: Atlanta, Georgia, USA

• Rafail Ostrovsky, Boaz Patt-Shamir:
  Optimal and Efficient Clock Synchronization Under Drifting Clocks. 3-12
  
• Eli Gafni, Michael Mitzenmacher:
  Analysis of Timing-Based Mutual Exclusion with Random Times. 13-21
  
• Patrick Keane, Mark Moir:
  A Simple Local-Spin Group Mutual Exclusion Algorithm. 23-32
  
• Roberto Baldoni, Jean-Michel Hélary, Michel Raynal:
  Rollback-Dependency Trackability: Visible Characterizations. 33-42
  
• Chengzheng Sun, Rok Sosic:
  Optimal Locking Integrated with Operational Transformation in Distributed Real-Time Group Editors. 43-52
  
• Marcos Kawazoe Aguilera, Robert E. Strom, Daniel C. Sturman, Mark Astley, Tushar Deepak Chandra:
  Matching Events in a Content-Based Subscription System. 53-61
  
• Paul C. Attie:
  Liveness-Preserving Simulation Relations. 63-72
  
• Joseph Y. Halpern, Aleta Ricciardi:
  A Knowledge-Theoretic Analysis of Uniform Distributed Coordination and Failure Detectors. 73-82
  
• Markus Jakobsson:
  Flash Mixing. 83-89
  
• Yehuda Afek, Hagit Attiya, Arie Fouren, Gideon Stupp, Dan Touitou:
  Long-Lived Renaming Made Adaptive. 91-103
  
• Yehuda Afek, Michael Merritt:
  Fast, Wait-Free (2k)-Renaming. 105-112
  
• Nir Shavit, Asaph Zemach:
  Scalable Concurrent Priority Queue Algorithms. 113-122
  
• James H. Anderson, Mark Moir:
  Wait-Free Synchronization in Multiprogrammed Systems: Integrating Priority-Based and Quantum-Based Scheduling. 123-132
  
• Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld:
  Sequentially Consistent versus Linearizable Counting Networks. 133-142
  
• Peter J. Keleher:
  Decentalized Replicated-Object Protocols. 143-151
  
• Peter C. J. Graham, Yahong Sui:
  LOTEC: A Simple DSM Consistency Protocol for Nested Object Transactions. 153-162
  
• Francisco J. Torres-Rojas, Mustaque Ahamad, Michel Raynal:
  Timed Consistency for Shared Distributed Objects. 163-172
  
• Naoshi Sakamoto:
  Comparison of Initial Conditions for Distributed Algorithms on Anonymous Networks. 173-179
  
• Paolo Boldi, Sebastiano Vigna:
  Computing Anonymously with Arbitrary Knowledge. 181-188
  
• Paola Flocchini, Alessandro Roncato, Nicola Santoro:
  Backward Consistency and Sense of Direction in Advanced Distributed Systems. 189-198
  
• Joffroy Beauquier, Maria Gradinariu, Colette Johnen:
  Memory Space Requirements for Self-Stabilizing Leader Election Protocols. 199-207
  
• Joffroy Beauquier, Christophe Genolini, Shay Kutten:
  Optimal Reactive k-Stabilization: The Case of Mutual Exclusion. 209-218
  
• Michal Hanckowiak, Michal Karonski, Alessandro Panconesi:
  A Faster Distributed Algorithm for Computing Maximal Matchings Deterministically. 219-228
  
• Mor Harchol-Balter, Frank Thomson Leighton, Daniel Lewin:
  Resource Discovery in Distributed Networks. 229-237
  
• Micah Adler, Faith E. Fich:
  The Complexity of End-to-End Communication in Memoryless Networks. 239-248
  
• Dimitris Michailidis:
  Fast Set Agreement in the Presence of Timing Uncertainty. 249-256
  
• Roberto De Prisco, Dahlia Malkhi, Michael K. Reiter:
  On k-Set Consensus Problems in Asynchronous Systems. 257-265
  
• Jusung Baek, R. S. Ramakrishna, Donk-Ik Lee:
  A Design of a Protocol for Detecting an Agent Clone in Mobile Agent Systems and its Correctness Proof. 269
  
• Guohong Cao, Mukesh Singhal:
  Mutable Check-Points: A New Checkpointing Approach for Mobile Computing Systems. 270
  
• Guohong Cao, Mukesh Singhal, Naphtali Rishe:
  Delay-Optimal Quorum-Based Mutual Exclusion for Distributed Systems. 271
  
• Marco Cremonini, Andrea Omicini, Franco Zambonelli:
  The HiMAT Model for Mobile Agent Applications. 272
  
• Shlomi Dolev, Ephraim Korach, Dmitry Yukelson:
  The Sound of Silence - Guessing Games for Saving Energy in Mobile Environment. 273
  
• Kostas P. Hatzis, George P. Pentaris, Paul G. Spirakis, Vasilis T. Tampakas, Richard B. Tan:
  Fundamental Distributed Protocols in Mobile Networks. 274
  
• Jerry James, Ambuj K. Singh:
  External Logging on a Logical Ring. 275
  
• Mehmet Hakan Karaata, Fawaz S. Al-Anzi:
  A Dynamic Self-Stabilizing Algorithm for Finding Strongly Connected Components. 276
  
• Ajay D. Kshemkalyani, Mukesh Singhal:
  Two Classes of Communication Patterns. 277
  
• Michael J. Lewis, Andrew S. Grimshaw:
  Dynamically Configurable Distributed Objects. 278
  
• Marios Mavronicolas, Paul G. Spirakis:
  Optimal, Distributed Decision-Making: The Case of no Communication. 279
  
• Cortés E. Pérez, Alonso G. Román, Barradas H. Ruíz:
  Using CSP to Derive a Sequentially Consistent DSM System. 280
  
• Gary L. Peterson:
  Properties of a Family of Booster Types. 281
  
• Avner Porat:
  Maintenance of a Spanning Tree in Dynamic Networks. 282
  
• Scott D. Stoller:
  Lower and Upper Bounds for Attacks on Authentication Protocols. 283
  
• Camelia Zlatea, Tzilla Elrad:
  A Design Methodology for Mobile Distributed Applications Based on UNITY Formalism and Communication-Closed Layering. 284
  

Last update Wed Feb 15 05:15:29 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page