An optimal bit complexity randomized distributed MIS algorithm (Q658666): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: DBLP publication ID (P1635): journals/dc/MetivierRSZ11, #quickstatements; #temporary_batch_1731543907597
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Yves Métivier / rank
Normal rank
 
Property / author
 
Property / author: Q228681 / rank
Normal rank
 
Property / author
 
Property / author: Nasser Saheb-Djahromi / rank
Normal rank
 
Property / author
 
Property / author: Akka Zemmari / rank
Normal rank
 
Property / author
 
Property / author: Yves Métivier / rank
 
Normal rank
Property / author
 
Property / author: John Michael Robson / rank
 
Normal rank
Property / author
 
Property / author: Nasser Saheb-Djahromi / rank
 
Normal rank
Property / author
 
Property / author: Akka Zemmari / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00446-010-0121-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2149652607 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59409896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distributed bit complexity of the ring: From the anonymous to the non-anonymous case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3504346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit complexity of breaking and achieving symmetry in chains and rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: What cannot be computed locally! / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of distributed graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring unstructured radio networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Can be Computed Locally? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and Analysis of Distributed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Distributed Algorithms / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/dc/MetivierRSZ11 / rank
 
Normal rank

Latest revision as of 01:30, 14 November 2024

scientific article
Language Label Description Also known as
English
An optimal bit complexity randomized distributed MIS algorithm
scientific article

    Statements

    Identifiers