Skip to main content
Article thumbnail
Location of Repository

The Shifting Sands Algorithm

By Andrew Mcgregor and Paul Valiant

Abstract

We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and returns an element whose rank differs from the true median by at most n 1/3+o(1) while storing a constant number of elements and counters at any one time. This is optimal: it was previously shown that achieving better accuracy required poly(n) memory. However, it was conjectured that the lower bound was not tight and that a previous algorithm achieving an n 1/2+o(1) approximation was optimal. We therefore consider the new result a surprising resolution to a natural and basic question.

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.6280
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://people.cs.umass.edu/~mc... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.