Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Information Processing Letters
Theoretical Computer Science - Special issue on complexity theory and the theory of algorithms as developed in the CIS
Communication complexity
The space complexity of approximating the frequency moments
Journal of Computer and System Sciences
External memory algorithms
Reductions in streaming algorithms, with an application to counting triangles in graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On the Distributional Complexity of Disjontness
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Tabulation based 4-universal hashing with applications to second moment estimation
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Finding frequent items in data streams
Theoretical Computer Science - Special issue on automata, languages and programming
On the Streaming Model Augmented with a Sorting Primitive
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
An improved data stream summary: the count-min sketch and its applications
Journal of Algorithms
Trading off space for passes in graph streaming problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On graph problems in a semi-streaming model
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Randomized computations on large data sets: tight lower bounds
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Counting triangles in data streams
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Lower bounds for randomized read/write stream algorithms
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
CADS: continuous authentication on data streams
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Proof-infused streams: enabling authentication of sliding window queries on streams
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Robust lower bounds for communication and stream computation
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Algebrization: a new barrier in complexity theory
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Complexity classes in communication complexity theory
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
On the Value of Multiple Read/Write Streams for Approximating Frequency Moments
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Randomized Synopses for Query Assurance on Data Streams
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
New streaming algorithms for counting triangles in graphs
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Adapting parallel algorithms to the W-stream model, with applications to graph problems
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Theoretical Computer Science
Theory of data stream computing: where to go
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Verifying computations with streaming interactive proofs
Proceedings of the VLDB Endowment
Practical verified computation with streaming interactive proofs
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Streaming computations with a loquacious prover
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Lightweight authentication of linear algebraic queries on data streams
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Arthur-Merlin streaming complexity
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Hi-index | 0.00 |
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database and data stream processing, we ask whether the space usage of such algorithms be further reduced by enlisting a more powerful "helper" who can annotate the stream as it is read. We do not wish to blindly trust the helper, so we require that the algorithm be convinced of having computed a correct answer. We show upper bounds that achieve a non-trivial tradeoff between the amount of annotation used and the space required to verify it. We also prove lower bounds on such tradeoffs, often nearly matching the upper bounds, via notions related to Merlin-Arthur communication complexity. Our results cover the classic data stream problems of selection, frequency moments, and fundamental graph problems such as triangle-freeness and connectivity. Our work is also part of a growing trend -- including recent studies of multi-pass streaming, read/write streams and randomly ordered streams -- of asking more complexity-theoretic questions about data stream processing. It is a recognition that, in addition to practical relevance, the data stream model raises many interesting theoretical questions in its own right.