Computing Boolean functions on anonymous networks
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 177819
- Computing functions on asynchronous anonymous networks
- scientific article; zbMATH DE number 2006642
- Non trivial computations in anonymous dynamic networks
- Computability in anonymous networks: revocable vs. irrecovable outputs
- Task computability in unreliable anonymous networks
- Computational and symbolic anonymity in an unbounded network
- Distributed Anonymous Discrete Function Computation
Cited in
(21)- Topology recognition with advice
- Comparing Universal Covers in Polynomial Time
- Distributed tree comparison with nodes of limited memory
- How much memory is needed for leader election
- Perfect broadcasting in unlabeled networks
- Computing on anonymous networks with sense of direction
- Almost universal anonymous rendezvous in the plane
- Topology recognition and leader election in colored networks
- Comparing universal covers in polynomial time
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Computing input multiplicity in anonymous synchronous networks with dynamic faults
- Activating anonymous ad hoc radio networks
- Graph endpoint coloring and distributed processing
- Broadcasting in unlabeled hypercubes with a linear number of messages.
- Polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations
- Leader election for anonymous asynchronous agents in arbitrary networks
- Distributed Computing on Anonymous Hypercube Networks
- Distributed computing on transitive networks: the torus
- Assigning labels in an unknown anonymous network with a leader
- Computation on binary tree-networks
- scientific article; zbMATH DE number 177819 (Why is no real title available?)
This page was built for publication: Computing Boolean functions on anonymous networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1341773)
