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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ic.2013.10.005 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2013.10.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2151519507 / 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: Bit complexity of breaking and achieving symmetry in chains and rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Distributed Complexity of Computing Maximal Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for maximal matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple distributed \(\Delta+1\)-coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing / 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: 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: About randomised distributed graph colouring and graph partition algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal bit complexity randomized distributed MIS algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal independent sets in radio networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Distributed Algorithms / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IC.2013.10.005 / rank
 
Normal rank

Latest revision as of 16:13, 9 December 2024

scientific article
Language Label Description Also known as
English
Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings
scientific article

    Statements

    Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings (English)
    0 references
    10 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references