Image de couverture de livre

Robust Streaming Against Low-Memory Adversaries

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ben-Eliezer, Omri, Onak, Krzysztof, Silwal, Sandeep
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Efficient Algorithms for Adversarially Robust Approximate Nearest Neighbor Search
par: Andoni, Alexandr, et autres
Publié: (2026)

Approximate counting of permutation patterns
par: Ben-Eliezer, Omri, et autres
Publié: (2024)

Skirting Additive Error Barriers for Private Turnstile Streams
par: Aamand, Anders, et autres
Publié: (2026)

Dynamic PageRank: Algorithms and Lower Bounds
par: Jayaram, Rajesh, et autres
Publié: (2024)

Compression Barriers for Autoregressive Transformers
par: Haris, Themistoklis, et autres
Publié: (2025)

Adversarially Robust Approximate Furthest Neighbor
par: Banihashem, Kiarash, et autres
Publié: (2026)

Adversarial Robustness on Insertion-Deletion Streams
par: Gribelyuk, Elena, et autres
Publié: (2026)

On the instance optimality of detecting collisions and subgraphs
par: Ben-Eliezer, Omri, et autres
Publié: (2023)

Beyond Worst-Case Dimensionality Reduction for Sparse Vectors
par: Silwal, Sandeep, et autres
Publié: (2025)

$L_p$ Sampling in Distributed Data Streams with Applications to Adversarial Robustness
par: Lin, Honghao, et autres
Publié: (2025)

Dimension Reduction for Clustering: The Curious Case of Discrete Centers
par: Jiang, Shaofeng H. -C., et autres
Publié: (2025)

Optimal Algorithms for Augmented Testing of Discrete Distributions
par: Aliakbarpour, Maryam, et autres
Publié: (2024)

How fast can you find a good hypothesis?
par: Aamand, Anders, et autres
Publié: (2025)

A Bi-metric Framework for Fast Similarity Search
par: Xu, Haike, et autres
Publié: (2024)

Breaking the $n^{1.5}$ Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition
par: Aamand, Anders, et autres
Publié: (2025)

Adaptively Robust Resettable Streaming
par: Cohen, Edith, et autres
Publié: (2026)

On the Structure of Replicable Hypothesis Testers
par: Aamand, Anders, et autres
Publié: (2025)

Improved Approximations for Hard Graph Problems using Predictions
par: Aamand, Anders, et autres
Publié: (2025)

Learning-Augmented Frequent Directions
par: Aamand, Anders, et autres
Publié: (2025)

Chasing Small Sets Optimally Against Adaptive Adversaries
par: Coester, Christian, et autres
Publié: (2026)

Faster Dynamic $(Δ+1)$-Coloring Against Adaptive Adversaries
par: Flin, Maxime, et autres
Publié: (2025)

Fully Dynamic (Δ+1) Coloring Against Adaptive Adversaries
par: Behnezhad, Soheil, et autres
Publié: (2024)

A Dynamic Low-Rank Fast Gaussian Transform
par: Huang, Baihe, et autres
Publié: (2022)

Improved Sparse Recovery for Approximate Matrix Multiplication
par: Uffenheimer, Yahel, et autres
Publié: (2026)

A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
par: Basu, Sabyasachi, et autres
Publié: (2024)

On the Adversarial Robustness of Online Importance Sampling
par: Kenneth-Mordoch, Yotam, et autres
Publié: (2025)

Structured Downsampling for Fast, Memory-efficient Curation of Online Data Streams
par: Moreno, Matthew Andres, et autres
Publié: (2024)

High-Dimensional Geometric Streaming for Nearly Low Rank Data
par: Esfandiari, Hossein, et autres
Publié: (2024)

Weighted Matching in the Random-Order Streaming and Robust Communication Models
par: Hashemi, Diba, et autres
Publié: (2024)

Randomized Dimensionality Reduction for Euclidean Maximization and Diversity Measures
par: Gao, Jie, et autres
Publié: (2025)

Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness
par: Gribelyuk, Elena, et autres
Publié: (2025)

A Framework for Building Data Structures from Communication Protocols
par: Andoni, Alexandr, et autres
Publié: (2025)

Spectral Guarantees for Adversarial Streaming PCA
par: Price, Eric, et autres
Publié: (2024)

Online Block Packing
par: Eliezer, Ariel Ben, et autres
Publié: (2025)

Statistical-Computational Trade-offs for Density Estimation
par: Aamand, Anders, et autres
Publié: (2024)

Differentially Private Gomory-Hu Trees
par: Aamand, Anders, et autres
Publié: (2024)

Efficiently Computing Similarities to Private Datasets
par: Backurs, Arturs, et autres
Publié: (2024)

Adversarially Robust Dense-Sparse Tradeoffs via Heavy-Hitters
par: Woodruff, David P., et autres
Publié: (2024)

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth
par: Koh, Zhuan Khye, et autres
Publié: (2024)

A Strong Separation for Adversarially Robust $\ell_0$ Estimation for Linear Sketches
par: Gribelyuk, Elena, et autres
Publié: (2024)