The following pages link to Computing on an anonymous ring (Q3813292):
Displaying 50 items.
- Topology recognition with advice (Q259077) (← links)
- Minimal sense of direction in regular networks (Q290224) (← links)
- Anonymous asynchronous systems: the case of failure detectors (Q360279) (← links)
- Computing with infinitely many processes (Q391645) (← links)
- Knowledge, level of symmetry, and time of leader election (Q498667) (← links)
- A knowledge-based analysis of global function computation (Q660991) (← links)
- How much memory is needed for leader election (Q661049) (← links)
- Anonymous wireless rings (Q673090) (← links)
- Message terminating algorithms for anonymous rings of unknown size (Q673475) (← links)
- Wang tilings and distributed verification on anonymous torus networks (Q675863) (← links)
- Two lower bounds in asynchronous distributed computation (Q808249) (← links)
- On the complexity of computation in the presence of link failures: The case of a ring (Q808251) (← links)
- New lower bound techniques for distributed leader finding and other problems on rings of processors (Q808701) (← links)
- Finding routes in anonymous sensor networks (Q844177) (← links)
- Randomized function evaluation on a ring (Q916384) (← links)
- Computing on a partially eponymous ring (Q1004322) (← links)
- On the round complexity of Byzantine agreement without initial set-up (Q1044183) (← links)
- Language complexity on the synchronous anonymous ring (Q1102125) (← links)
- Perfect broadcasting in unlabeled networks (Q1270770) (← links)
- Symmetries and sense of direction in labeled graphs (Q1270775) (← links)
- Self-stabilizing ring orientation using constant space (Q1271475) (← links)
- Rapid convergence of a local load balancing algorithm for asynchronous rings (Q1292435) (← links)
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths (Q1343157) (← links)
- Tight bounds for synchronous communication of information using bits and silence (Q1399118) (← links)
- Computing on anonymous networks with sense of direction (Q1399995) (← links)
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds (Q1741851) (← links)
- Impact of knowledge on election time in anonymous networks (Q1755789) (← links)
- Improved bounds on equilibria solutions in the network design game (Q1757081) (← links)
- Computing in totally anonymous asynchronous shared memory systems (Q1854512) (← links)
- Sense of direction in distributed computing (Q1870525) (← links)
- Labeled versus unlabeled distributed Cayley networks (Q1917232) (← links)
- How to meet when you forget: log-space rendezvous in arbitrary graphs (Q1938363) (← links)
- Activating anonymous ad hoc radio networks (Q1954211) (← links)
- Simple and fast approximate counting and leader election in populations (Q2139094) (← links)
- Consensus in anonymous asynchronous systems with crash-recovery and omission failures (Q2244065) (← links)
- Leader election for anonymous asynchronous agents in arbitrary networks (Q2251147) (← links)
- Graphs with prescribed local neighborhoods of their universal coverings (Q2312618) (← links)
- Analysis of fully distributed splitting and naming probabilistic procedures and applications (Q2345463) (← links)
- Broadcasting in unlabeled hypercubes with a linear number of messages. (Q2583557) (← links)
- Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications (Q2868641) (← links)
- Multicast Network Design Game on a Ring (Q3467862) (← links)
- An Algorithmic Theory of Mobile Agents (Q3608454) (← links)
- On the Microscopic View of Time and Messages (Q4686647) (← links)
- Computing functions on asynchronous anonymous networks (Q4887486) (← links)
- (Q5090892) (← links)
- Distributed computing on transitive networks: The torus (Q5096163) (← links)
- Assigning labels in an unknown anonymous network with a leader (Q5138359) (← links)
- Distributed computing on oriented anonymous hypercubes with faulty components (Q5138360) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Distributed tree comparison with nodes of limited memory (Q5326772) (← links)
