LEADER 04961nam  22007335  450 
001 996466151103316
005 20200703035902.0
010   $a3-540-44783-0
024 7 $a10.1007/BFb0022134
035   $a(CKB)1000000000234329
035   $a(SSID)ssj0000322687
035   $a(PQKBManifestationID)11222868
035   $a(PQKBTitleCode)TC0000322687
035   $a(PQKBWorkID)10288016
035   $a(PQKB)10894997
035   $a(DE-He213)978-3-540-44783-2
035   $a(PPN)155226126
035   $a(EXLCZ)991000000000234329
100   $a20121227d1995      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aDistributed Algorithms$b[electronic resource] $e9th International Workshop, WDAG '95, Le Mont-Saint-Michel, France, September 13 - 15, 1995. Proceedings /$fedited by Jean-Michel Helary, Michel Raynal
205   $a1st ed. 1995.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1995.
215   $a1 online resource (XII, 340 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v972
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-60274-7 
327   $aThe triumph and tribulation of system stabilization -- Wait-free computing -- On real-time and non real-time distributed computing -- Theory and practice in distributed systems -- The inherent cost of strong-partial view-synchronous communication -- Revisiting the relationship between non-blocking atomic commitment and consensus -- Dissecting distributed coordination -- Optimal Broadcast with Partial Knowledge -- Multi-dimensional Interval Routing Schemes -- Data transmission in processor networks -- Distributed protocols against mobile eavesdroppers -- Universal constructions for large objects -- Load balancing: An exercise in constrained convergence -- Larchant-RDOSS: A distributed shared persistent memory and its garbage collector -- Broadcasting in hypercubes with randomly distributed Byzantine faults -- On the number of authenticated rounds in Byzantine Agreement -- Total ordering algorithms for asynchronous Byzantine systems -- A uniform self-stabilizing minimum diameter spanning tree algorithm -- Self-stabilization of wait-free shared memory objects -- Deterministic, constant space, self-stabilizing leader election on uniform rings -- Efficient detection of restricted classes of global predicates -- Faster possibility detection by combining two approaches.
330   $aThis book constitutes the proceedings of the 9th International Workshop on Distributed Algorithms, WDAG '95, held in Le Mont-Saint-Michel, France in September 1995. Besides four invited contributions, 18 full revised research papers are presented, selected from a total of 48 submissions during a careful refereeing process. The papers document the progress achieved in the area since the predecessor workshop (LNCS 857); they are organized in sections on asynchronous systems, networks, shared memory, Byzantine failures, self-stabilization, and detection of properties.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v972
606   $aComputers
606   $aSoftware engineering
606   $aComputer programming
606   $aAlgorithms
606   $aComputer communication systems
606   $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013
606   $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005
606   $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002
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
615  0$aComputers.
615  0$aSoftware engineering.
615  0$aComputer programming.
615  0$aAlgorithms.
615  0$aComputer communication systems.
615 14$aComputation by Abstract Devices.
615 24$aTheory of Computation.
615 24$aSoftware Engineering/Programming and Operating Systems.
615 24$aProgramming Techniques.
615 24$aAlgorithm Analysis and Problem Complexity.
615 24$aComputer Communication Networks.
676   $a004/.36
702   $aHelary$b Jean-Michel$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aRaynal$b Michel$4edt$4http://id.loc.gov/vocabulary/relators/edt
712 12$aInternational Workshop on Distributed Algorithms
906   $aBOOK
912   $a996466151103316
996   $aDistributed algorithms$9382926
997   $aUNISA