Computing functions on asynchronous anonymous networks
From MaRDI portal
Publication:4887486
DOI10.1007/BF01192691zbMATH Open0848.68007OpenAlexW4233528875MaRDI QIDQ4887486FDOQ4887486
Author name not available (Why is that?)
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
Recommendations
Cites Work
- Better computing on the anonymous ring
- Computing on an anonymous ring
- Factors and factorizations of graphs—a survey
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
- Computing functions on asynchronous anonymous networks
- Two lower bounds in asynchronous distributed computation
- Title not available (Why is that?)
- Gap Theorems for Distributed Computation
Cited In (26)
- Weak models of distributed computing, with connections to modal logic
- Title not available (Why is that?)
- Distinguishing views in symmetric networks: a tight lower bound
- Hundreds of impossibility results for distributed computing
- On mobile agent verifiable problems
- Computing Boolean functions on anonymous networks
- Computing in totally anonymous asynchronous shared memory systems
- Title not available (Why is that?)
- Leader election in plane cellular automata, only with left-right global convention
- Computing input multiplicity in anonymous synchronous networks with dynamic faults
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
- Title not available (Why is that?)
- Leader election for anonymous asynchronous agents in arbitrary networks
- Gap Theorems for Distributed Computation
- Labeled versus unlabeled distributed Cayley networks
- Computing functions on asynchronous anonymous networks
- Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry?
- Title not available (Why is that?)
- Symmetries and sense of direction in labeled graphs
- Distributed acyclic orientation of asynchronous anonymous networks
- Knowledge, level of symmetry, and time of leader election
- Computing on a partially eponymous ring
- Certain subgroups of fundamental group of graphs
- Universal dynamic synchronous self-stabilization
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Computing functions on asynchronous anonymous networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887486)
