New sublinear methods in the struggle against classical problems
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010. === Cataloged from PDF version of thesis. === Includes bibliographical references (p. 129-134). === We study the time and query complexity of approximation algorithms that access only...
Main Author: | Onak, Krzysztof (Krzysztof Piotr) |
---|---|
Other Authors: | Ronitt Rubinfeld. |
Format: | Others |
Language: | English |
Published: |
Massachusetts Institute of Technology
2011
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/62428 |
Similar Items
-
Sublinear algorithms for massive data problems
by: Mahabadi, Sepideh
Published: (2018) -
New directions in sublinear algorithms and testing properties of distributions
by: Gouleakis, Themistoklis
Published: (2019) -
Sublinear algorithms for Earth Mover's Distance
by: Do Ba, Khanh
Published: (2009) -
Sublinear-time algorithms for counting star subgraphs with applications to join selectivity estimation
by: Peebles, John Lee Thompson, Jr
Published: (2016) -
A near-Optimal Sublinear-Time Algorithm for Approximating the Minimum Vertex Cover Size
by: Onak, Krzysztof, et al.
Published: (2012)