000			05183nam a22005175i 4500
001			978-3-540-75142-7
003			DE-He213
005			20160624102112.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	_aTK5105.5-5105.9
072		7	_aUKN _2bicssc
072		7	_aCOM075000 _2bisacsh
082	0	4	_a004.6 _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.
260		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2007.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _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		_aLecture Notes in Computer Science, _x0302-9743 ; _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.
650		0	_aComputer Communication Networks.
650		0	_aOperating systems (Computers).
650		0	_aComputer software.
650	1	4	_aComputer Science.
650	2	4	_aComputer Communication Networks.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aProgramming Techniques.
650	2	4	_aComputation by Abstract Devices.
650	2	4	_aOperating Systems.
700	1		_aPelc, Andrzej. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783540751410
786			_dSpringer
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v4731
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-540-75142-7
942			_2EBK7833 _cEBK
999			_c37127 _d37127