Annotations in Data Streams
From MaRDI portal
Publication:3638037
DOI10.1007/978-3-642-02927-1_20zbMath1248.68569OpenAlexW2132588842MaRDI QIDQ3638037
Amit Chakrabarti, Andrew McGregor, Graham Cormode
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
Database theory (68P15) Information storage and retrieval of data (68P20) Online algorithms; streaming algorithms (68W27)
Related Items (8)
A Hierarchy Theorem for Interactive Proofs of Proximity ⋮ The landscape of communication complexity classes ⋮ Zero-information protocols and unambiguity in Arthur-Merlin communication ⋮ Streaming graph computations with a helpful advisor ⋮ Proofs of Proximity for Distribution Testing ⋮ Non-interactive proofs of proximity ⋮ Best-order streaming model ⋮ Arthur-Merlin streaming complexity
This page was built for publication: Annotations in Data Streams
