Distributed computing : 13th International Symposium, DISC'99, Bratislava, Slovak Republic, September 27-29, 1999 : proceedings
| 000 | 01307camuu2200325 a 4500 | |
| 001 | 000000667911 | |
| 005 | 20000705144833 | |
| 008 | 990903s1999 gw a b 101 0 eng | |
| 010 | ▼a 99047505 | |
| 020 | ▼a 3540665315 (softcover : alk. paper) | |
| 040 | ▼a DLC ▼c DLC ▼d C#P ▼d UKM ▼d OHX ▼d 211009 | |
| 042 | ▼a pcc | |
| 049 | ▼l 111161013 | |
| 050 | 0 0 | ▼a QA76.9.D5 ▼b D438 1999 |
| 072 | 7 | ▼a QA ▼2 lcco |
| 082 | 0 0 | ▼a 004/.36 ▼2 21 |
| 090 | ▼a 004.36 ▼b D611d ▼c 1999 | |
| 111 | 2 | ▼a DISC'99 ▼d (1999 : ▼c Bratislava, Slovakia) |
| 245 | 1 0 | ▼a Distributed computing : ▼b 13th International Symposium, DISC'99, Bratislava, Slovak Republic, September 27-29, 1999 : proceedings / ▼c Prasad Jayanti (ed.). |
| 246 | 1 8 | ▼a DISC'99, distributed computing |
| 260 | ▼a Berlin ; ▼a New York : ▼b Springer, ▼c c1999. | |
| 300 | ▼a x, 355 p. : ▼b ill. ; ▼c 24 cm. | |
| 440 | 0 | ▼a Lecture notes in computer science, ▼x 0302-9743 ; ▼v 1693 |
| 504 | ▼a Includes bibliographical references and index. | |
| 650 | 0 | ▼a Electronic data processing ▼x Distributed processing ▼v Congresses. |
| 650 | 4 | ▼a Electronic data processing ▼x Distributed processing ▼v Congresses. |
| 700 | 1 | ▼a Jayanti, Prasad , ▼d 1962- |
| 938 | ▼a Otto Harrassowitz ▼b HARR ▼n har000731254 ▼c 86.00 DEM | |
| 950 | 1 | ▼b DM 86 |
Holdings Information
| No. | Location | Call Number | Accession No. | Availability | Due Date | Make a Reservation | Service |
|---|---|---|---|---|---|---|---|
| No. 1 | Location Main Library/Western Books/ | Call Number 004.36 D611d 1999 | Accession No. 111161013 | Availability Available | Due Date | Make a Reservation | Service |
Contents information
Table of Contents
Invited Lecture.- A Case for Message Oriented Middleware.- Regular Papers.- Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast.- Efficient Algorithms to Implement Unreliable Failure Detectors in Partially Synchronous Systems.- Solving Consensus Using Chandra-Toueg's Unreliable Failure Detectors: A General Quorum-Based Approach.- A Dynamic Primary Configuration Group Communication Service.- Asynchronous Group Membership with Oracles.- Generic Broadcast.- Non-blocking Asynchronous Byzantine Quorum Systems.- Byzantine Agreement Secure against General Adversaries in the Dual Failure Model.- Randomness Recycling in Constant-Round Private Computations.- Abuse-Free Multi-party Contract Signing.- Fair and Efficient Mutual Exclusion Algorithms.- Fast and Scalable Mutual Exclusion.- The Congenial Talking Philosophers Problem in Computer Networks.- Software Fault Tolerance of Concurrent Programs Using Controlled Re-execution.- DUALITY: An Architecture Independent Design Model for Parallel Systems Based on Partial Order Semantics.- A New Rewrite Method for Proving Convergence of Self-Stabilizing Systems.- Stabilization-Preserving Atomicity Refinement.- Self-Testing/Correcting Protocols.- Randomization Helps to Perform Tasks on Processors Prone to Failures.- A New Scheduling Algorithm for General Strict Multithreaded Computations.- Consensus Numbers of Transactional Objects.- Linearizability in the Presence of Drifting Clocks and Under Different Delay Assumptions.- Maintenance of a Spanning Tree in Dynamic Networks.
Information Provided By: :
