LEADER 06340nam 22008175 450 001 9910483280103321 005 20251226200133.0 010 $a3-540-75142-4 024 7 $a10.1007/978-3-540-75142-7 035 $a(CKB)1000000000490515 035 $a(SSID)ssj0000317256 035 $a(PQKBManifestationID)11251790 035 $a(PQKBTitleCode)TC0000317256 035 $a(PQKBWorkID)10287199 035 $a(PQKB)10602899 035 $a(DE-He213)978-3-540-75142-7 035 $a(MiAaPQ)EBC3063345 035 $a(MiAaPQ)EBC6710575 035 $a(Au-PeEL)EBL6710575 035 $a(PPN)123165253 035 $a(MiAaPQ)EBC337272 035 $a(BIP)32373286 035 $a(BIP)14494110 035 $a(EXLCZ)991000000000490515 100 $a20100301d2007 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDistributed Computing $e21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings /$fedited by Andrzej Pelc 205 $a1st ed. 2007. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007. 215 $a1 online resource (XVI, 512 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4731 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-75141-6 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- Routing and Scheduling with Incomplete Information -- Time-Efficient Broadcasting in Radio Networks -- A Subjective Visit to Selected Topics in Distributed Computing -- Regular Papers -- Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions -- A Simple Population Protocol for Fast Robust Approximate Majority -- A Denial-of-Service Resistant DHT -- Mobility Versus the Cost of Geocasting in Mobile Ad-Hoc Networks -- Self-stabilizing Counting in Mobile Sensor Networks with a Base Station -- Scalable Load-Distance Balancing -- Time Optimal Asynchronous Self-stabilizing Spanning Tree -- Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links -- Weakening Failure Detectors for k-Set Agreement Via the Partition Approach -- Amnesic Distributed Storage -- Distributed Approximations for Packing in Unit-Disk Graphs -- From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors -- Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time -- On Self-stabilizing Synchronous Actions Despite Byzantine Attacks -- Gossiping in a Multi-channel Radio Network -- The Space Complexity of Unbounded Timestamps -- Approximating Wardrop Equilibria with Finitely Many Agents -- Energy and Time Efficient Broadcasting in Known Topology Radio Networks -- A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree -- On the Message Complexity of Indulgent Consensus -- Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result -- Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes -- On the Communication Surplus Incurred by Faulty Processors -- Output Stability Versus Time Till Output -- A Distributed Maximal Scheduler for Strong Fairness -- Cost-Aware Caching Algorithms for Distributed Storage Servers -- Push-to-Pull Peer-to-Peer Live Streaming -- Probabilistic Opaque Quorum Systems -- Detecting Temporal Logic Predicates on Distributed Computations -- Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks -- Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms -- Automatic Classification of Eventual Failure Detectors -- Brief Announcements -- When 3f?+?1 Is Not Enough: Tradeoffs for Decentralized Asynchronous Byzantine Consensus -- On the Complexity of Distributed Greedy Coloring -- Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks -- Transaction Safe Nonblocking Data Structures -- Long Live Continuous Consensus -- Fully Distributed Algorithms for Convex Optimization Problems -- On the Power of Impersonation Attacks -- Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary -- A Formal Analysis of the Deferred Update Technique -- DISC 20th Anniversary -- DISC at Its 20th Anniversary (Stockholm, 2006) -- DISC 20th Anniversary: Invited Talk Time, Clocks, and the Ordering of My Ideas About Distributed Systems -- DISC 20th Anniversary: Invited Talk My Early Days in Distributed Computing Theory: 1979-1982 -- DISC 20th Anniversary: Invited Talk Provably Unbreakable Hyper-Encryption Using Distributed Systems. 330 $aThis book constitutes the refereed proceedings of the 21st International Symposium on Distributed Computing, DISC 2007. The 32 revised full papers, presented together with abstracts of three invited papers and nine brief announcements of ongoing works, cover all current issues in distributed computing, including theory, design, analysis, implementation, and application of distributed systems and networks. Coverage ranges from theoretical topics to applications in various fields. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4731 606 $aComputer science 606 $aComputer networks 606 $aAlgorithms 606 $aComputer programming 606 $aOperating systems (Computers) 606 $aTheory of Computation 606 $aComputer Communication Networks 606 $aAlgorithms 606 $aProgramming Techniques 606 $aOperating Systems 615 0$aComputer science. 615 0$aComputer networks. 615 0$aAlgorithms. 615 0$aComputer programming. 615 0$aOperating systems (Computers). 615 14$aTheory of Computation. 615 24$aComputer Communication Networks. 615 24$aAlgorithms. 615 24$aProgramming Techniques. 615 24$aOperating Systems. 676 $a004/.36 702 $aPelc$b Andrzej 712 12$aDISC 2007 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483280103321 996 $aDistributed computing$9104445 997 $aUNINA