Distributed enumeration
From MaRDI portal
Recommendations
Cites work
Cited in
(19)- Visualization of distributed algorithms based on graph relabelling systems
- Analysis of fully distributed splitting and naming probabilistic procedures and applications
- Locally computable enumerations
- Drawing maps with advice
- A self-stabilizing enumeration algorithm.
- Graph relabelling systems: a tool for encoding, proving, studying and visualizing distributed algorithms
- scientific article; zbMATH DE number 2079522 (Why is no real title available?)
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds
- Election in partially anonymous networks with arbitrary knowledge in message passing systems
- On the smallest grain of salt to get a unique identity
- Graph labelings derived from models in distributed computing: A complete complexity classification
- Enumeration and leader election in partially anonymous and multi-hop broadcast networks
- Leader election in plane cellular automata, only with left-right global convention
- Labelled (Hyper)Graphs, Negotiations and the Naming Problem
- Locality and checkability in wait-free computing
- Locality and checkability in wait-free computing
- Snap-stabilizing tasks in anonymous networks
- Universal semi-local election protocol using forward links
- On the power of synchronization between two adjacent processes
This page was built for publication: Distributed enumeration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287005)