Computing functions on asynchronous anonymous networks
From MaRDI portal
Publication:4887486
Recommendations
Cites work
- scientific article; zbMATH DE number 177819 (Why is no real title available?)
- Better computing on the anonymous ring
- Computing functions on asynchronous anonymous networks
- Computing on an anonymous ring
- Factors and factorizations of graphs—a survey
- Gap Theorems for Distributed Computation
- Two lower bounds in asynchronous distributed computation
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
Cited in
(28)- Computing Boolean functions on anonymous networks
- scientific article; zbMATH DE number 1696529 (Why is no real title available?)
- Symmetries and sense of direction in labeled graphs
- Distributed computing on transitive networks: the torus
- Gossiping and broadcasting versus computing functions in networks
- scientific article; zbMATH DE number 2086249 (Why is no real title available?)
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
- scientific article; zbMATH DE number 3990833 (Why is no real title available?)
- Computing input multiplicity in anonymous synchronous networks with dynamic faults
- Universal dynamic synchronous self-stabilization
- Distributed acyclic orientation of asynchronous anonymous networks
- Computability in anonymous networks: revocable vs. irrecovable outputs
- Hundreds of impossibility results for distributed computing
- Setting ports in an anonymous network: how to reduce the level of symmetry?
- Gap Theorems for Distributed Computation
- Weak models of distributed computing, with connections to modal logic
- scientific article; zbMATH DE number 4026814 (Why is no real title available?)
- scientific article; zbMATH DE number 177819 (Why is no real title available?)
- scientific article; zbMATH DE number 2006642 (Why is no real title available?)
- Distinguishing views in symmetric networks: a tight lower bound
- Certain subgroups of fundamental group of graphs
- Computing functions on asynchronous anonymous networks
- Labeled versus unlabeled distributed Cayley networks
- Computing in totally anonymous asynchronous shared memory systems
- Leader election for anonymous asynchronous agents in arbitrary networks
- Computing on a partially eponymous ring
- On mobile agent verifiable problems
- Leader election in plane cellular automata, only with left-right global convention
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)
