Computing on anonymous networks with sense of direction
From MaRDI portal
Publication:1399995
DOI10.1016/S0304-3975(02)00592-3zbMATH Open1028.68050MaRDI QIDQ1399995FDOQ1399995
P. Flocchini, Alessandro Roncato, N. Santoro
Publication date: 30 July 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Computing Boolean functions on anonymous networks
- Computing on an anonymous ring
- Towards optimal distributed election on chordal rings
- On the impact of sense of direction on message complexity
- Labeled versus unlabeled distributed Cayley networks
- Distributed computing on transitive networks: The torus
- Symmetries and sense of direction in labeled graphs
- Easy impossibility proofs for distributed consensus problems
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
- Efficient leader election using sense of direction
- Sense of direction: Definitions, properties, and classes
- Complexity of Deciding Sense of Direction
- TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION
- Distributed Computing on Anonymous Hypercube Networks
- Backward consistency and sense of direction in advanced distributed systems
- Gap Theorems for Distributed Computation
Cited In (7)
- Weak models of distributed computing, with connections to modal logic
- Coverings that preserve sense of direction
- Distinguishing views in symmetric networks: a tight lower bound
- OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT
- Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry?
- Symmetries and sense of direction in labeled graphs
- Sense of direction in distributed computing
This page was built for publication: Computing on anonymous networks with sense of direction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399995)
