Stephen R. Chestnut

activity

20102016

ℓ_{2}

heavy hitters algorithm using constant memory

10 citations · 23 across the 8 of their papers we have counts for

collaborators

Showing 2015 · cs.DSShow all

3 papers · 2 filters

cs.DS2015

Hardness and Approximation for Network Flow Interdiction

Stephen R. Chestnut, Rico Zenklusen

In the Network Flow Interdiction problem an adversary attacks a network in order to minimize the maximum s-t-flow. Very little is known about the approximatibility of this problem…

cs.DS2015

Beating CountSketch for Heavy Hitters in Insertion Streams

Vladimir Braverman, Stephen R. Chestnut, Nikita Ivkin +1

Given a stream $p_{1}, \dots, p_{m}$ of items from a universe $U$ , which, without loss of generality we identify with the set of integers ${1, 2, \dots, n}$ , we consider…

cs.DS2015★ 6 cited

Streaming Symmetric Norms via Measure Concentration

Jaroslaw Blasiok, Vladimir Braverman, Stephen R. Chestnut +2

We characterize the streaming space complexity of every symmetric norm $l$ (a norm on $R^{n}$ invariant under sign-flips and coordinate-permutations), by relating this space…