David Felber

most citedA randomized online quantile summary in

O (\frac{1}{ε} lo g \frac{1}{ε})

words

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2015★ 1 cited

A randomized online quantile summary in $O (\frac{1}{ε} lo g \frac{1}{ε})$ words

David Felber, Rafail Ostrovsky

A quantile summary is a data structure that approximates to $ε$ -relative error the order statistics of a much larger underlying dataset. In this paper we develop a random…

cs.DS2015

Variability in data streams

David Felber, Rafail Ostrovsky

We consider the problem of tracking with small relative error an integer function $f (n)$ defined by a distributed update stream $f^{'} (n)$ . Existing streaming algorithms with worst-ca…

cs.DS2011

Scheduling under Precedence, Communication, and Energy Constraints

David Felber, Adam Meyerson

We consider the problem of scheduling a set of $n$ tasks on $m$ processors under precedence, communication, and global system energy constraints to minimize makespan. We extend exi…

A randomized online quantile summary in O(ε1​logε1​) words

Variability in data streams

Scheduling under Precedence, Communication, and Energy Constraints

A randomized online quantile summary in $O (\frac{1}{ε} lo g \frac{1}{ε})$ words