Imagen de Portada

Adaptively Robust Resettable Streaming

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Cohen, Edith, Gribelyuk, Elena, Nelson, Jelani, Stemmer, Uri
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

One Attack to Rule Them All: Tight Quadratic Bounds for Adaptive Queries on Cardinality Sketches
por: Cohen, Edith, et al.
Publicado: (2024)

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries
por: Cohen, Edith, et al.
Publicado: (2025)

Tight Bounds for Answering Adaptively Chosen Concentrated Queries
por: Rapoport, Emma, et al.
Publicado: (2025)

A Simple and Robust Protocol for Distributed Counting
por: Cohen, Edith, et al.
Publicado: (2025)

Hot PATE: Private Aggregation of Distributions for Diverse Task
por: Cohen, Edith, et al.
Publicado: (2023)

The Cost of Compression: Tight Quadratic Black-Box Attacks on Sketches for $\ell_2$ Norm Estimation
por: Ahmadian, Sara, et al.
Publicado: (2025)

Adversarial Robustness on Insertion-Deletion Streams
por: Gribelyuk, Elena, et al.
Publicado: (2026)

Protecting the Undeleted in Machine Unlearning
por: Cohen, Aloni, et al.
Publicado: (2026)

Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness
por: Gribelyuk, Elena, et al.
Publicado: (2025)

A Strong Separation for Adversarially Robust $\ell_0$ Estimation for Linear Sketches
por: Gribelyuk, Elena, et al.
Publicado: (2024)

Near-Optimal Relative Error Streaming Quantile Estimation via Elastic Compactors
por: Gribelyuk, Elena, et al.
Publicado: (2024)

Space Complexity of Minimum Cut Problems in Single-Pass Streams
por: Ding, Matthew, et al.
Publicado: (2024)

On Differentially Private Linear Algebra
por: Kaplan, Haim, et al.
Publicado: (2024)

Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs
por: Ahmadian, Sara, et al.
Publicado: (2024)

Terminal Embeddings in Sublinear Time
por: Cherapanamjeri, Yeshwanth, et al.
Publicado: (2021)

Robust Streaming Against Low-Memory Adversaries
por: Ben-Eliezer, Omri, et al.
Publicado: (2025)

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings
por: Cohen-Addad, Vincent, et al.
Publicado: (2025)

Smoothed Analysis of Dynamic Graph Algorithms
por: Meir, Uri, et al.
Publicado: (2025)

Stochastic Knapsack: Semi-Adaptivity Gaps and Improved Approximation
por: Barak, Zohar, et al.
Publicado: (2026)

Nearly Space-Optimal Graph and Hypergraph Sparsification in Insertion-Only Data Streams
por: Cohen-Addad, Vincent, et al.
Publicado: (2025)

Weighted Matching in the Random-Order Streaming and Robust Communication Models
por: Hashemi, Diba, et al.
Publicado: (2024)

Relative Error Streaming Quantiles with Seamless Mergeability via Adaptive Compactors
por: Domes, Tomáš, et al.
Publicado: (2025)

$L_p$ Sampling in Distributed Data Streams with Applications to Adversarial Robustness
por: Lin, Honghao, et al.
Publicado: (2025)

Search Trees on Trees via LP
por: Sadeh, Yaniv, et al.
Publicado: (2025)

Optimal Testing of Reed-Muller Codes with an Online Adversary
por: Kelman, Esty, et al.
Publicado: (2026)

Stochastic Matching via Local Sparsification
por: Ahmadian, Sara, et al.
Publicado: (2026)

Improved Approximation Algorithms for Multiway Cut by Large Mixtures of New and Old Rounding Schemes
por: Brakensiek, Joshua, et al.
Publicado: (2026)

Homomorphism Testing with Resilience to Online Manipulations
por: Kelman, Esty, et al.
Publicado: (2025)

All-Hops Shortest Paths
por: Williams, Virginia Vassilevska, et al.
Publicado: (2024)

On the Streaming Complexity of Expander Decomposition
por: Chen, Yu, et al.
Publicado: (2024)

Sketching and Streaming for Dictionary Compression
por: Becker, Ruben, et al.
Publicado: (2023)

Streaming Algorithms for Network Design
por: Chekuri, Chandra, et al.
Publicado: (2025)

Error Correction for Message Streams
por: Gupta, Meghal, et al.
Publicado: (2023)

Improved Streaming Edge Coloring
por: Chechik, Shiri, et al.
Publicado: (2025)

Streaming algorithms for products of probabilities
por: Lohrey, Markus, et al.
Publicado: (2025)

Streaming Algorithms for Connectivity Augmentation
por: Jin, Ce, et al.
Publicado: (2024)

Buffered Streaming Edge Partitioning
por: Chhabra, Adil, et al.
Publicado: (2024)

Faster Deterministic Streaming Vertex Coloring
por: Chechik, Shiri, et al.
Publicado: (2026)

Streaming Algorithms with Few State Changes
por: Jayaram, Rajesh, et al.
Publicado: (2024)

Semi-Streaming Algorithms for Hypergraph Matching
por: Reinstädtler, Henrik, et al.
Publicado: (2025)