| 000 | 04847nam a22005775i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-32075-3 | ||
| 003 | DE-He213 | ||
| 005 | 20240423125557.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 101108s2005 gw | s |||| 0|eng d | ||
| 020 |
_a9783540320753 _9978-3-540-32075-3 |
||
| 024 | 7 |
_a10.1007/11561927 _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] : _b19th International Conference, DISC 2005, Cracow, Poland, September 26-29, 2005, Proceedings / _cedited by Pierre Fraigniaud. |
| 250 | _a1st ed. 2005. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2005. |
|
| 300 |
_aXIV, 522 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 ; _v3724 |
|
| 505 | 0 | _aInvited Talks -- Digital Fountains and Their Application to Informed Content Delivery over Adaptive Overlay Networks -- Securing the Net: Challenges, Failures and Directions -- Regular Papers -- Coterie Availability in Sites -- Keeping Denial-of-Service Attackers in the Dark -- On Conspiracies and Hyperfairness in Distributed Computing -- On the Availability of Non-strict Quorum Systems -- Musical Benches -- Obstruction-Free Algorithms Can Be Practically Wait-Free -- Efficient Reduction for Wait-Free Termination Detection in a Crash-Prone Distributed System -- Non-blocking Hashtables with Open Addressing -- Computing with Reads and Writes in the Absence of Step Contention -- Restricted Stack Implementations -- Proving Atomicity: An Assertional Approach -- Time and Space Lower Bounds for Implementations Using k-CAS -- (Almost) All Objects Are Universal in Message Passing Systems -- ? Meets Paxos: Leader Election and Stability Without Eventual Timely Links -- Plausible Clocks with Bounded Inaccuracy -- Causing Communication Closure: Safe Program Composition with Non-FIFO Channels -- What Can Be Implemented Anonymously? -- Waking Up Anonymous Ad Hoc Radio Networks -- Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs -- Distributed Computing with Imperfect Randomness -- Polymorphic Contention Management -- Distributed Transactional Memory for Metric-Space Networks -- Concise Version Vectors in WinFS -- Adaptive Software Transactional Memory -- Optimistic Generic Broadcast -- Space and Step Complexity Efficient Adaptive Collect -- Observing Locally Self-stabilization in a Probabilistic Way -- Asymptotically Optimal Solutions for Small World Graphs -- Deciding Stability in Packet-Switched FIFO Networks Under the Adversarial Queuing Model in Polynomial Time,.-Compact Routing for Graphs Excluding a Fixed Minor -- General Compact Labeling Schemes for Dynamic Trees -- The Dynamic And-Or Quorum System -- Brief Announcements -- Byzantine Clients Rendered Harmless -- Reliably Executing Tasks in the Presence of Malicious Processors -- Obstruction-Free Step Complexity: Lock-Free DCAS as an Example -- Communication-Efficient Implementation of Failure Detector Classes and -- Optimal Resilience for Erasure-Coded Byzantine Distributed Storage -- Agreement Among Unacquainted Byzantine Generals -- Subscription Propagation and Content-Based Routing with Delivery Guarantees -- Asynchronous Verifiable Information Dispersal -- Towards a Theory of Self-organization -- Timing Games and Shared Memory -- A Lightweight Group Mutual k-Exclusion Algorithm Using Bi-k-Arbiters -- Could any Graph be Turned into a Small-World? -- Papillon: Greedy Routing in Rings -- An Efficient Long-Lived Adaptive Collect Algorithm. | |
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aComputer networks . | |
| 650 | 0 | _aAlgorithms. | |
| 650 | 0 | _aComputer programming. | |
| 650 | 0 | _aOperating systems (Computers). | |
| 650 | 1 | 4 | _aTheory of Computation. |
| 650 | 2 | 4 | _aComputer Communication Networks. |
| 650 | 2 | 4 | _aAlgorithms. |
| 650 | 2 | 4 | _aProgramming Techniques. |
| 650 | 2 | 4 | _aOperating Systems. |
| 700 | 1 |
_aFraigniaud, Pierre. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540291633 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540816324 |
| 830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v3724 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/11561927 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cSPRINGER | ||
| 999 |
_c179487 _d179487 |
||