A tight unconditional lower bound on distributed randomwalk computation (Q2943404): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1145/1993806.1993853 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043522657 / 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: Consensus algorithms with one-bit messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parsimonious flooding in dynamic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flooding time in edge-Markovian dynamic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting in dynamic radio networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfectly secure message transmission / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowledge and common knowledge in a Byzantine environment: Crash failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault Tolerance in Networks of Bounded Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost-Everywhere Secure Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowledge and common knowledge in a distributed environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal gradient clock synchronization in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient clock synchronization in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed computation in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous consensus via common knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming simultaneous actions using common knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching Agreement in the Presence of Faults / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:55, 10 July 2024

scientific article
Language Label Description Also known as
English
A tight unconditional lower bound on distributed randomwalk computation
scientific article

    Statements

    A tight unconditional lower bound on distributed randomwalk computation (English)
    0 references
    0 references
    0 references
    0 references
    11 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    communication complexity
    0 references
    distributed algorithms
    0 references
    lower bound
    0 references
    random walk
    0 references
    time complexity
    0 references
    0 references