Distributed Algorithms - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

26

(FIVE YEARS 0)

H-INDEX

11

(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 ◽

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 ◽

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 ◽

Author(s):

R. Lüling ◽

B. Monien

Keyword(s):

Vertex Cover ◽

Vertex 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 ◽

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 ◽

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 ◽

Author(s):

Amotz Bar-Noy ◽

Danny Dolev ◽

Daphne Koller ◽

David Peleg

Keyword(s):

Fault Tolerant ◽

Critical Section ◽

Asynchronous Networks

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 ◽

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 ◽

Author(s):

Ajei Gopal ◽

Sam Toueg

Keyword(s):

Preliminary Version ◽

Reliable Broadcast ◽

Asynchronous Environments

Download Full-text

A new algorithm to implement causal ordering

Distributed Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-51687-5_45 ◽

1989 ◽

pp. 219-232 ◽

Author(s):

André Schiper ◽

Jorge Eggli ◽

Alain Sandoz

Keyword(s):

Causal Ordering

Download Full-text

Building a global time on parallel machines

Distributed Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-51687-5_38 ◽

1989 ◽

pp. 136-147 ◽

Author(s):

Jean-Marc Jezequel

Keyword(s):

Parallel Machines ◽

Download Full-text