Pages that link to "Item:Q1339990"
From MaRDI portal
The following pages link to Distributed algorithms. 8th international workshop, WDAG 1994, Terschelling, The Netherlands, September 29 -- October 1, 1994. Proceedings (Q1339990):
Displaying 13 items.
- Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos (Q2377304) (← links)
- Efficient communication in unknown networks (Q2747804) (← links)
- THE FIRST APPROXIMATED DISTRIBUTED ALGORITHM FOR THE MINIMUM DEGREE SPANNING TREE PROBLEM ON GENERAL GRAPHS (Q3022016) (← links)
- A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH (Q3130163) (← links)
- (Q4262694) (← links)
- Fault-tolerance and self-stabilization: impossibility results and solutions using self-stabilizing failure detectors (Q4392356) (← links)
- A self‐stabilizing token‐based <i>k</i>‐out‐of‐ℓ exclusion algorithm (Q4432745) (← links)
- SELF-STABILIZING MASTER–SLAVE TOKEN CIRCULATION AND EFFICIENT SIZE-COMPUTATION IN A UNIDIRECTIONAL RING OF ARBITRARY SIZE (Q4902877) (← links)
- RANDOMIZED SELF-STABILIZING LEADER ELECTION IN PREFERENCE-BASED ANONYMOUS TREES (Q4902882) (← links)
- Algorithms, Complexity, and Hans (Q5042448) (← links)
- An efficient distributed algorithm for finding all hinge vertices in networks (Q5466762) (← links)
- On the Complexity of Universal Leader Election (Q5501952) (← links)
- EFFICIENT ALGORITHMS FOR SELECTION AND SORTING OF LARGE DISTRIBUTED FILES ON DE BRUIJN AND HYPERCUBE STRUCTURES (Q5696958) (← links)
