Computing functions on asynchronous anonymous networks
From MaRDI portal
Publication:4887486
DOI10.1007/BF01192691zbMath0848.68007OpenAlexW4233528875MaRDI QIDQ4887486
No author found.
Publication date: 5 August 1996
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01192691
Related Items (15)
Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths ⋮ Leader election in plane cellular automata, only with left-right global convention ⋮ Labeled versus unlabeled distributed Cayley networks ⋮ Computing input multiplicity in anonymous synchronous networks with dynamic faults ⋮ Computing functions on asynchronous anonymous networks ⋮ Universal dynamic synchronous self-stabilization ⋮ Hundreds of impossibility results for distributed computing ⋮ Knowledge, level of symmetry, and time of leader election ⋮ On mobile agent verifiable problems ⋮ Leader election for anonymous asynchronous agents in arbitrary networks ⋮ Weak models of distributed computing, with connections to modal logic ⋮ Computing on a partially eponymous ring ⋮ Symmetries and sense of direction in labeled graphs ⋮ Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry? ⋮ Distinguishing views in symmetric networks: a tight lower bound
Cites Work
- Unnamed Item
- Two lower bounds in asynchronous distributed computation
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
- Better computing on the anonymous ring
- Factors and factorizations of graphs—a survey
- Computing on an anonymous ring
- Gap Theorems for Distributed Computation
- Computing functions on asynchronous anonymous networks
This page was built for publication: Computing functions on asynchronous anonymous networks
