Computing on anonymous networks with sense of direction
From MaRDI portal
Publication:1399995
DOI10.1016/S0304-3975(02)00592-3zbMath1028.68050MaRDI QIDQ1399995
Paola Flocchini, Alessandro Roncato, Nicola Santoro
Publication date: 30 July 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
Weak models of distributed computing, with connections to modal logic ⋮ 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 ⋮ Sense of direction in distributed computing
Cites Work
- On the impact of sense of direction on message complexity
- Easy impossibility proofs for distributed consensus problems
- Towards optimal distributed election on chordal rings
- Symmetries and sense of direction in labeled graphs
- Computing Boolean functions on anonymous networks
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
- Labeled versus unlabeled distributed Cayley networks
- Backward consistency and sense of direction in advanced distributed systems
- Distributed Computing on Anonymous Hypercube Networks
- Computing on an anonymous ring
- Gap Theorems for Distributed Computation
- Sense of direction: Definitions, properties, and classes
- Complexity of Deciding Sense of Direction
- Distributed computing on transitive networks: The torus
- Efficient leader election using sense of direction
- TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION
This page was built for publication: Computing on anonymous networks with sense of direction
