Algorithms and lower bounds in the streaming and sparse recovery models
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012. === Cataloged from PDF version of thesis. === Includes bibliographical references (p. 52-56). === In the data stream computation model, input data is given to us sequentially (the data...
Main Author: | Do Ba, Khanh |
---|---|
Other Authors: | Piotr Indyk. |
Format: | Others |
Language: | English |
Published: |
Massachusetts Institute of Technology
2012
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/75629 |
Similar Items
-
Algorithms and lower bounds for sparse recovery
by: Price, Eric (Eric C.)
Published: (2011) -
Reducibility and computational lower bounds for problems with planted sparse structure
by: Brennan, Matthew (Matthew Stewart)
Published: (2018) -
Lower bounds for sparse recovery
by: Indyk, Piotr, et al.
Published: (2011) -
Algorithms and lower bounds in finite automata size complexity
by: Kapoutsis, Christos, 1974-
Published: (2007) -
Sparse recovery and Fourier sampling
by: Price, Eric C
Published: (2014)