On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms (Q2938103): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Allyx Fontaine / rank
Normal rank
 
Property / author
 
Property / author: Yves Métivier / rank
Normal rank
 
Property / author
 
Property / author: Q228681 / rank
Normal rank
 
Property / author
 
Property / author: Akka Zemmari / rank
Normal rank
 
Property / author
 
Property / author: Allyx Fontaine / 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: 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/978-3-319-04298-5_21 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W63554089 / rank
 
Normal rank

Latest revision as of 22:42, 19 March 2024

scientific article
Language Label Description Also known as
English
On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms
scientific article

    Statements

    On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms (English)
    0 references
    13 January 2015
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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