37 search results - page 1 / 8 » Tight lower bounds for selection in randomly ordered streams |
SODA
2008
ACM
13 years 6 months ago
2008
ACM
ICALP
2009
Springer
14 years 4 months ago
2009
Springer
Estimating frequency moments and Lp distances are well studied problems in the adversarial data stream model and tight space bounds are known for these two problems. There has been...
TALG
2010
13 years 2 months ago
2010
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
ICALP
2007
Springer
13 years 10 months ago
2007
Springer
We present lower bounds on the space required to estimate the quantiles of a stream of numerical values. Quantile estimation is perhaps the most studied problem in the data stream ...
PODS
2006
ACM
14 years 4 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...