Skip to main content
SpringerLink
Log in
Book cover

Distributed Algorithms

9th International Workshop, WDAG '95, Le Mont-Saint-Michel, France, September 13 - 15, 1995. Proceedings

  • Conference proceedings
  • © 1995

Overview

Editors:
  1. Jean-Michel Hélary
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Michel Raynal
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 972)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (22 papers)

  1. Front Matter

    Download chapter PDF

  2. The triumph and tribulation of system stabilization

    • Mohamed G. Gouda
    Pages 1-18

  3. Wait-free computing

    • Prasad Jayanti
    Pages 19-50

  4. On real-time and non real-time distributed computing

    • G. Le Lann
    Pages 51-70

  5. Theory and practice in distributed systems

    • Danny Dolev
    Pages 71-71

  6. The inherent cost of strong-partial view-synchronous communication

    • Özalp Babaoğlu, Renzo Davoli, Luigi Giachini, Paolo Sabattini
    Pages 72-86

  7. Revisiting the relationship between non-blocking atomic commitment and consensus

    • Rachid Guerraoui
    Pages 87-100

  8. Dissecting distributed coordination

    • Aleta Ricciardi
    Pages 101-115

  9. Optimal Broadcast with Partial Knowledge

    • Baruch Awerbuch, Shay Kutten, Yishay Mansour, David Peleg
    Pages 116-130

  10. Multi-dimensional Interval Routing Schemes

    • Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan
    Pages 131-144

  11. Data transmission in processor networks

    • Andreas Jakoby, Rüdiger Reischuk
    Pages 145-159

  12. Distributed protocols against mobile eavesdroppers

    • P. Spirakis, B. Tampakas, H. Antonopoulou
    Pages 160-167

  13. Universal constructions for large objects

    • James H. Anderson, Mark Moir
    Pages 168-182

  14. Load balancing: An exercise in constrained convergence

    • Anish Arora, Mohamed Gouda
    Pages 183-197

  15. Larchant-RDOSS: A distributed shared persistent memory and its garbage collector

    • Marc Shapiro, Paulo Ferreira
    Pages 198-214

  16. Broadcasting in hypercubes with randomly distributed Byzantine faults

    • Feng Bao, Yoshihide Igarashi, Keiko Katano
    Pages 215-229

  17. On the number of authenticated rounds in Byzantine Agreement

    • Malte Borcherding
    Pages 230-241

  18. Total ordering algorithms for asynchronous Byzantine systems

    • Louise E. Moser, P. M. Melliar-Smith
    Pages 242-256

  19. A uniform self-stabilizing minimum diameter spanning tree algorithm

    • Franck Butelle, Christian Lavault, Marc Bui
    Pages 257-272

  20. Self-stabilization of wait-free shared memory objects

    • Jaap -Henk Hoepman, Marina Papatriantafilou, Philippas Tsigas
    Pages 273-287
Back to top

Keywords

About this book

This book constitutes the proceedings of the 9th International Workshop on Distributed Algorithms, WDAG '95, held in Le Mont-Saint-Michel, France in September 1995.
Besides four invited contributions, 18 full revised research papers are presented, selected from a total of 48 submissions during a careful refereeing process. The papers document the progress achieved in the area since the predecessor workshop (LNCS 857); they are organized in sections on asynchronous systems, networks, shared memory, Byzantine failures, self-stabilization, and detection of properties.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation