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