| 000 | 05464nam a22005775i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-75142-7 | ||
| 003 | DE-He213 | ||
| 005 | 20240730192810.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100301s2007 gw | s |||| 0|eng d | ||
| 020 |
_a9783540751427 _9978-3-540-75142-7 |
||
| 024 | 7 |
_a10.1007/978-3-540-75142-7 _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] : _b21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings / _cedited by Andrzej Pelc. |
| 250 | _a1st ed. 2007. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2007. |
|
| 300 |
_aXVI, 512 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4731 |
|
| 505 | 0 | _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. | |
| 650 | 0 |
_aComputer science. _99832 |
|
| 650 | 0 |
_aComputer networks . _931572 |
|
| 650 | 0 |
_aAlgorithms. _93390 |
|
| 650 | 0 |
_aComputer programming. _94169 |
|
| 650 | 0 |
_aOperating systems (Computers). _95329 |
|
| 650 | 1 | 4 |
_aTheory of Computation. _9151356 |
| 650 | 2 | 4 |
_aComputer Communication Networks. _9151357 |
| 650 | 2 | 4 |
_aAlgorithms. _93390 |
| 650 | 2 | 4 |
_aProgramming Techniques. _9151358 |
| 650 | 2 | 4 |
_aOperating Systems. _937074 |
| 700 | 1 |
_aPelc, Andrzej. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9151359 |
|
| 710 | 2 |
_aSpringerLink (Online service) _9151360 |
|
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540751410 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540844082 |
| 830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4731 _9151361 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-540-75142-7 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cELN | ||
| 999 |
_c94443 _d94443 |
||