Identifying High-Cardinality Hosts from Network-Wide Traffic Measurements

10.1145/1989493.1989541

10.1145/2213556.2213562

10.1109/TNET.2007.896150

10.1109/Allerton.2011.6120391

muthukrishnan, 2005, What's hot and what's not: Tracking most frequent items dynamically, ACM Trans Database Syst, 30, 249, 10.1145/1061318.1061325

10.1145/1177080.1177099

10.1109/INFCOM.2012.6195691

jayram, 0, Counting distinct elements in a data stream, Proc 6th International Workshop on Randomization and Approximation Techniques in Computer Science, 1

flajolet, 2003, Loglog counting of large cardinalities, Proc Eur Symp Algorithms, 605

flajolet, 0, HyperLogLog: The analysis of a near-optimal cardinality estimation algorithm, Proc Int Conf Anal Algorithms, 127

10.1109/ICNP.2006.320197

10.1093/acprof:oso/9780195385014.001.0001

0

10.1109/INFCOM.2009.5061990

10.1109/INFCOM.2009.5061991

venkataraman, 0, New streaming algorithms for fast detection of superspreaders, Proc Symp Network and Distributed System Security, 149

10.1109/GLOCOM.2009.5426280

10.1109/MCOM.2002.1039860

10.1145/1330107.1330117

estan, 0, New directions in traffic measurement and accounting, Proc Conf Appl Technol Archit Protocols Comput Commun, 323

10.1145/1807085.1807094

10.1561/0400000007

betten, 2006, Error-Correcting Linear Codes Classification by Isometry and Applications (Algorithms and Computation in Mathematics)

10.1002/cpa.20124

do ba, 0, Lower bounds for sparse recovery, Proc Annu ACM-SIAM Symp Discrete Algorithm, 1190

0

10.1109/TIT.2006.871582