A faster exact-counting protocol for anonymous dynamic networks (Q1755728): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fault-tolerant aggregation: flow-updating meets mass-distribution / 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: Non Trivial Computations in Anonymous Dynamic Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact mixing times for random walks on trees / 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: An early-stopping protocol for computing aggregate functions in Sensor Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed computation in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Naming and Counting in Anonymous Unknown Dynamic Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Causality, influence, and computation in possibly disconnected synchronous dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5363819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Distributed Averaging Algorithms and Quantization Effects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate counting, uniform generation and rapidly mixing Markov chains / rank
 
Normal rank

Latest revision as of 19:44, 17 July 2024

scientific article
Language Label Description Also known as
English
A faster exact-counting protocol for anonymous dynamic networks
scientific article

    Statements

    A faster exact-counting protocol for anonymous dynamic networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 January 2019
    0 references
    anonymous dynamic networks
    0 references
    counting
    0 references
    distributed algorithms
    0 references
    time-varying graphs
    0 references

    Identifiers