Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > MERLIN-ARTHUR COMMUNICATION COMPLEXITY:
Reports tagged with Merlin-Arthur communication complexity:
TR11-105 | 22nd July 2011
Graham Cormode, Michael Mitzenmacher, Justin Thaler

Streaming Graph Computations with a Helpful Advisor

Revisions: 1

Motivated by the trend to outsource work to commercial cloud computing services, we consider a variation of the streaming paradigm where a streaming algorithm can be assisted by a powerful helper that can provide annotations to the data stream. We extend previous work on such annotation models by considering a ... more >>>


TR12-022 | 14th March 2012
Amit Chakrabarti, Graham Cormode, Andrew McGregor, Justin Thaler

Annotations in Data Streams

Revisions: 1

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 can be further reduced by enlisting a more powerful ... more >>>




ISSN 1433-8092 | Imprint