Annotations in Data Streams
From MaRDI portal
Publication:4962165
DOI10.1145/2636924zbMath1398.68168OpenAlexW2128633442MaRDI QIDQ4962165
Justin Thaler, Andrew McGregor, Graham Cormode, Amit Chakrabarti
Publication date: 30 October 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2636924
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items (6)
Zero-information protocols and unambiguity in Arthur-Merlin communication ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An Exponential Separation Between MA and AM Proofs of Proximity ⋮ An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity ⋮ Verifiable Stream Computation and Arthur--Merlin Communication
This page was built for publication: Annotations in Data Streams