19. PODC 2000: Portland, Oregon, USA

• Leslie Lamport:
  Distributed algorithms in TLA (abstract). 3
  
• Michael Ogg:
  A middleware overview: goals, research issues, and coded examples (abstract). 4
  
• Craig Partridge:
  Data communications vs. distributed computing (abstract). 5
  
• Mark D. Hill:
  How computer architecture trends may affect future distributed systems: from infiniBand clusters to inter-processor speculation (abstract). 6
  
• Eric A. Brewer:
  Towards robust distributed systems (abstract). 7
  
• Pierre Fraigniaud, Cyril Gavoille, Bernard Mans:
  Interval routing schemes allow broadcasting with linear message-complexity (extended abstract). 11-20
  
• Yishay Mansour, Boaz Patt-Shamir, Ofer Lapid:
  Optimal smoothing schedules for real-time streams (extended abstract). 21-29
  
• Zvi Lotker, Boaz Patt-Shamir:
  Average-case analysis of greedy packet scheduling (extended astract). 31-40
  
• Yehuda Hassin, David Peleg:
  Sparse communication networks and efficient routing in the plane (extended abstract). 41-50
  
• Lenore Cowen, Christopher G. Wagner:
  Compact roundtrip routing in directed networks (extended abstract). 51-59
  
• Mark Moir:
  Laziness pays! using lazy synchronization mechanisms to improve non-blocking constructions. 61-70
  
• Yehuda Afek, Gideon Stupp, Dan Touitou:
  Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract). 71-80
  
• Yehuda Afek, Pazi Boxer, Dan Touitou:
  Bounds on the shared memory requirements for long-lived adaptive objects (extended abstract). 81-89
  
• Hagit Attiya, Vita Bortnikov:
  Adaptive and efficient mutual exclusion (extended abstract). 91-100
  
• Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes:
  Assigning labels in unknown anonymous networks (extended abstract). 101-111
  
• Leszek Gasieniec, Andrzej Pelc, David Peleg:
  The wakeup problem in synchronous broadcast systems (extended abstract). 113-121
  
• Christian Cachin, Klaus Kursawe, Victor Shoup:
  Random oracles in constantipole: practical asynchronous Byzantine agreement using cryptography (extended abstract). 123-132
  
• Boaz Barak, Shai Halevi, Amir Herzberg, Dalit Naor:
  Clock synchronization with faults and recoveries (extended abstract). 133-142
  
• Achour Mostéfaoui, Michel Raynal:
  k-set agreement with limited accuracy failure detectors. 143-152
  
• Rishiyur S. Nikhil, Umakishore Ramachandran:
  Garbage collection of timestamped data in Stampede. 153-161
  
• Antonio Fernández, Ernesto Jiménez, Vicent Cholvi:
  On the interconnection of causal memory systems. 163-170
  
• Jennifer E. Walter, Jennifer L. Welch, Nancy M. Amato:
  Distributed reconfigurtion of metamorphic robot chains. 171-180
  
• Sumeer Bhola, Mustaque Ahamad:
  1/k phase stamping for continuous shared data (extended abstract). 181-190
  
• Rainer Ruggaber, Jochen Seitz, Michael Knapp:
  p² - a generic proxy platform for wireless access and mobility in CORBA. 191-198
  
• E-Kai Shen, Shikharesh Majumdar, Istabrak Abdul-Fatah:
  High performance adaptive middleware for CORBA-based systems. 199-207
  
• Marcos Kawazoe Aguilera, Robert E. Strom:
  Efficient atomic broadcast using deterministic merge. 209-218
  
• Antonio Carzaniga, David S. Rosenblum, Alexander L. Wolf:
  Achieving scalability and expressiveness in an Internet-scale event notification service. 219-227
  
• Svend Frølund, Rachid Guerraoui:
  X-ability: a theory of replication. 229-237
  
• Neeraj Mittal, Vijay K. Garg:
  Debugging distributed programs using controlled re-execution. 239-248
  
• Laurent Rosaz:
  Self-stabilizing token circulation on asynchronous uniform unidirectional rings. 249-258
  
• Gregory F. Johnson, Ambuj K. Singh:
  Stable and fault-tolerant object allocation. 259-268
  
• Anish Arora, Sandeep S. Kulkarni, Murat Demirbas:
  Resettable vector clocks. 269-278
  
• Kazuhisa Makino, Tiko Kameda:
  Efficient generation of all regular non-dominated coteries. 279-288
  
• Rachid Guerraoui:
  Indulgent algorithms (preliminary version). 289-297
  
• James Aspnes:
  Fast deterministic consensus in a noisy environment. 299-308
  
• Shlomi Dolev, Sergio Rajsbaum:
  Stability of long-lived consensus (extended abstract). 309-318
  
• Rajeev Joshi, Jayadev Misra:
  Toward a theory of maximally concurrent programs (shortened version). 319-328
  
• Oliver E. Theel:
  A verification technique for self-stabilizing algorithms based on Ljapunov's "Second Method" (brief announcement). 331
  
• Fabíola Greve, Michel Hurfin, Raimundo A. Macêdo, Michel Raynal:
  Time and message-efficient S-based consensus (brief announcement). 332
  
• Augusto Ciuffoletti:
  Self-stabilization - beyond the token ring circulation (brief announcement). 333
  
• Mikel Larrea, Antonio Fernández, Sergio Arévalo:
  Optimal implementation of the weakest failure detector for solving consensus (brief announcement). 334
  
• Jalal Kawash, Lisa Higham:
  Memory consistency and process coordination for SPARC v8 multiprocessors (brief announcement). 335
  
• Shay Kutten, David Peleg:
  Deterministic distributed resource discovery (brief announcement). 336
  
• Kazuo Iwama, Akinori Kawachi:
  Compact routing with stretch factor of less than three (brief announcement). 337
  
• Hyunyoung Lee, Jennifer L. Welch:
  Specification, implementation and application of randomized regular registers (brief announcement). 338
  
• Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman:
  Distributed cooperation in the absence of communication (brief announcement). 339
  
• Tiko Kameda, Feng Xiao, Malika Mahoui-Guerni:
  Average probe complexity of non-dominated coteries (brief announcement). 340
  
• Xiaoming Liu, Robbert van Renesse:
  Fast protocol transition in a distributed environment (brief announcement). 341