Computing functions on asynchronous anonymous networks (Q4887486): Difference between revisions

@@ Property / cites work @@
+Factors and factorizations of graphs—a survey
@@ Property / cites work: Factors and factorizations of graphs—a survey / 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 on an anonymous ring
@@ Property / cites work: Computing on an anonymous ring / rank @@
+Normal rank
@@ Property / cites work @@
+Two lower bounds in asynchronous distributed computation
+Normal rank
@@ Property / cites work @@
+Q4038697
@@ Property / cites work: Q4038697 / rank @@
+Normal rank
@@ Property / cites work @@
+Gap Theorems for Distributed Computation
@@ Property / cites work: Gap Theorems for Distributed Computation / 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 @@
+Computing functions on asynchronous anonymous networks
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01192691
+Normal rank
@@ Property / OpenAlex ID @@
+W4233528875
@@ Property / OpenAlex ID: W4233528875 / rank @@
+Normal rank