Distributed Algorithms 4th International Workshop, Bari, Italy, September 24-26, 1990. Proceedings. / edited by Jan van Leeuwen, Nicola Santoro.

This volume contains the proceedings of the 4th International Workshop on Distributed Algorithms, held near Bari, Italy, September 24-26, 1990. The workshop was a forum for researchers, students and other interested persons to discuss recent results and trends in the design and analysis of distribut...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Leeuwen, Jan van (Editor), Santoro, Nicola (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1991.
Edition:1st ed. 1991.
Series:Lecture Notes in Computer Science, 486
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.

MARC

LEADER 00000nam a22000005i 4500
001 b3216976
003 MWH
005 20191022033355.0
007 cr nn 008mamaa
008 121227s1991 gw | s |||| 0|eng d
020 |a 9783540474050 
024 7 |a 10.1007/3-540-54099-7  |2 doi 
035 |a (DE-He213)978-3-540-47405-0 
050 4 |a E-Book 
072 7 |a UY  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a UY  |2 thema 
072 7 |a UYA  |2 thema 
245 1 0 |a Distributed Algorithms  |h [electronic resource] :  |b 4th International Workshop, Bari, Italy, September 24-26, 1990. Proceedings. /  |c edited by Jan van Leeuwen, Nicola Santoro. 
250 |a 1st ed. 1991. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 1991. 
300 |a VIII, 436 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 486 
490 1 |a Springer eBook Collection 
505 0 |a Self-stabilizing ring orientation -- Memory-efficient self stabilizing protocols for general networks -- On the computational power needed to elect a leader -- Spanning tree construction for nameless networks -- A linear fault-tolerant naming algorithm -- Distributed data structures: A complexity-oriented view -- An improved algorithm to detect communication deadlocks in distributed systems -- On the average performance of synchronized programs in distributed networks -- Distributed algorithms for reconstructing MST after topology change -- Efficient distributed algorithms for single-source shortest paths and related problems on plane networks -- Stepwise development of a distributed load balancing algorithm -- Greedy packet scheduling -- Optimal computation of global sensitive functions in fast networks -- Efficient mechanism for fairness and deadlock-avoidance in high-speed networks -- Strong verifiable secret sharing extended abstract -- Weak consistency and pessimistic replica control -- Localized-access protocols for replicated databases -- Weighted voting for operation dependent management of replicated data -- Wakeup under read/write atomicity -- Time and message efficient reliable broadcasts -- Early-stopping distributed bidding and applications -- Fast consensus in networks of bounded degree -- Common knowledge and consistent simultaneous coordination -- Agreement on the group membership in synchronous distributed systems -- Tight bounds on the round complexity of distributed 1-solvable tasks -- A time-randomness tradeoff for communication complexity -- Bounds on the costs of register implementations -- A bounded first-in, first-enabled solution to the l-exclusion problem. 
520 |a This volume contains the proceedings of the 4th International Workshop on Distributed Algorithms, held near Bari, Italy, September 24-26, 1990. The workshop was a forum for researchers, students and other interested persons to discuss recent results and trends in the design and analysis of distributed algorithms for communication networks and decentralized systems. The volume includes all 28 papers presented at the workshop, covering current research in such aspects of distributed algorithm design as distributed combinatorial algorithms, distributed algorithms on graphs, distributed algorithms for new types of decentralized systems, distributed data structures, synchronization and load-balancing, distributed algorithms for control and communication, design and verification of network protocols, routing algorithms, fail-safe and fault-tolerant distributed algorithms, distributed database techniques, algorithms for transaction management and replica control, and other related topics. 
590 |a Loaded electronically. 
590 |a Electronic access restricted to members of the Holy Cross Community. 
650 0 |a Computers. 
650 0 |a Computer programming. 
650 0 |a Algorithms. 
650 0 |a Computer communication systems. 
650 0 |a Operating systems (Computers). 
690 |a Electronic resources (E-books) 
700 1 |a Leeuwen, Jan van.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Santoro, Nicola.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 486 
830 0 |a Springer eBook Collection. 
856 4 0 |u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/3-540-54099-7  |3 Click to view e-book  |t 0 
907 |a .b32169760  |b 04-18-22  |c 02-26-20 
998 |a he  |b 02-26-20  |c m  |d @   |e -  |f eng  |g gw   |h 0  |i 1 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645) 
902 |a springer purchased ebooks 
903 |a SEB-COLL 
945 |f  - -   |g 1  |h 0  |j  - -   |k  - -   |l he   |o -  |p $0.00  |q -  |r -  |s b   |t 38  |u 0  |v 0  |w 0  |x 0  |y .i21301414  |z 02-26-20 
999 f f |i 45ec2c56-f896-5352-b50f-e8b4acd4d8c5  |s 563f16cd-b7ee-50fd-af2f-9affe086a0e9  |t 0 
952 f f |p Online  |a College of the Holy Cross  |b Main Campus  |c E-Resources  |d Online  |t 0  |e E-Book  |h Library of Congress classification  |i Elec File