Distributed algorithms : 7th international workshop, WDAG '93, Lausanne, Switzerland, September 27-29, 1993 : proceedings /

Saved in:
Bibliographic Details
Imprint:Berlin ; New York : Springer-Verlag, c1993.
Description:viii, 323 p. : ill. ; 24 cm.
Language:English
Series:Lecture notes in computer science 725
Subject:
Format: Print Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/1515281
Hidden Bibliographic Details
Other authors / contributors:Schiper, André, 1949-
International Workshop on Distributed Algorithms (7th : 1993 : Lausanne, Switzerland)
ISBN:3540572716 (Springer-Verlag Berlin Heidelberg New York) : DM66.00
0387572716 (Springer-Verlag New York Berlin Heidelberg)
Notes:Papers from the 7th International Workshop on Distributed Algorithms.
Includes bibliographical references.

MARC

LEADER 00000cam a2200000 a 4500
001 1515281
003 ICU
005 19971005115800.0
008 931118s1993 gw a b 100 0 eng
010 |a  93023379 
020 |a 3540572716 (Springer-Verlag Berlin Heidelberg New York) :  |c DM66.00 
020 |a 0387572716 (Springer-Verlag New York Berlin Heidelberg) 
035 |a (ICU)BID17624094 
035 |a (OCoLC)28711595 
040 |c DLC  |d DLC$dOrLoB 
050 0 0 |a QA76.9.D5  |b D48545 1993 
082 |a 004/.36  |2 20 
245 0 0 |a Distributed algorithms :  |b 7th international workshop, WDAG '93, Lausanne, Switzerland, September 27-29, 1993 : proceedings /  |c André Schiper (ed.). 
260 |a Berlin ;  |a New York :  |b Springer-Verlag,  |c c1993. 
300 |a viii, 323 p. :  |b ill. ;  |c 24 cm. 
336 |a text  |b txt  |2 rdacontent  |0 http://id.loc.gov/vocabulary/contentTypes/txt 
337 |a unmediated  |b n  |2 rdamedia  |0 http://id.loc.gov/vocabulary/mediaTypes/n 
338 |a volume  |b nc  |2 rdacarrier  |0 http://id.loc.gov/vocabulary/carriers/nc 
440 0 |a Lecture notes in computer science  |v 725 
500 |a Papers from the 7th International Workshop on Distributed Algorithms. 
504 |a Includes bibliographical references. 
505 0 0 |t Efficient wait-free implementation of a concurrent priority queue /  |r A. Israeli and L. Rappoport --  |t Binary snapshots /  |r J.-H. Hoepman and J. Tromp --  |t Linear-time snapshot protocols for unbalanced systems /  |r A. Israeli, A. Shaham and A. Shirazi --  |t Towards a necessary and sufficient condition for wait-free synchronization /  |r J. H. Anderson and M. Moir --  |t Efficient algorithms for checking the atomicity of a run of read and write operations /  |r L. M. Kirousis and A. G. Veneris --  |t Benign failure models for shared memory /  |r Y. Afek, M. Merritt and G. Taubenfeld --  |t Generalized agreement between concurrent fail-stop processes /  |r J. E. Burns, R. I. Cruz and M. C. Loui --  |t Controlling memory access concurrency in efficient fault-tolerant parallel algorithms /  |r P. C. Kanellakis, D. Michailidis and A. A. Shvartsman --  |t Asynchronous epoch management in replicated databases /  |r M. Rabinovich and E. D. Lazowska --  |t Crash resilient communication in dynamic networks /  |r S. Dolev and J. L. Welch --  |t Distributed job scheduling using snapshots /  |r M. Choy and A. K. Singh --  |t Optimal time self stabilization in dynamic systems /  |r S. Dolev --  |t Tolerating transient and permanent failures /  |r E. Anagnostou and V. Hadzilacos --  |t Quick atomic broadcast /  |r P. Berman and A. A. Bharali --  |t Time bounds for decision problems in the presence of timing uncertainty and failures /  |r H. Attiya and T. Djerassi-Shintel --  |t Boolean routing /  |r M. Flammini, G. Gambosi and S. Salomone --  |t Notes on sorting and counting networks /  |r N. Hardavellas, D. Karakos and M. Mavronicolas --  |t A simple, efficient algorithm for maximum finding on rings /  |r L. Higham and T. Przytycka --  |t Wang tilings and distributed orientation on anonymous torus networks /  |r V. R. Syrotiuk, C. J. Colbourn and J. Pachl --  |t Fairness of N-party synchronization and its implementation in a distributed environment /  |r C. Wu, G. v. Bochmann and M. Yao --  |t Programming distributed reactive systems: a strong and weak synchronous coupling /  |r F. Boniol and M. Adelantado --  |t Using message semantics to reduce rollback in the time warp mechanism /  |r H. V. Leong, D. Agrawal and J. R. Agre. 
650 0 |a Electronic data processing  |x Distributed processing  |v Congresses  |0 http://id.loc.gov/authorities/subjects/sh2008102927 
650 0 |a Computer algorithms  |x Congresses.  |0 http://id.loc.gov/authorities/subjects/sh2008101223 
650 7 |a Computer algorithms.  |2 fast  |0 http://id.worldcat.org/fast/fst00872010 
650 7 |a Electronic data processing  |x Distributed processing.  |2 fast  |0 http://id.worldcat.org/fast/fst00906987 
655 7 |a Conference papers and proceedings.  |2 fast  |0 http://id.worldcat.org/fast/fst01423772 
700 1 0 |a Schiper, André,  |d 1949-  |0 http://id.loc.gov/authorities/names/n88106965  |1 http://viaf.org/viaf/52371484 
711 2 0 |a International Workshop on Distributed Algorithms  |n (7th :  |d 1993 :  |c Lausanne, Switzerland) 
850 |a ICU 
901 |a ToCBNA 
903 |a HeVa 
903 |a Hathi 
929 |a cat 
999 f f |i c4503d69-0d54-52c0-a53d-8fd9f4a9eb29  |s 26a98b14-9cbe-5576-8a1c-98a3823d055a 
928 |t Library of Congress classification  |a QA76.9.D5D485450 1993  |l ASR  |c ASR-SciASR  |i 5888193 
927 |t Library of Congress classification  |a QA76.9.D5D485450 1993  |l ASR  |c ASR-SciASR  |e CRERAR  |b 43902730  |i 2915102