Annotations in Data Streams

DOI10.1007/978-3-642-02927-1_20MaRDI QIDQ3638037zbMATH OpenOpenAlexFDO

Authors Amit Chakrabarti, Graham Cormode, Andrew McGregor

Publication date 14 July 2009

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.175.1894

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20) Online algorithms; streaming algorithms (68W27)

Recommendations

• Annotations in data streams
• Annotations for Sparse Data Streams
• Semi-streaming algorithms for annotated graph streams
• Data streams and applications in computer science

Cited in

(13)

• The landscape of communication complexity classes
• Non-interactive proofs of proximity
• Arthur-Merlin streaming complexity
• Streaming computations with a loquacious prover
• Zero-information protocols and unambiguity in Arthur-Merlin communication
• Semi-streaming algorithms for annotated graph streams
• A hierarchy theorem for interactive proofs of proximity
• Annotations in data streams
• Proofs of proximity for distribution testing
• Best-order streaming model
• Annotations for Sparse Data Streams
• Streaming zero-knowledge proofs
• New lower bounds in Merlin-Arthur communication and graph streaming verification

This page was built for publication: Annotations in Data Streams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638037)