LEADER 05365nam 22007575 450 001 996466356403316 005 20220426233111.0 010 $a3-540-40026-5 024 7 $a10.1007/3-540-40026-5 035 $a(CKB)1000000000211317 035 $a(SSID)ssj0000322697 035 $a(PQKBManifestationID)11242953 035 $a(PQKBTitleCode)TC0000322697 035 $a(PQKBWorkID)10287106 035 $a(PQKB)10724686 035 $a(DE-He213)978-3-540-40026-4 035 $a(MiAaPQ)EBC3072332 035 $a(PPN)155166514 035 $a(EXLCZ)991000000000211317 100 $a20121227d2000 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDistributed Computing$b[electronic resource] $e14th International Conference, DISC 2000 Toledo, Spain, October 4-6, 2000 Proceedings /$fedited by Maurice Herlihy 205 $a1st ed. 2000. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2000. 215 $a1 online resource (VIII, 392 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1914 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-41143-7 320 $aIncludes bibliographical references and index. 327 $aLower Bounds in Distributed Computing -- Adaptive Mutual Exclusion with Local Spinning -- Bounds for Mutual Exclusion with only Processor Consistency -- Even Better DCAS-Based Concurrent Deques -- Distributed Algorithms for English Auctions -- A Probabilistically Correct Leader Election Protocol for Large Groups -- Approximation Algorithms for Survivable Optical Networks -- Distributed Cooperation During the Absence of Communication -- On the Importance of Having an Identity or, is Consensus really Universal? -- Polynomial and Adaptive Long-lived (2k- 1)-Renaming -- Computing with Infinitely Many Processes -- Establishing Business Rules for Inter-Enterprise Electronic Commerce -- Metering Schemes with Pricing -- Exploitation of Ljapunov Theory for Verifying Self-Stabilizing Algorithms -- Self-Stabilizing Local Mutual Exclusion and Daemon Refinement -- More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs -- Gossip versus Deterministically Constrained Flooding on Small Networks -- Thrifty Generic Broadcast -- Locating Information with Uncertainty in Fully Interconnected Networks -- Optimistic Replication for Internet Data Services -- Scalable Replication in Database Clusters -- Disk Paxos -- Objects Shared by Byzantine Processes -- Short Headers Suffice for Communication in a DAG with Link Failures -- Consistency Conditions for a CORBA Caching Service. 330 $aDISC, the International Symposium on DIStributed Computing, is an annual forum for research presentations on all facets of distributed computing. DISC 2000 was held on4-6 October, 2000 in Toledo, Spain. This volume includes 23 contributed papers and the extended abstract of an invited lecture from last year?s DISC. It is expected that the regular papers will later be submitted in a more polished form to fully refereed scienti?c journals. The extended abstracts of this year?s invited lectures, by Jean-Claude Bermond and Sam Toueg, will appear in next year?s proceedings. We received over 100 regular submissions, a record for DISC. These s- missions were read and evaluated by the program committee, with the help of external reviewers when needed. Overall, the quality of the submissions was excellent, and we were unable to accept many deserving papers. This year?s Best Student Paper award goes to ?Polynomial and Adaptive Long-Lived (2k?1)-Renaming? by Hagit Attiya and Arie Fouren. Arie Fouren is the student author. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1914 606 $aComputer communication systems 606 $aAlgorithms 606 $aComputer programming 606 $aComputers 606 $aOperating systems (Computers) 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aOperating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14045 615 0$aComputer communication systems. 615 0$aAlgorithms. 615 0$aComputer programming. 615 0$aComputers. 615 0$aOperating systems (Computers). 615 14$aComputer Communication Networks. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aProgramming Techniques. 615 24$aComputation by Abstract Devices. 615 24$aOperating Systems. 676 $a004/.36 702 $aHerlihy$b Maurice$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aDISC 2000$f(2000 :$eToledo, Spain) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466356403316 996 $aDistributed computing$9104445 997 $aUNISA