Streaming computations with a loquacious prover

  title={Streaming computations with a loquacious prover},
  author={Hartmut Klauck and Ved Prakash},
We define a new model of data streaming algorithms that employ a prover/helper to outsource difficult computations in a verifiable way. While for the verifier the usual time (per symbol read) and space constraints of the data streaming model are in place, the prover has unbounded space. Both parties cannot look into the future (i.e., do not know data arriving later). Previous work on such models either severely restricted the total communication between the prover and the verifier, or extended… CONTINUE READING
Highly Cited
This paper has 21 citations. REVIEW CITATIONS


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 11 references

A Note on Randomized Streaming Space Bounds for the Longest Increasing Subsequence Problem

Electronic Colloquium on Computational Complexity • 2010
View 5 Excerpts
Highly Influenced

Longest increasing subsequences: From patience sorting to the baik-deift johansson theorem

D. Aldous, P. Diaconis
Bulleting of the American Mathematical Society, • 1999
View 5 Excerpts
Highly Influenced

Probabilistic Machines Can Use Less Running Time

IFIP Congress • 1977
View 8 Excerpts
Highly Influenced

Annotations in Data Streams

View 7 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…