|
|
|
|
| LEADER |
01394 am a22002773u 4500 |
| 001 |
70521 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Rubinfeld, Ronitt
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
|e contributor
|
| 100 |
1 |
0 |
|a Rubinfeld, Ronitt
|e contributor
|
| 100 |
1 |
0 |
|a Rubinfeld, Ronitt
|e contributor
|
| 700 |
1 |
0 |
|a Shapira, Asaf
|e author
|
| 245 |
0 |
0 |
|a Sublinear Time Algorithms
|
| 260 |
|
|
|b Society for Industrial and Applied Mathematics,
|c 2012-05-04T22:25:23Z.
|
| 856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/70521
|
| 520 |
|
|
|a Sublinear time algorithms represent a new paradigm in computing, where an algorithm must give some sort of an answer after inspecting only a very small portion of the input. We discuss the types of answers that one can hope to achieve in this setting.
|
| 520 |
|
|
|a National Science Foundation (U.S.) (grant 0732334)
|
| 520 |
|
|
|a National Science Foundation (U.S.) (grant 0728645)
|
| 520 |
|
|
|a Marie Curie International Reintegration Grants (grant PIRG03-GA-2008-231077)
|
| 520 |
|
|
|a Israel Science Foundation (grant 1147/09)
|
| 520 |
|
|
|a Israel Science Foundation (grant 1675/09)
|
| 520 |
|
|
|a National Science Foundation (U.S.) (grant DMS-0901355)
|
| 520 |
|
|
|a Israel Science Foundation (grant 224/11)
|
| 546 |
|
|
|a en_US
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t SIAM Journal on Discrete Mathematics
|
