The following pages link to Distributed enumeration (Q287005):
Displaying 14 items.
- Drawing maps with advice (Q433400) (← links)
- Leader election in plane cellular automata, only with left-right global convention (Q596068) (← links)
- On the power of synchronization between two adjacent processes (Q660989) (← links)
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds (Q1741851) (← links)
- A self-stabilizing enumeration algorithm. (Q1853019) (← links)
- Election in partially anonymous networks with arbitrary knowledge in message passing systems (Q1938371) (← links)
- Locality and checkability in wait-free computing (Q2441537) (← links)
- Locality and Checkability in Wait-Free Computing (Q3095336) (← links)
- Graph labelings derived from models in distributed computing: A complete complexity classification (Q3100700) (← links)
- Labelled (Hyper)Graphs, Negotiations and the Naming Problem (Q3540388) (← links)
- Visualization of Distributed Algorithms Based on Graph Relabelling Systems1 1This work has been supported by the European TMR research network GETGRATS, and by the “Conseil Régional d' Aquitane”. (Q4921550) (← links)
- Graph Relabelling Systems (Q4923532) (← links)
- Locally computable enumerations (Q5055920) (← links)
- Snap-stabilizing tasks in anonymous networks (Q5920223) (← links)
