000 | 03954nam a22005175i 4500 | ||
---|---|---|---|
001 | 978-3-540-49991-6 | ||
003 | DE-He213 | ||
005 | 20160624102047.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2006 gw | s |||| 0|eng d | ||
020 |
_a9783540499916 _9978-3-540-49991-6 |
||
024 | 7 |
_a10.1007/11945529 _2doi |
|
050 | 4 | _aTK5105.5-5105.9 | |
072 | 7 |
_aUKN _2bicssc |
|
072 | 7 |
_aCOM075000 _2bisacsh |
|
082 | 0 | 4 |
_a004.6 _223 |
245 | 1 | 0 |
_aPrinciples of Distributed Systems _h[electronic resource] : _b10th International Conference, OPODIS 2006, Bordeaux, France, December 12-15, 2006. Proceedings / _cedited by Mariam Momenzadeh Alexander A. Shvartsman. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2006. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2006. |
|
300 |
_aXIV, 450 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v4305 |
|
505 | 0 | _aLazy and Speculative Execution in Computer Systems -- In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement -- A Topological Treatment of Early-Deciding Set-Agreement -- Renaming with k-Set-Consensus: An Optimal Algorithm into n + k – 1 Slots -- When Consensus Meets Self-stabilization -- On the Cost of Uniform Protocols Whose Memory Consumption Is Adaptive to Interval Contention -- Optimistic Algorithms for Partial Database Replication -- Optimal Clock Synchronization Revisited: Upper and Lower Bounds in Real-Time Systems -- Distributed Priority Inheritance for Real-Time and Embedded Systems -- Safe Termination Detection in an Asynchronous Distributed System When Processes May Crash and Recover -- Lock-Free Dynamically Resizable Arrays -- Distributed Spanner Construction in Doubling Metric Spaces -- Verification Techniques for Distributed Algorithms -- Mobile Agent Algorithms Versus Message Passing Algorithms -- Incremental Construction of k-Dominating Sets in Wireless Sensor Networks -- Of Malicious Motes and Suspicious Sensors: On the Efficiency of Malicious Interference in Wireless Networks -- Empire of Colonies Self-stabilizing and Self-organizing Distributed Algorithms -- Glance: A Lightweight Querying Service for Wireless Sensor Networks -- On Many-to-Many Communication in Packet Radio Networks -- Robust Random Number Generation for Peer-to-Peer Systems -- About the Lifespan of Peer to Peer Networks -- Incentive-Based Robust Reputation Mechanism for P2P Services -- Searching for Black-Hole Faults in a Network Using Multiple Agents -- Gathering Asynchronous Mobile Robots with Inaccurate Compasses -- Gathering Few Fat Mobile Robots in the Plane -- Hop Chains: Secure Routing and the Establishment of Distinct Identities -- Computing on a Partially Eponymous Ring -- Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents -- Robust Self-stabilizing Clustering Algorithm -- Self-stabilizing Wireless Connected Overlays. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer Communication Networks. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aOperating systems (Computers). | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aComputer Communication Networks. |
650 | 2 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aOperating Systems. |
650 | 2 | 4 | _aSpecial Purpose and Application-Based Systems. |
700 | 1 |
_aShvartsman, Mariam Momenzadeh Alexander A. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540499909 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v4305 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/11945529 |
942 |
_2EBK6920 _cEBK |
||
999 |
_c36214 _d36214 |