Distributed enumeration

DOI10.1016/S0020-0190(97)00022-7zbMATH Open1336.68079OpenAlexW2911256705MaRDI QIDQ287005FDOQ287005

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

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

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)

Cites Work

• Solvability of the asynchronous ranking problem
• Coverings and minors: Application to local computations in graphs
• Title not available (Why is that?)

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
• Graph relabelling systems: a tool for encoding, proving, studying and visualizing distributed algorithms
• Drawing maps with advice
• Title not available (Why is that?)
• A self-stabilizing enumeration algorithm.
• Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds
• Election in partially anonymous networks with arbitrary knowledge in message passing systems
• Graph labelings derived from models in distributed computing: A complete complexity classification
• On the smallest grain of salt to get a unique identity
• 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)