LEADER 07514nam 22007935 450 001 996465630803316 005 20230406033743.0 010 $a3-642-04355-0 024 7 $a10.1007/978-3-642-04355-0 035 $a(CKB)1000000000784716 035 $a(SSID)ssj0000317258 035 $a(PQKBManifestationID)11240593 035 $a(PQKBTitleCode)TC0000317258 035 $a(PQKBWorkID)10292650 035 $a(PQKB)11736732 035 $a(DE-He213)978-3-642-04355-0 035 $a(MiAaPQ)EBC3064669 035 $a(PPN)139955585 035 $a(EXLCZ)991000000000784716 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDistributed Computing$b[electronic resource] $e23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009, Proceedings /$fedited by Idit Keidar 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (XV, 532 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5805 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-04354-2 320 $aIncludes bibliographical references and index. 327 $aThe 2009 Edsger W. Dijkstra Prize in Distributed Computing -- The 2009 Edsger W. Dijkstra Prize in Distributed Computing -- Michel Raynal and Shmuel Zaks 60th Birthday Symposium -- Computing, Observing, Controlling, Checkpointing: Symbiosis Is Even Better Than Agreement! -- What Agreement Problems Owe Michel -- Shmuel Zaks - The Early Years: A Combinatorialist in Distributed Computing -- Shmuel Zaks - The Mathematician, Computer Scientist and Personality -- Award Nominees (Session 2B) -- The Disagreement Power of an Adversary -- New Bounds for the Controller Problem -- On Set Consensus Numbers -- The Abstract MAC Layer -- Randomization Can Be a Healer: Consensus with Dynamic Omission Failures -- Transactional Memory (Session 1A) -- Interrupting Snapshots and the Java Size() Method -- Elastic Transactions -- Brief Announcement: Transactional Scheduling for Read-Dominated Workloads -- Shared Memory (Session 1B) -- Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus -- The RedBlue Adaptive Universal Constructions -- Help When Needed, But No More: Efficient Read/Write Partial Snapshot -- Contention-Sensitive Data Structures and Algorithms -- Brief Announcement: Acceleration by Contention for Shared Memory Mutual Exclusion Algorithms -- Brief Announcement: Incremental Component-Based Modeling, Verification, and Performance Evaluation of Distributed Reset -- Distributed and Local Graph Algorithms (Session 1C) -- Local Computation of Nearly Additive Spanners -- A Local 2-Approximation Algorithm for the Vertex Cover Problem -- Distributed Discovery of Large Near-Cliques -- Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality -- Brief Announcement: Decidable Graph Languages by Mediated Population Protocols -- Brief Announcement: Towards Secured Distributed Polling in Social Networks -- Modeling Issues (Session 1D) -- What Can Be Observed Locally? -- At-Most-Once Semantics in Asynchronous Shared Memory -- Nonblocking Algorithms and Backward Simulation -- Brief Announcement: Efficient Model Checking of Fault-Tolerant Distributed Protocols Using Symmetry Reduction -- Brief Announcement: Dynamic FTSS in Asynchronous Systems: The Case of Unison -- Game Theory (Session 2A) -- Dynamics in Network Interaction Games -- Brief Announcement: Cloud Computing Games: Pricing Services of Large Data Centers -- Failure Detectors (Session 2C) -- On the Existence of Weakest Failure Detectors for Mutual Exclusion and k-Exclusion -- Crash-Quiescent Failure Detection -- The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash and Anonymity -- Brief Announcement: On Implementing Omega Efficiently in the Crash-Recovery Model -- Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems -- Brief Announcement: Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement -- From Theory to Practice (Session 3A) -- Brief Announcement Zab: A Practical Totally Ordered Broadcast Protocol -- Graph Algorithms and Routing (Session 3B) -- Compact Multicast Routing -- Compact Routing in Power-Law Graphs -- Virtual Ring Routing Trends -- A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property -- Euler Tour Lock-In Problem in the Rotor-Router Model -- Consensus and Byzantine Agreement (Session 3C) -- Optimum Simultaneous Consensus for General Omissions Is Equivalent to an NP Oracle -- On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement -- From Almost Everywhere to Everywhere: Byzantine Agreement with Bits -- Brief Announcement: A Leader-free Byzantine Consensus Algorithm -- Radio Networks (Session 3D) -- Efficient k-Shot Broadcasting in Radio Networks -- Keeping Mobile Robot Swarms Connected -- Consensus and Mutual Exclusion in a Multiple Access Channel -- Brief Announcement: Efficient Utilization of Multiple Interfaces in Wireless Ad Hoc Networks -- Brief Announcement: The Speed of Broadcasting in Random Networks ? Density Does Not Matter. 330 $aThis book constitutes the refereed proceedings of the 23nd International Symposium on Distributed Computing, DISC 2009, held in Elche, Spain, in September 2009. The 33 revised full papers, selected from 121 submissions, are presented together with 15 brief announcements of ongoing works; all of them were carefully reviewed and selected for inclusion in the book. The papers address all aspects of distributed computing, and were organized in topical sections on Michel Raynal and Shmuel Zaks 60th birthday symposium, award nominees, transactional memory, shared memory, distributed and local graph algorithms, modeling issues, game theory, failure detectors, from theory to practice, graph algorithms and routing, consensus and byzantine agreement and radio networks. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5805 606 $aComputer networks 606 $aComputer programming 606 $aSoftware engineering 606 $aAlgorithms 606 $aArtificial intelligence?Data processing 606 $aComputers, Special purpose 606 $aComputer Communication Networks 606 $aProgramming Techniques 606 $aSoftware Engineering 606 $aAlgorithms 606 $aData Science 606 $aSpecial Purpose and Application-Based Systems 615 0$aComputer networks. 615 0$aComputer programming. 615 0$aSoftware engineering. 615 0$aAlgorithms. 615 0$aArtificial intelligence?Data processing. 615 0$aComputers, Special purpose. 615 14$aComputer Communication Networks. 615 24$aProgramming Techniques. 615 24$aSoftware Engineering. 615 24$aAlgorithms. 615 24$aData Science. 615 24$aSpecial Purpose and Application-Based Systems. 676 $a004.3622gerDNB 686 $aDAT 250f$2stub 686 $aDAT 516f$2stub 686 $aSS 4800$2rvk 702 $aKeidar$b Idit$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465630803316 996 $aDistributed computing$9104445 997 $aUNISA LEADER 00906nam a2200253 i 4500 001 991000435019707536 005 20020503180647.0 008 981125s1996 it ita 020 $a8880080431 035 $ab10077133-39ule_inst 035 $aLE02516067$9ExL 040 $aFac. Economia$bita 082 0 $a658.8708 100 1 $aAmoroso, Marisa$0115883 245 10$aCome migliorare i rapporti nel sistema franchising /$cMarisa Amoroso 260 $aTorino :$bISEDI,$c1996 300 $ax, 102 p. ;$c24 cm 650 4$aFranchising 907 $a.b10077133$b13-12-18$c27-06-02 912 $a991000435019707536 945 $aLE025 ECO 658.8 AMO01.02$g1$i2025000049932$lle025$nCatalogato 2018$o-$pE0.00$q-$rl$s- $t0$u4$v3$w4$x0$y.i10087655$z27-06-02 996 $aCome migliorare i rapporti nel sistema franchising$9195354 997 $aUNISALENTO 998 $ale025$b01-01-98$cm$da $e-$fita$git $h0$i1 LEADER 01093nam0 22002651i 450 001 UON00100075 005 20231205102549.30 100 $a20020107d1959 |0itac50 ba 101 $ager 102 $aDE 105 $a|||| 1|||| 200 1 $aˆDie ‰Darstellung der Kinetik bei Lukrez$fGerhard Muller 210 $aBerlin$cAkademie Verlag$d1959 215 $a130 p.$d24 cm 311 $aVeröffentlichung$9UON00088573 410 0$1001UON00088573$12001 $aDeutsche Akademie der Wissenschaften zu Berlin. Institut für griechisch -römische Altertumskunde, Veroffentlichung$v7 Veröffentlichung 620 $aDE$dBerlin$3UONL003157 700 1$aMULLER$bGerhard$3UONV064916$027342 712 $aAkademie$3UONV246404$4650 801 $aIT$bSOL$c20240220$gRICA 899 $aSIBA - SISTEMA BIBLIOTECARIO DI ATENEO$2UONSI 912 $aUON00100075 950 $aSIBA - SISTEMA BIBLIOTECARIO DI ATENEO$dSI P 5 0399 $eSI MC 13409 5 996 $aDarstellung der Kinetik bei Lukrez$91310157 997 $aUNIOR