Two lower bounds in asynchronous distributed computation (Q808249): Difference between revisions

@@ Property / author @@
-Pavol Ďuriš
@@ Property / author: Pavol Ďuriš / rank @@
-Normal rank
@@ Property / author @@
-Zvi Galil
@@ Property / author: Zvi Galil / rank @@
-Normal rank
@@ Property / author @@
+Pavol Ďuriš
@@ Property / author: Pavol Ďuriš / rank @@
+Normal rank
@@ Property / author @@
+Zvi Galil
@@ Property / author: Zvi Galil / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / 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 @@
+Q3769937
@@ Property / cites work: Q3769937 / rank @@
+Normal rank
@@ Property / cites work @@
+An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Distributed Maximum-Finding Algorithms
+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
@@ links / mardi / name / links / mardi / name @@
+Publication:808249