Gregory Vorsanger

According to our database, Gregory Vorsanger authored at least 7 papers between 2014 and 2016.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2016

One Sketch to Rule Them All: Rethinking Network Flow Monitoring with UnivMon.

Zaoxing Liu, Antonis Manousis, Gregory Vorsanger, Vyas Sekar, Vladimir Braverman

Proceedings of the ACM SIGCOMM 2016 Conference, Florianopolis, Brazil, August 22-26, 2016, 2016

Approximating Subadditive Hadamard Functions on Implicit Matrices.

Vladimir Braverman, Alan Roytman, Gregory Vorsanger

Proceedings of the Approximation, 2016

2015

Weighted sampling without replacement from data streams.

Vladimir Braverman, Rafail Ostrovsky, Gregory Vorsanger

Inf. Process. Lett., 2015

Enabling a "RISC" Approach for Software-Defined Monitoring using Universal Streaming.

Zaoxing Liu, Gregory Vorsanger, Vladimir Braverman, Vyas Sekar

Proceedings of the 14th ACM Workshop on Hot Topics in Networks, Philadelphia, PA, USA, November 16, 2015

2014

Approximating Large Frequency Moments with O(n^1-2/k) Bits.

Vladimir Braverman, Jonathan Katzman, Charles Seidell, Gregory Vorsanger

CoRR, 2014

Sampling from Dense Streams without Penalty - Improved Bounds for Frequency Moments and Heavy Hitters.

Vladimir Braverman, Gregory Vorsanger

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

An Optimal Algorithm for Large Frequency Moments Using O(n^(1-2/k)) Bits.

Vladimir Braverman, Jonathan Katzman, Charles Seidell, Gregory Vorsanger

Proceedings of the Approximation, 2014