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

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Fraigniaud, Pierre (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
Edición:1st ed. 2005.
Colección:Theoretical Computer Science and General Issues, 3724
Temas:
Computer science.
Computer networks .
Algorithms.
Computer programming.
Operating systems (Computers).
Theory of Computation.
Computer Communication Networks.
Programming Techniques.
Operating Systems.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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.

Ejemplares similares