Distributed algorithms. 8th international workshop, WDAG 1994, Terschelling, The Netherlands, September 29 -- October 1, 1994. Proceedings
From MaRDI portal
Publication:1339990
DOI10.1007/BFB0020419zbMath0803.00026OpenAlexW4311017726MaRDI QIDQ1339990
No author found.
Publication date: 13 December 1994
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0020419
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)
Related Items (13)
Algorithms, Complexity, and Hans ⋮ Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos ⋮ EFFICIENT ALGORITHMS FOR SELECTION AND SORTING OF LARGE DISTRIBUTED FILES ON DE BRUIJN AND HYPERCUBE STRUCTURES ⋮ SELF-STABILIZING MASTER–SLAVE TOKEN CIRCULATION AND EFFICIENT SIZE-COMPUTATION IN A UNIDIRECTIONAL RING OF ARBITRARY SIZE ⋮ RANDOMIZED SELF-STABILIZING LEADER ELECTION IN PREFERENCE-BASED ANONYMOUS TREES ⋮ Efficient communication in unknown networks ⋮ THE FIRST APPROXIMATED DISTRIBUTED ALGORITHM FOR THE MINIMUM DEGREE SPANNING TREE PROBLEM ON GENERAL GRAPHS ⋮ Fault-tolerance and self-stabilization: impossibility results and solutions using self-stabilizing failure detectors ⋮ Unnamed Item ⋮ A self‐stabilizing token‐based k‐out‐of‐ℓ exclusion algorithm ⋮ An efficient distributed algorithm for finding all hinge vertices in networks ⋮ On the Complexity of Universal Leader Election ⋮ A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH
This page was built for publication: Distributed algorithms. 8th international workshop, WDAG 1994, Terschelling, The Netherlands, September 29 -- October 1, 1994. Proceedings
