Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Book
    Book
    Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London :Springer,
    UID:
    almahu_BV014799453
    Format: X, 369 S.
    ISBN: 3-540-00073-9
    Series Statement: Lecture notes in computer science 2508
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Verteilte Programmierung ; Verteilter Algorithmus ; Verteiltes System ; Konferenzschrift ; Kongress ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    almahu_9947920713402882
    Format: X, 378 p. , online resource.
    ISBN: 9783540361084
    Series Statement: Lecture Notes in Computer Science, 2508
    Note: Early-Delivery Dynamic Atomic Broadcast -- Secure Computation without Agreement -- The Lord of the Rings: Efficient Maintenance of Views at Data Warehouses -- Condition-Based Protocols for Set Agreement Problems -- Distributed Agreement and Its Relation with Error-Correcting Codes -- On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols -- Transformations of Self-Stabilizing Algorithms -- Simple Wait-Free Multireader Registers -- An Efficient Universal Construction for Message-Passing Systems -- Ruminations on Domain-Based Reliable Broadcast -- Stateless Termination Detection -- RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks -- Ad Hoc Membership for Scalable Applications -- Assignment-Based Partitioning in a Condition Monitoring System -- Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes -- Failure Detection Lower Bounds on Registers and Consensus -- Improved Compact Routing Scheme for Chordal Graphs -- A Practical Multi-word Compare-and-Swap Operation -- Failure Detection Sequencers: Necessary and Sufficient Information about Failures to Solve Predicate Detection -- Bounding Work and Communication in Robust Cooperative Computation -- Minimal Byzantine Storage -- Wait-Free n-Set Consensus When Inputs Are Restricted -- The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures -- On the Impact of Fast Failure Detectors on Real-Time Fault-Tolerant Systems.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540000730
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    almahu_9948621332102882
    Format: X, 378 p. , online resource.
    Edition: 1st ed. 2002.
    ISBN: 9783540361084
    Series Statement: Lecture Notes in Computer Science, 2508
    Note: Early-Delivery Dynamic Atomic Broadcast -- Secure Computation without Agreement -- The Lord of the Rings: Efficient Maintenance of Views at Data Warehouses -- Condition-Based Protocols for Set Agreement Problems -- Distributed Agreement and Its Relation with Error-Correcting Codes -- On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols -- Transformations of Self-Stabilizing Algorithms -- Simple Wait-Free Multireader Registers -- An Efficient Universal Construction for Message-Passing Systems -- Ruminations on Domain-Based Reliable Broadcast -- Stateless Termination Detection -- RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks -- Ad Hoc Membership for Scalable Applications -- Assignment-Based Partitioning in a Condition Monitoring System -- Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes -- Failure Detection Lower Bounds on Registers and Consensus -- Improved Compact Routing Scheme for Chordal Graphs -- A Practical Multi-word Compare-and-Swap Operation -- Failure Detection Sequencers: Necessary and Sufficient Information about Failures to Solve Predicate Detection -- Bounding Work and Communication in Robust Cooperative Computation -- Minimal Byzantine Storage -- Wait-Free n-Set Consensus When Inputs Are Restricted -- The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures -- On the Impact of Fast Failure Detectors on Real-Time Fault-Tolerant Systems.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783540000730
    Additional Edition: Printed edition: ISBN 9783662206058
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Online Resource
    Online Resource
    Berlin, Heidelberg : Springer-Verlag Berlin Heidelberg
    UID:
    gbv_1649186991
    Format: Online-Ressource
    ISBN: 9783540361084 , 3540000739
    Series Statement: Lecture Notes in Computer Science 2508
    Content: This book constitutes the refereed proceedings of the 16th International Conference on Distributed Computing, DISC 2002, held in Toulouse, France, in October 2002. The 24 revised full papers presented were carefully reviewed and selected from 76 submissions. Among the issues addressed are broadcasting, secure computation, view maintenance, communication protocols, distributed agreement, self-stabilizing algorithms, message-passing systems, dynamic networks, condition monitoring systems, shared memory computing, Byzantine processes, routing, failure detection, compare-and-swap operations, cooperative computation, and consensus algorithms
    Additional Edition: ISBN 9783540000730
    Additional Edition: Buchausg. u.d.T. Distributed computing Berlin : Springer, 2002 ISBN 3540000739
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Verteilte Programmierung ; Verteilter Algorithmus ; Verteiltes System ; Verteiltes System ; Verteilter Algorithmus ; Verteilte Programmierung ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 9783540000273?
Did you mean 9783540000600?
Did you mean 9783540000723?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages