Many Random Walks Are Faster Than One (Q5199503): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the cover time of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the time taken by random walks on finite groups to visit every state / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal randomised logarithmic time connectivity algorithm for the EREW PRAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight lower bound on the cover time for random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight upper bound on the cover time for random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering times of random walks on bounded degree trees and other graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering problems for Brownian motion on spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Connected Components Algorithms for the EREW PRAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the cover time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i> (log( <i>n</i> ) <sup>4/3</sup> ) space algorithm for ( <i>s, t</i> ) connectivity in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spectrum of time-space trade-offs for undirected \(s-t\) connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold limits for cover times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for covering times for reversible Markov chains and random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Cover Time for Random Walks on Random Graphs / rank
 
Normal rank

Latest revision as of 08:58, 4 July 2024

scientific article; zbMATH DE number 5938540
Language Label Description Also known as
English
Many Random Walks Are Faster Than One
scientific article; zbMATH DE number 5938540

    Statements

    Many Random Walks Are Faster Than One (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 August 2011
    0 references
    distributed computing
    0 references

    Identifiers