An Optimal Algorithm for Large Frequency Moments Using O(n^(1-2/k)) Bits. - Vladimir Braverman; Jonathan Katzman; Charles Seidell; Gregory Vorsanger (APPROX-RANDOM, 2014)

Sampling from Dense Streams without Penalty - Improved Bounds for Frequency Moments and Heavy Hitters. - Vladimir Braverman; Gregory Vorsanger (COCOON, 2014)

Approximating Large Frequency Moments with O(n1-2/k) Bits. - Vladimir Braverman; Jonathan Katzman; Charles Seidell; Gregory Vorsanger (CoRR, 2014)

Enabling a "RISC" Approach for Software-Defined Monitoring using Universal Streaming. - Zaoxing Liu; Gregory Vorsanger; Vladimir Braverman; Vyas Sekar (HotNets, 2015)

Weighted sampling without replacement from data streams. - Vladimir Braverman; Rafail Ostrovsky; Gregory Vorsanger (Inf. Process. Lett., 2015)

Approximating Subadditive Hadamard Functions on Implicit Matrices. - Vladimir Braverman; Alan Roytman; Gregory Vorsanger (APPROX-RANDOM, 2016)

One Sketch to Rule Them All: Rethinking Network Flow Monitoring with UnivMon. - Zaoxing Liu; Antonis Manousis; Gregory Vorsanger; Vyas Sekar; Vladimir Braverman (SIGCOMM, 2016)