Computing on an anonymous ring
From MaRDI portal
Recommendations
Cited in
(68)- Computing on a partially eponymous ring
- On the round complexity of Byzantine agreement without initial set-up
- Language complexity on the synchronous anonymous ring
- Perfect broadcasting in unlabeled networks
- Symmetries and sense of direction in labeled graphs
- Self-stabilizing ring orientation using constant space
- Rapid convergence of a local load balancing algorithm for asynchronous rings
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
- Tight bounds for synchronous communication of information using bits and silence
- Computing on anonymous networks with sense of direction
- Sorting and election in anonymous asynchronous rings.
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds
- Impact of knowledge on election time in anonymous networks
- Improved bounds on equilibria solutions in the network design game
- Computing in totally anonymous asynchronous shared memory systems
- Sense of direction in distributed computing
- Labeled versus unlabeled distributed Cayley networks
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Activating anonymous ad hoc radio networks
- Simple and fast approximate counting and leader election in populations
- Consensus in anonymous asynchronous systems with crash-recovery and omission failures
- Leader election for anonymous asynchronous agents in arbitrary networks
- Graphs with prescribed local neighborhoods of their universal coverings
- Analysis of fully distributed splitting and naming probabilistic procedures and applications
- Broadcasting in unlabeled hypercubes with a linear number of messages.
- Topology recognition with advice
- Analysis of fully distributed splitting and naming probabilistic procedures and applications (extended abstract)
- Minimal sense of direction in regular networks
- Better computing on the anonymous ring
- Multicast network design game on a ring
- String recognition on anonymous rings
- Anonymous asynchronous systems: the case of failure detectors
- An Algorithmic Theory of Mobile Agents
- scientific article; zbMATH DE number 4058846 (Why is no real title available?)
- Computing with infinitely many processes
- Gap Theorems for Distributed Computation
- scientific article; zbMATH DE number 2006642 (Why is no real title available?)
- On the microscopic view of time and messages
- Computing functions on asynchronous anonymous networks
- scientific article; zbMATH DE number 7561256 (Why is no real title available?)
- Distributed computing on transitive networks: the torus
- Assigning labels in an unknown anonymous network with a leader
- Distributed computing on oriented anonymous hypercubes with faulty components
- Hundreds of impossibility results for distributed computing
- Distributed tree comparison with nodes of limited memory
- Learning a ring cheaply and fast
- Weak models of distributed computing, with connections to modal logic
- On recognizing a string on an anonymous ring
- Topology recognition and leader election in colored networks
- Almost universal anonymous rendezvous in the plane
- Four shades of deterministic leader election in anonymous networks
- Uniform atomic broadcast and consensus in fully anonymous synchronous systems with crash failures
- Variations of the Itai-Rodeh Algorithm for Computing Anonymous Ring Size
- A knowledge-based analysis of global function computation
- How much memory is needed for leader election
- The topology of randomized symmetry-breaking distributed computing
- Anonymous wireless rings
- Message terminating algorithms for anonymous rings of unknown size
- Wang tilings and distributed verification on anonymous torus networks
- Minimum algorithm sizes for the gathering and related problems of autonomous mobile robots
- Brief announcement: Content-oblivious leader election on rings
- Content-oblivious leader election on rings
- Two lower bounds in asynchronous distributed computation
- On the complexity of computation in the presence of link failures: The case of a ring
- New lower bound techniques for distributed leader finding and other problems on rings of processors
- Finding routes in anonymous sensor networks
- Scattering on a ring of processors
- Randomized function evaluation on a ring
This page was built for publication: Computing on an anonymous ring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3813292)
