Distributed Algorithms - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540540991, 9783540474050

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Localized-access protocols for replicated databases

Distributed Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-54099-7_17 ◽

1991 ◽

pp. 245-262 ◽

Cited By ~ 2

Author(s):

D. Agrawal ◽

A. Abbadi

Keyword(s):

Access Protocols ◽

Replicated Databases

Download Full-text

A bounded first-in, first-enabled solution to the l-exclusion problem

Distributed Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-54099-7_28 ◽

1991 ◽

pp. 422-431 ◽

Cited By ~ 4

Author(s):

Yehuda Afek ◽

Danny Dolev ◽

Eli Gafni ◽

Michael Merritt ◽

Nir Shavit

Keyword(s):

Exclusion Problem

Download Full-text

Bounds on the costs of register implementations

Distributed Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-54099-7_27 ◽

1991 ◽

pp. 402-421 ◽

Cited By ~ 4

Author(s):

Soma Chaudhuri ◽

Jennifer Welch

Download Full-text

Self-stabilizing ring orientation

Distributed Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-54099-7_1 ◽

1991 ◽

pp. 1-14 ◽

Cited By ~ 7

Author(s):

Amos Israeli ◽

Marc Jalfon

Download Full-text

On the average performance of synchronized programs in distributed networks

Distributed Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-54099-7_8 ◽

1991 ◽

pp. 102-121 ◽

Cited By ~ 4

Author(s):

Sergio Rajsbaum ◽

Moshe Sidi

Keyword(s):

Distributed Networks ◽

Average Performance

Download Full-text

A linear fault-tolerant naming algorithm

Distributed Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-54099-7_5 ◽

1991 ◽

pp. 57-70 ◽

Cited By ~ 1

Author(s):

Joffroy Beauquier ◽

Paul Gastin ◽

Vincent Villain

Keyword(s):

Fault Tolerant

Download Full-text

Fast consensus in networks of bounded degree

Distributed Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-54099-7_22 ◽

1991 ◽

pp. 321-333 ◽

Cited By ~ 2

Author(s):

Piotr Berman ◽

Juan A. Garay

Keyword(s):

Bounded Degree

Download Full-text

Weak consistency and pessimistic replica control

Distributed Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-54099-7_16 ◽

1991 ◽

pp. 228-244

Author(s):

Alain Sandoz ◽

André Schiper

Keyword(s):

Weak Consistency ◽

Replica Control

Download Full-text

Strong verifiable secret sharing extended abstract

Distributed Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-54099-7_15 ◽

1991 ◽

pp. 213-227 ◽

Cited By ~ 4

Author(s):

Cynthia Dwork

Keyword(s):

Secret Sharing ◽

Verifiable Secret Sharing

Download Full-text

Efficient distributed algorithms for single-source shortest paths and related problems on plane networks

Distributed Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-54099-7_10 ◽

1991 ◽

pp. 133-150

Author(s):

Ravi Janardan ◽

Siu Wing Cheng

Keyword(s):

Distributed Algorithms ◽

Shortest Paths ◽

Single Source

Download Full-text

Distributed Algorithms - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Localized-access protocols for replicated databases

A bounded first-in, first-enabled solution to the l-exclusion problem

Bounds on the costs of register implementations

Self-stabilizing ring orientation

On the average performance of synchronized programs in distributed networks

A linear fault-tolerant naming algorithm

Fast consensus in networks of bounded degree

Weak consistency and pessimistic replica control

Strong verifiable secret sharing extended abstract

Efficient distributed algorithms for single-source shortest paths and related problems on plane networks

Distributed Algorithms - Lecture Notes in Computer Science
Latest Publications