FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science

Volume 4855 of the series Lecture Notes in Computer Science pp 9-20

Streaming Algorithms for Selection and Approximate Sorting

  • Richard M. KarpAffiliated withInternational Computer Science Institute, Berkeley, USA, and University of California at Berkeley

* Final gross prices may vary according to local VAT.

Get Access


Companies such as Google, Yahoo and Microsoft maintain extremely large data repositories within which searches are frequently conducted. In an article entitled “Data-Intensive Supercomputing: The case for DISC” Randal Bryant describes such data repositories and suggests an agenda for appying them more broadly to massive data set problems of importance to the scientific community and society in general.