LEADER 05849nam 22007455 450 001 996465439503316 005 20230323211013.0 010 $a3-540-47405-6 024 7 $a10.1007/3-540-54099-7 035 $a(CKB)1000000000233651 035 $a(SSID)ssj0000322682 035 $a(PQKBManifestationID)11268123 035 $a(PQKBTitleCode)TC0000322682 035 $a(PQKBWorkID)10289038 035 $a(PQKB)10004767 035 $a(DE-He213)978-3-540-47405-0 035 $a(PPN)155195743 035 $a(EXLCZ)991000000000233651 100 $a20121227d1991 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDistributed Algorithms$b[electronic resource] $e4th International Workshop, Bari, Italy, September 24-26, 1990. Proceedings. /$fedited by Jan van Leeuwen, Nicola Santoro 205 $a1st ed. 1991. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1991. 215 $a1 online resource (VIII, 436 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v486 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-54099-7 327 $aSelf-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. 330 $aThis 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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v486 606 $aComputers 606 $aComputer programming 606 $aAlgorithms 606 $aComputer communication systems 606 $aOperating systems (Computers) 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 606 $aOperating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14045 615 0$aComputers. 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aComputer communication systems. 615 0$aOperating systems (Computers). 615 14$aTheory of Computation. 615 24$aComputation by Abstract Devices. 615 24$aProgramming Techniques. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aComputer Communication Networks. 615 24$aOperating Systems. 676 $a004/.36 702 $aLeeuwen$b Jan van$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSantoro$b N$g(Nicola),$f1951-$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 02$aUniversita? di Bari.$bIstituto di scienze dell'informazione. 712 12$aInternational Workshop on Distributed Algorithms$d(4th :$f1990 :$eBari, Italy) 906 $aBOOK 912 $a996465439503316 996 $aDistributed algorithms$9382926 997 $aUNISA