Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings (Q391647): Difference between revisions

@@ Property / DOI @@
-.1016/j.ic.2013.10.005
@@ Property / DOI: 10.1016/j.ic.2013.10.005 / rank @@
-Normal rank
@@ Property / author @@
+Allyx Fontaine
@@ Property / author: Allyx Fontaine / rank @@
+Normal rank
@@ Property / author @@
+Yves Métivier
@@ Property / author: Yves Métivier / rank @@
+Normal rank
@@ Property / author @@
+John Michael Robson
@@ Property / author: John Michael Robson / rank @@
+Normal rank
@@ Property / author @@
+Akka Zemmari
@@ Property / author: Akka Zemmari / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ic.2013.10.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2151519507
@@ Property / OpenAlex ID: W2151519507 / rank @@
+Normal rank
@@ Property / cites work @@
+A fast and simple randomized parallel algorithm for the maximal independent set problem
+Normal rank
@@ Property / cites work @@
+The distributed bit complexity of the ring: From the anonymous to the non-anonymous case
+Normal rank
@@ Property / cites work @@
+Bit complexity of breaking and achieving symmetry in chains and rings
+Normal rank
@@ Property / cites work @@
+On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms
+Normal rank
@@ Property / cites work @@
+On the Distributed Complexity of Computing Maximal Matchings
+Normal rank
@@ Property / cites work @@
+A fast and simple randomized parallel algorithm for maximal matching
+Normal rank
@@ Property / cites work @@
+Simple distributed \(\Delta+1\)-coloring of graphs
+Normal rank
@@ Property / cites work @@
+Distributed Computing
@@ Property / cites work: Distributed Computing / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of distributed graph coloring
@@ Property / cites work: On the complexity of distributed graph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Locality in Distributed Graph Algorithms
@@ Property / cites work: Locality in Distributed Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A Simple Parallel Algorithm for the Maximal Independent Set Problem
+Normal rank
@@ Property / cites work @@
+Q3126969
@@ Property / cites work: Q3126969 / rank @@
+Normal rank
@@ Property / cites work @@
+About randomised distributed graph colouring and graph partition algorithms
+Normal rank
@@ Property / cites work @@
+An optimal bit complexity randomized distributed MIS algorithm
+Normal rank
@@ Property / cites work @@
+Maximal independent sets in radio networks
@@ Property / cites work: Maximal independent sets in radio networks / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed Computing: A Locality-Sensitive Approach
+Normal rank
@@ Property / cites work @@
+Introduction to Distributed Algorithms
@@ Property / cites work: Introduction to Distributed Algorithms / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IC.2013.10.005
@@ Property / DOI: 10.1016/J.IC.2013.10.005 / rank @@
+Normal rank