Distributed Algorithms - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540516873, 9783540467502

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

How to construct an atomic variable (extended abstract)

Distributed Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-51687-5_51 ◽

1989 ◽

pp. 292-302 ◽

Cited By ~ 21

Author(s):

John Tromp

Download Full-text

Designing distributed algorithms by means of formal sequentially phased reasoning

Distributed Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-51687-5_47 ◽

1989 ◽

pp. 242-253 ◽

Cited By ~ 17

Author(s):

F. A. Stomp ◽

W. P. de Roever

Keyword(s):

Distributed Algorithms

Download Full-text

Two strategies for solving the vertex cover problem on a transputer network

Distributed Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-51687-5_40 ◽

1989 ◽

pp. 160-170 ◽

Cited By ~ 14

Author(s):

R. Lüling ◽

B. Monien

Keyword(s):

Vertex Cover ◽

Vertex Cover Problem ◽

Cover Problem

Download Full-text

An efficient reliable ring protocol

Distributed Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-51687-5_33 ◽

1989 ◽

pp. 70-82 ◽

Cited By ~ 3

Author(s):

Reuven Cohen ◽

Adrian Segall

Download Full-text

Applying a path-compression technique to obtain an efficient distributed mutual exclusion algorithm

Distributed Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-51687-5_30 ◽

1989 ◽

pp. 33-44 ◽

Cited By ~ 11

Author(s):

José M. Bernabéu-Aubán ◽

Mustaque Ahamad

Keyword(s):

Mutual Exclusion ◽

Compression Technique ◽

Distributed Mutual Exclusion ◽

Mutual Exclusion Algorithm

Download Full-text

Fault-tolerant critical section management in asynchronous networks

Distributed Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-51687-5_28 ◽

1989 ◽

pp. 13-23 ◽

Cited By ~ 1

Author(s):

Amotz Bar-Noy ◽

Danny Dolev ◽

Daphne Koller ◽

David Peleg

Keyword(s):

Fault Tolerant ◽

Critical Section ◽

Asynchronous Networks

Download Full-text

Simple and efficient election algorithms for anonymous networks

Distributed Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-51687-5_42 ◽

1989 ◽

pp. 183-194 ◽

Cited By ~ 13

Author(s):

Yossi Matias ◽

Yehuda Afek

Keyword(s):

Anonymous Networks

Download Full-text

An efficient solution to the drinking philosophers problem and its extensions

Distributed Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-51687-5_34 ◽

1989 ◽

pp. 83-93 ◽

Cited By ~ 8

Author(s):

David Ginat ◽

A. Udaya Shankar ◽

A. K. Agrawala

Keyword(s):

Efficient Solution

Download Full-text

Electing a leader when processor identity numbers are not distinct (extended abstract)

Distributed Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-51687-5_52 ◽

1989 ◽

pp. 303-314 ◽

Cited By ~ 12

Author(s):

M. Yamashita ◽

T. Kameda

Download Full-text

Reliable broadcast in synchronous and asynchronous environments (preliminary version)

Distributed Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-51687-5_36 ◽

1989 ◽

pp. 110-123 ◽

Cited By ~ 14

Author(s):

Ajei Gopal ◽

Sam Toueg

Keyword(s):

Preliminary Version ◽

Reliable Broadcast ◽

Asynchronous Environments

Download Full-text

Distributed Algorithms - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

How to construct an atomic variable (extended abstract)

Designing distributed algorithms by means of formal sequentially phased reasoning

Two strategies for solving the vertex cover problem on a transputer network

An efficient reliable ring protocol

Applying a path-compression technique to obtain an efficient distributed mutual exclusion algorithm

Fault-tolerant critical section management in asynchronous networks

Simple and efficient election algorithms for anonymous networks

An efficient solution to the drinking philosophers problem and its extensions

Electing a leader when processor identity numbers are not distinct (extended abstract)

Reliable broadcast in synchronous and asynchronous environments (preliminary version)

Distributed Algorithms - Lecture Notes in Computer Science
Latest Publications