Distributed enumeration

DOI10.1016/S0020-0190(97)00022-7MaRDI QIDQ287005zbMATH OpenOpenAlexFDO

Authors Antoni Mazurkiewicz

Publication date 26 May 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(97)00022-7

zbMATH Keywords

graphsdistributed systemslocal computations

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Locally computable enumerations
• Universal semi-local election protocol using forward links
• Enumeration and leader election in partially anonymous and multi-hop broadcast networks
• Graph Transformations
• Analysis of fully distributed splitting and naming probabilistic procedures and applications

Cites work

• scientific article; zbMATH DE number 512941 (Why is no real title available?)
• Coverings and minors: Application to local computations in graphs
• Solvability of the asynchronous ranking problem

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)