Distributed Computing 19th International Conference, DISC 2005, Cracow, Poland, September 26-29, 2005. Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Fraigniaud, Pierre (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.
Σειρά:Lecture Notes in Computer Science, 3724
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04755nam a22005655i 4500
001 978-3-540-32075-3
003 DE-He213
005 20151204160022.0
007 cr nn 008mamaa
008 101108s2005 gw | s |||| 0|eng d
020 |a 9783540320753  |9 978-3-540-32075-3 
024 7 |a 10.1007/11561927  |2 doi 
040 |d GrThAP 
050 4 |a QA75.5-76.95 
072 7 |a UY  |2 bicssc 
072 7 |a UYA  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a COM031000  |2 bisacsh 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Distributed Computing  |h [electronic resource] :  |b 19th International Conference, DISC 2005, Cracow, Poland, September 26-29, 2005. Proceedings /  |c edited by Pierre Fraigniaud. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2005. 
300 |a XIV, 522 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 3724 
505 0 |a Invited 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 |a Computer science. 
650 0 |a Computer communication systems. 
650 0 |a Computer programming. 
650 0 |a Operating systems (Computers). 
650 0 |a Computers. 
650 0 |a Algorithms. 
650 1 4 |a Computer Science. 
650 2 4 |a Theory of Computation. 
650 2 4 |a Computer Communication Networks. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Programming Techniques. 
650 2 4 |a Computation by Abstract Devices. 
650 2 4 |a Operating Systems. 
700 1 |a Fraigniaud, Pierre.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540291633 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 3724 
856 4 0 |u http://dx.doi.org/10.1007/11561927  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)