How much memory is needed for leader election (Q661049): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00446-011-0131-y
+Normal rank
@@ Property / OpenAlex ID @@
+W1992598604
@@ Property / OpenAlex ID: W1992598604 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing on an anonymous ring
@@ Property / cites work: Computing on an anonymous ring / rank @@
+Normal rank
@@ Property / cites work @@
+Better computing on the anonymous ring
@@ Property / cites work: Better computing on the anonymous ring / rank @@
+Normal rank
@@ Property / cites work @@
+Computing anonymously with arbitrary knowledge
@@ Property / cites work: Computing anonymously with arbitrary knowledge / rank @@
+Normal rank
@@ Property / cites work @@
+SOFSEM 2005: Theory and Practice of Computer Science
+Normal rank
@@ Property / cites work @@
+Labelled (Hyper)Graphs, Negotiations and the Naming Problem
+Normal rank
@@ Property / cites work @@
+Foundations of Software Science and Computation Structures
+Normal rank
@@ Property / cites work @@
+Space Lower Bounds for Maze Threadability on Restricted Machines
+Normal rank
@@ Property / cites work @@
+How to meet when you forget
@@ Property / cites work: How to meet when you forget / rank @@
+Normal rank
@@ Property / cites work @@
+Anonymous wireless rings
@@ Property / cites work: Anonymous wireless rings / rank @@
+Normal rank
@@ Property / cites work @@
+Q4825703
@@ Property / cites work: Q4825703 / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting and election in anonymous asynchronous rings.
+Normal rank
@@ Property / cites work @@
+Q4535803
@@ Property / cites work: Q4535803 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4736828
@@ Property / cites work: Q4736828 / rank @@
+Normal rank
@@ Property / cites work @@
+STACS 2004
@@ Property / cites work: STACS 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic Rendezvous in Trees with Little Memory
+Normal rank
@@ Property / cites work @@
+Delays Induce an Exponential Memory Gap for Rendezvous in Trees
+Normal rank
@@ Property / cites work @@
+Electing a leader in a synchronous ring
@@ Property / cites work: Electing a leader in a synchronous ring / rank @@
+Normal rank
@@ Property / cites work @@
+Proving Distributed Algorithms for Mobile Agents: Examples of Spanning Tree Computation in Anonymous Networks
+Normal rank
@@ Property / cites work @@
+Decentralized extrema-finding in circular configurations of processors
+Normal rank
@@ Property / cites work @@
+Universal traversal sequences with backtracking.
@@ Property / cites work: Universal traversal sequences with backtracking. / rank @@
+Normal rank
@@ Property / cites work @@
+Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
+Normal rank
@@ Property / cites work @@
+Computing Boolean functions on anonymous networks
@@ Property / cites work: Computing Boolean functions on anonymous networks / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized Rendez-Vous with Limited Memory
@@ Property / cites work: Randomized Rendez-Vous with Limited Memory / rank @@
+Normal rank
@@ Property / cites work @@
+Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
+Normal rank
@@ Property / cites work @@
+An             <i>O</i>             (             <i>n</i>             log             <i>n</i>             ) Unidirectional Algorithm for the Circular Extrema Problem
+Normal rank
@@ Property / cites work @@
+Undirected connectivity in log-space
@@ Property / cites work: Undirected connectivity in log-space / rank @@
+Normal rank
@@ Property / cites work @@
+Comparison of initial conditions for distributed algorithms on anonymous networks
+Normal rank
@@ Property / cites work @@
+Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
+Normal rank