000 03397nam a22005895i 4500
001 978-3-540-45414-4
003 DE-He213
005 20240423132506.0
007 cr nn 008mamaa
008 121227s2001 gw | s |||| 0|eng d
020 _a9783540454144
_9978-3-540-45414-4
024 7 _a10.1007/3-540-45414-4
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aDistributed Computing
_h[electronic resource] :
_b15th International Conference, DISC 2001, Lisbon, Portugal, October 3-5, 2001. Proceedings /
_cedited by Jennifer L. Welch.
250 _a1st ed. 2001.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2001.
300 _aX, 346 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2180
505 0 _aA Time Complexity Bound for Adaptive Mutual Exclusion -- Quorum-Based Algorithms for Group Mutual Exclusion -- An Effective Characterization of Computability in Anonymous Networks -- Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System -- Optimal Unconditional Information Diffusion -- Computation Slicing: Techniques and Theory -- A Low-Latency Non-blocking Commit Service -- Stable Leader Election -- Adaptive Long-lived O(k 2)-Renaming with O(k 2) Steps -- A New Synchronous Lower Bound for Set Agreement -- The Complexity of Synchronous Iterative Do-All with Crashes -- Mobile Search for a Black Hole in an Anonymous Ring -- Randomised Mutual Search for k > 2 Agents -- Self-stabilizing Minimum Spanning Tree Construction on Message-Passing Networks -- Self Stabilizing Distributed Queuing -- A Space Optimal, Deterministic, Self-stabilizing, Leader Election Algorithm for Unidirectional Rings -- Randomized Finite-state Distributed Algorithms As Markov Chains -- The Average Hop Count Measure For Virtual Path Layouts -- Efficient Routing in Networks with Long Range Contacts -- An Efficient Communication Strategy for Ad-hoc Mobile Networks -- A Pragmatic Implementation of Non-blocking Linked-lists -- Stabilizing Replicated Search Trees -- Adding Networks.
650 0 _aComputer science.
650 0 _aComputer programming.
650 0 _aComputers, Special purpose.
650 0 _aAlgorithms.
650 0 _aOperating systems (Computers).
650 1 4 _aTheory of Computation.
650 2 4 _aProgramming Techniques.
650 2 4 _aSpecial Purpose and Application-Based Systems.
650 2 4 _aAlgorithms.
650 2 4 _aOperating Systems.
700 1 _aWelch, Jennifer L.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540426059
776 0 8 _iPrinted edition:
_z9783662162965
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2180
856 4 0 _uhttps://doi.org/10.1007/3-540-45414-4
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188351
_d188351