Distributed computation in dynamic networks via random walks (Q2345448): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2015.02.044 / 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.1016/j.tcs.2015.02.044 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2492815501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many Random Walks Are Faster Than One / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast byzantine agreement in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order optimal information spreading using algebraic gossip / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parsimonious flooding in dynamic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Information Exchange in the Random Phone-Call Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal adaptive self-stabilizing traversal scheme: random walk and reloading wave / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for algebraic gossip on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flooding Time of Edge-Markovian Evolving Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information spreading in dynamic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple Random Walks in Random Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Distributed Computation in Dynamic Networks via Random Walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Random Walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3546780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Information Spreading in Dynamic Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing network coding gossip made easy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster information dissemination in dynamic networks via network coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed computation in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinated consensus in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4595047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Enumeration of Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Distributed Algorithms for Computing Separable Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight unconditional lower bound on distributed randomwalk computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325545 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2015.02.044 / rank
 
Normal rank

Latest revision as of 02:54, 18 December 2024

scientific article
Language Label Description Also known as
English
Distributed computation in dynamic networks via random walks
scientific article

    Statements

    Distributed computation in dynamic networks via random walks (English)
    0 references
    0 references
    0 references
    0 references
    22 May 2015
    0 references
    dynamic network
    0 references
    distributed algorithm
    0 references
    random walks
    0 references
    random sampling
    0 references
    information dissemination
    0 references
    gossip
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers