Quasi-random rumor spreading: reducing randomness can be costly (Q1944078): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Tight bounds for quasirandom rumor spreading / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Realistic analysis of some randomized algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the power of two-point based sampling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3579453 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The shortest-path problem for graphs with random arc-lengths / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Randomized algorithms and pseudorandom numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Time-Randomness Trade-Off for Oblivious Routing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Spreading a Rumor / rank | |||
Normal rank |
Latest revision as of 07:37, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Quasi-random rumor spreading: reducing randomness can be costly |
scientific article |
Statements
Quasi-random rumor spreading: reducing randomness can be costly (English)
0 references
4 April 2013
0 references
randomness in computation
0 references
broadcasting in networks
0 references
quasi-randomness
0 references
randomized algorithms
0 references