Separating Adaptive Streaming from Oblivious Streaming

01/26/2021
by   Haim Kaplan, et al.
0

We present a streaming problem for which every adversarially-robust streaming algorithm must use polynomial space, while there exists a classical (oblivious) streaming algorithm that uses only polylogarithmic space. This is the first separation between oblivious streaming and adversarially-robust streaming, and resolves one of the central open questions in adversarial robust streaming.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/27/2020

Improved Algorithms for Edge Colouring in the W-Streaming Model

In the W-streaming model, an algorithm is given O(n polylog n) space and...
research
06/08/2021

A Quantum Advantage for a Natural Streaming Problem

Data streaming, in which a large dataset is received as a "stream" of up...
research
09/25/2019

Streaming PTAS for Binary ℓ_0-Low Rank Approximation

We give a 3-pass, polylog-space streaming PTAS for the constrained binar...
research
03/31/2020

A Framework for Adversarially Robust Streaming Algorithms

We investigate the adversarial robustness of streaming algorithms. In th...
research
01/22/2023

Relaxed Models for Adversarial Streaming: The Advice Model and the Bounded Interruptions Model

Streaming algorithms are typically analyzed in the oblivious setting, wh...
research
10/01/2020

StreamSoNG: A Soft Streaming Classification Approach

Examining most streaming clustering algorithms leads to the understandin...
research
07/13/2022

MultiStream: A Simple and Fast Multiple Cameras Visual Monitor and Directly Streaming

Monitoring and streaming is one of the most important applications for t...

Please sign up or login with your details

Forgot password? Click here to reset