Abstract is missing.
- Multi-Party Computations: Past and PresentShafi Goldwasser. 1-6
- Verification Engineering: A Future Profession (A. M. Turing Award Lecture)Amir Pnueli. 7
- Internet Support for Wireless and Mobile NetworkingDavid B. Johnson. 9-10
- Principles and Patterns of High-Performance and Real-Time Distributed Object ComputingDouglas C. Schmidt. 11
- Maintaining Authenticated Communication in the Presence of Break-insRan Canetti, Shai Halevi, Amir Herzberg. 15-24
- Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation (Extended Abstract)Martin Hirt, Ueli M. Maurer. 25-34
- Randomness vs. Fault-ToleranceRan Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén. 35-44
- Relative Liveness and Behavior Abstraction (Extended Abstract)Ulrich Nitsche, Pierre Wolper. 45-52
- Specifying and Using a Partitionable Group Communication ServiceAlan Fekete, Nancy A. Lynch, Alexander A. Shvartsman. 53-62
- Dynamic Voting for Consistent Primary ComponentsEsti Yeger Lotem, Idit Keidar, Danny Dolev. 63-71
- Lazy Consistency Using Loosely Synchronized ClocksAtul Adya, Barbara Liskov. 73-82
- How Useful Is Old Information? (Extended Abstract)Michael Mitzenmacher. 83-91
- Determining Consensus NumbersEric Ruppert. 93-99
- On the Power of Shared Object Types to Implement One-Resilient ConsensusWai-Kau Lo, Vassos Hadzilacos. 101-110
- Disentangling Multi-Object Operations (Extended Abstract)Yehuda Afek, Michael Merritt, Gadi Taubenfeld, Dan Touitou. 111-120
- A Wait-Free Sorting AlgorithmNir Shavit, Eli Upfal, Asaph Zemach. 121-128
- On the Potential of FEC Algorithms in Building Fault-Tolerant Distributed Applications to Support High QoS Video CommunicationsBernd E. Wolfinger. 129-138
- Efficiency of Oblivious Versus Non-Oblivious Schedules for Optimistic, Rate-Based Flow Control (Extended Abstract)Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis. 139-148
- Time-Adaptive Self StabilizationShay Kutten, Boaz Patt-Shamir. 149-158
- An Inherent Bottleneck in Distributed CountingRoger Wattenhofer, Peter Widmayer. 159-167
- The Complexity of Crash FailuresMahesh Jayaram, George Varghese. 179-188
- A Simple Algorithmically Reasoned Characterization of Wait-Free Computations (Extended Abstract)Elizabeth Borowsky, Eli Gafni. 189-198
- Towards a Topological Characterization of Asynchronous Complexity (Preliminary Version)Gunnar Hoest, Nir Shavit. 199-208
- Efficient Asynchronous Consensus with the Weak Adversary SchedulerYonatan Aumann. 209-218
- Practical Implementations of Non-Blocking Synchronization PrimitivesMark Moir. 219-228
- Implementing Wait-Free Objects on Priority-Based SystemsJames H. Anderson, Srikanth Ramamurthy, Rohit Jain. 229-238 [doi]
- Collecting Distributed Garbage Cycles by Back TracingUmesh Maheshwari, Barbara Liskov. 239-248
- The Load and Availability of Byzantine Quorum SystemsDahlia Malkhi, Michael K. Reiter, Avishai Wool. 249-257
- Synchronous Byzantine Quorum SystemsRida A. Bazzi. 259-266
- Probabilistic Quorum SystemsDahlia Malkhi, Michael K. Reiter, Rebecca N. Wright. 267-273
- Computing Vector Functions on Anonymous NetworksPaolo Boldi, Sebastiano Vigna. 277
- A Technique for Partial Broadcasting in Networks (Abstract)Gurdip Singh. 278
- The Consensus Hierarchy Is Not RobustEric Schenk. 279
- Space-Optimal Wait-Free QueuesTed Herman, Valeriu Damian-Iordache. 280
- Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delays and Throughput FairnessSubhash Suri, George Varghese, Girish P. Chandranmenon. 281
- Compiler Support for Decoupled Virtual Shared Memory SystemsHe Zhu, Ian Watson. 282
- Using Broadcast Primitives in Replicated Databases (Abstract)Ioana Stanoi, Divyakant Agrawal, Amr El Abbadi. 283
- Competing against SpecialistsPiotr Berman, Juan A. Garay. 284
- Fault Tolerance Bounds for Memory ConsistencyJerry James, Ambuj K. Singh. 285
- Failure Detectors in Omission Failure EnvironmentsDanny Dolev, Roy Friedman, Idit Keidar, Dahlia Malkhi. 286
- Local Stabilizer (Brief Announcement)Yehuda Afek, Shlomi Dolev. 287
- Memory Efficient, Self-Stabilizing Algorithm to Construct BFS Spanning TreesColette Johnen. 288
- Trade-offs in Fault-Containing Self-StabilizationSukumar Ghosh, Sriram V. Pemmaraju. 289
- On FTSS-Solvable Distributed ProblemsJoffroy Beauquier, Synnöve Kekkonen-Moneta. 290
- Dynamic Hashing + Quorum = Efficient Location Management for Mobile Computing SystemsRavi Prakash, Mukesh Singhal. 291
- An Algorithm for Message Delivery to Mobile UnitsAmy L. Murphy, Gruia-Catalin Roman, George Varghese. 292
- Dynamic Wavelength Allocation in Optical NetworksOrnan Ori Gerstel, Galen H. Sasaki, Shay Kutten, Rajiv Ramaswami. 293
- On the Relation between Bit Delay for Slot Reuse and the Number of Address Bits in the Dual Bus Configuration (Brief Announcement)Oran Sharon. 294
- Automatic Verification of Liveness Properties of Randomized SystemsChristel Baier, Marta Z. Kwiatkowska. 295