Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks

We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k players, each holding a counter n i that gets incremented over time, and the goal is to track an ε -approximation of thei...

Celý popis

Podrobná bibliografie

Vydáno v:	Algorithmica Ročník 81; číslo 6; s. 2222 - 2243
Hlavní autoři:	Huang, Zengfeng, Yi, Ke, Zhang, Qin
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.06.2019 Springer Nature B.V
Témata:	Algorithm Analysis and Problem Complexity Algorithms Communication Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Finishes Lower bounds Mathematics of Computing Randomization Theory of Computation Tracking problem Continuous distributed tracking Distributed streaming Randomized algorithms
ISSN:	0178-4617, 1432-0541
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!