1 option
Distributed Computing : 16th International Conference, DISC 2002. Toulouse, France, October 28-30, 2002, Proceedings / edited by Dahlia Malkhi.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 2508.
- Lecture Notes in Computer Science, 0302-9743 ; 2508
- Language:
- English
- Subjects (All):
- Computer networks.
- Computers.
- Computer programming.
- Operating systems (Computers).
- Algorithms.
- Computer Communication Networks.
- Theory of Computation.
- Programming Techniques.
- Operating Systems.
- Computation by Abstract Devices.
- Algorithm Analysis and Problem Complexity.
- Local Subjects:
- Computer Communication Networks.
- Theory of Computation.
- Programming Techniques.
- Operating Systems.
- Computation by Abstract Devices.
- Algorithm Analysis and Problem Complexity.
- Physical Description:
- 1 online resource (X, 378 pages).
- Edition:
- First edition 2002.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
- System Details:
- text file PDF
- Contents:
- Early-Delivery Dynamic Atomic Broadcast
- Secure Computation without Agreement
- The Lord of the Rings: Efficient Maintenance of Views at Data Warehouses
- Condition-Based Protocols for Set Agreement Problems
- Distributed Agreement and Its Relation with Error-Correcting Codes
- On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols
- Transformations of Self-Stabilizing Algorithms
- Simple Wait-Free Multireader Registers
- An Efficient Universal Construction for Message-Passing Systems
- Ruminations on Domain-Based Reliable Broadcast
- Stateless Termination Detection
- RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks
- Ad Hoc Membership for Scalable Applications
- Assignment-Based Partitioning in a Condition Monitoring System
- Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes
- Failure Detection Lower Bounds on Registers and Consensus
- Improved Compact Routing Scheme for Chordal Graphs
- A Practical Multi-word Compare-and-Swap Operation
- Failure Detection Sequencers: Necessary and Sufficient Information about Failures to Solve Predicate Detection
- Bounding Work and Communication in Robust Cooperative Computation
- Minimal Byzantine Storage
- Wait-Free n-Set Consensus When Inputs Are Restricted
- The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures
- On the Impact of Fast Failure Detectors on Real-Time Fault-Tolerant Systems.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-36108-4
- 9783540361084
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.