Abstract is missing.
- Fundamental Challenges in Mobile ComputingMahadev Satyanarayanan. 1-7
- Atomicity in Electronic CommerceJ. D. Tygar. 8-26
- Memory Requirements for Silent Stabilization (Extended Abstract)Shlomi Dolev, Mohamed G. Gouda, Marco Schneider. 27-34
- Self-Stabilization by Window WashingAdam M. Costello, George Varghese. 35-44
- Fault-Containing Self-Stabilizing AlgorithmsSukumar Ghosh, Arobinda Gupta, Ted Herman, Sriram V. Pemmaraju. 45-54
- About State Recording in Asynchronous Computations (Abstract)Roberto Baldoni, Jean-Michel Hélary, Michel Raynal. 55
- Minimizing Access Costs in Replicated Distributed Syste (Abstract)Michael Goldweber, Donald B. Johnson. 56
- On the Borowsky-Gafni Simulation Algorithm (Abstract)Nancy A. Lynch, Sergio Rajsbaum. 57
- Trade-Offs in Implementing Optimal Message Logging ProtocolsLorenzo Alvisi, Keith Marzullo. 58-67
- Efficient Message Ordering in Dynamic NetworksIdit Keidar, Danny Dolev. 68-76
- An Efficient Recovery-Based Spin Lock Protocol for Preemptive Shared Memory MultiprocessorsInjong Rhee, Chi-Yung Lee. 77-86
- An Optimal Algorithm for Generalized Causal Message Ordering (Abstract)Ajay D. Kshemkalyani, Mukesh Singhal. 87
- Characterization of Message Ordering Specifications and Protocols (Abstract)Venkatesh V. Murty, Vijay K. Garg. 88
- Efficient Delta-Causal Broadcasting of Multimedia Applications (Abstract)Roberto Baldoni, Ravi Prakash, Michel Raynal, Mukesh Singhal. 89
- Comparing Primary-Backup and State Machines for Crash Failures (Abstract)Jeremy B. Sussman, Keith Marzullo. 90
- Refining Knowledge Oriented Actions to Layered ImplementationsWil Janssen. 91-100
- Automated Logical Verification Based on Trace AbstractionsNils Klarlund, Mogens Nielsen, Kim Sunesen. 101-110
- Synthesis of Concurrent Systems for an Atomic Read / Atomic Write Model of Computation (Extended Abstract)Paul C. Attie, E. Allen Emerson. 111-120
- Synthesis of Distributed Control Systems (Abstract)Evelyn Tumlin Pierce. 121
- I/O Automata Based Verification of Finite State Distributed Systems: Complexity Issues (Abstract)Sandeep K. Shukla, Harry B. Hunt III, Daniel J. Rosenkrantz, S. S. Ravi, Richard Edwin Stearns. 122
- Using Events Structures for the Efficient Analysis of State Graphs (Abstract)Dominique Ambroise, Brigitte Rozoy. 123
- Testing Concurrent Data Structures (Abstract)John L. Bruno, Phillip B. Gibbons, Steven Phillips. 124
- Memory Requirements for Routing in Distributed Networks (Extended Abstract)Cyril Gavoille, Stephane Perennes. 125-133
- Optimal Routing TablesHarry Buhrman, Jaap-Henk Hoepman, Paul M. B. Vitányi. 134-142
- Spreading Rumors Rapidly Despite and AdversaryJames Aspnes, William Hurwood. 143-151
- Fast, Long-Lived Renaming Improved and Simplified (Abstract)Mark Moir, Juan A. Garay. 152
- The Complexity of Data Mining on the Web (Abstract)Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg. 153
- Efficient Token-Based Control in Rings (Abstract)Esteban Feuerstein, Stefano Leonardi, Alberto Marchetti-Spaccamela, Nicola Santoro. 154
- Efficient Traffic Laws for Mobile Robots - Work in Progress (Avstract)Sonne Preminger, Eli Upfal. 155
- Polylog Randomized Wait-Free ConsensusTushar Deepak Chandra. 166-175
- Asynchrony versus Bulk-Synchrony in QRQW PRAM model (Abstract)Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran. 176
- Constructing a Reliable Test&Set Bit (Abstract)Frank A. Stomp, Gadi Taubenfeld. 177
- Randomized Adaptive Video on Demand (Abstract)Christos Bouras, Vaggelis Kapoulas, Grammati E. Pantziou, Paul G. Spirakis. 179
- Distributed Algorithms for Sparse k-Connectivity Certificates (Abstract)Esther Jennings, Lenka Motyckova. 180
- Distributed Pseudo-Random Bit Generators - A New Way to Speed-Up Shared Coin TossingMihir Bellare, Juan A. Garay, Tal Rabin. 191-200
- A Randomized Byzantine Agreement Protocol with Constant Expected Time and Guaranteed Termination in Optimal (Deterministic) TimeArkady Zamsky. 201-208
- Early-Stopping Terminating Reliable Broadcast Protocol for General Omission Failures (Abstract)Marcel-Catalin Rosu. 209
- Baked Potatoes: Deadlock Prevention Via Scheduling (Abstract)Shlomi Dolev, Evangelos Kranakis, Danny Krizanc. 210
- Witness-Based Cryptographic Program Checking and Applications (an Announcement)Yair Frankel, Peter Gemmell, Moti Yung. 211
- On the Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (Brief Announcement)Yehuda Afek, Yishay Mansour, Zvi Ostfeld. 212
- The Power of Multi-objects (Extended Abstract)Yehuda Afek, Michael Merritt, Gadi Taubenfeld. 213-222
- Universal Operations: Unary versus Binary (Extended Abstract)Hagit Attiya, Eyal Dagan. 223-232
- Real-Time Object Sharing with Minimal System Support (Extended Abstract)Srikanth Ramamurthy, Mark Moir, James H. Anderson. 233-242
- What Critical Algebraic Property Allows Operations of Concurrent Abstract Data Types to be Fast? (Brief Announement)Martha J. Kosa. 244
- The Role of Data-Race-Free Programs in Recoverable DSM (Abstract)Soma Chaudhuri, Sundar Kanthadai, Jennifer L. Welch. 245
- Crash Failures vs. Crash + Link Failures (Abstract)Anindya Basu, Bernadette Charron-Bost, Sam Toueg. 246
- Crash Failures can Drive Protocols to Arbitrary StatesMahesh Jayaram, George Varghese. 247-256
- Time and Space Lower Bounds for Non-Blocking Implementations (Preliminary Version)Prasad Jayanti, King Tan, Sam Toueg. 257-266
- Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue AlgorithmsMaged M. Michael, Michael L. Scott. 267-275
- A Proof of a Theorem in Algebraic Topology by a Distributed Algorithm (Abstract)Eli Gafni. 276
- Wait-Free Solvability Via Combinatorial Topology (Abstract)Marios Mavronicolas. 277
- Simulation as an Iterated Task (Abstract)Eli Gafni. 278
- On the Decidability of Distributed Decision Tasks (Brief Announcement)Maurice Herlihy, Sergio Rajsbaum. 279
- Counting Networks are Practically LinearizableNancy A. Lynch, Nir Shavit, Alexander A. Shvartsman, Dan Touitou. 280-289
- How to be an Efficient Snoop, or the Probe Complexity of Quorum Systems (Extended Abstract)David Peleg, Avishai Wool. 290-299
- Eventually-Serializable Data ServicesAlan Fekete, David Gupta, Victor Luchangco, Nancy A. Lynch, Alexander A. Shvartsman. 300-309
- From Serializable to Causal Transactions (Abstract)Michel Raynal, Gérard Thia-Kime, Mustaque Ahamad. 310
- The Strength of Counting Networks (Abstract)Costas Busch, Marios Mavronicolas. 311
- Tight Bounds on the Cumulative Profit of Distributed Voters (Abstract)Peter Auer, Pasquale Caianiello, Nicolò Cesa-Bianchi. 312
- Fail-Awareness in Timed Asynchronous SystemsChristof Fetzer, Flaviu Cristian. 314-321
- On the Impossibility of Group MembershipTushar Deepak Chandra, Vassos Hadzilacos, Sam Toueg. 322-330
- A New Look at Membership Services (Extended Abstract)Gil Neiger. 331-340
- Collective Consistency (Work in Progress, Abstract)Cynthia Dwork, Ching-Tien Ho, H. Raymond Strong. 341
- A Framework for Partitionable Membership Service (Abstract)Danny Dolev, Dalia Malki, H. Raymond Strong. 343
- Evaluating Quorum Systems Over the Internet (Abstract)Yair Amir, Avishai Wool. 344