Imagen de Portada

Streaming Algorithms with Few State Changes

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Jayaram, Rajesh, Woodruff, David P., Zhou, Samson
Formato:	Preprint
Publicado:	2024
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

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

Perfect Sampling in Turnstile Streams Beyond Small Moments
por: Woodruff, David P., et al.
Publicado: (2025)

Adversarially Robust Dense-Sparse Tradeoffs via Heavy-Hitters
por: Woodruff, David P., et al.
Publicado: (2024)

Consistent Low-Rank Approximation
por: Woodruff, David P., et al.
Publicado: (2026)

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

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

Distributed Algorithms for Euclidean Clustering
por: Cohen-Addad, Vincent, et al.
Publicado: (2026)

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

Perfect $L_p$ Sampling with Polylogarithmic Update Time
por: Swartworth, William, et al.
Publicado: (2025)

Better Bounds for the Distributed Experts Problem
por: Woodruff, David P., et al.
Publicado: (2026)

Approximating the Top Eigenvector in Random Order Streams
por: Kacham, Praneeth, et al.
Publicado: (2024)

Unbiased Insights: Optimal Streaming Algorithms for $\ell_p$ Sampling, the Forget Model, and Beyond
por: Lin, Honghao, et al.
Publicado: (2025)

Faster Algorithms for Schatten-p Low Rank Approximation
por: Kacham, Praneeth, et al.
Publicado: (2024)

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

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

Dynamic PageRank: Algorithms and Lower Bounds
por: Jayaram, Rajesh, et al.
Publicado: (2024)

Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming
por: Kacham, Praneeth, et al.
Publicado: (2023)

LevAttention: Time, Space, and Streaming Efficient Algorithm for Heavy Attentions
por: Kannan, Ravindran, et al.
Publicado: (2024)

Data-Dependent LSH for the Earth Mover's Distance
por: Jayaram, Rajesh, et al.
Publicado: (2024)

On Socially Fair Low-Rank Approximation and Column Subset Selection
por: Song, Zhao, et al.
Publicado: (2024)

High-Dimensional Geometric Streaming for Nearly Low Rank Data
por: Esfandiari, Hossein, et al.
Publicado: (2024)

Online Learning with Limited Information in the Sliding Window Model
por: Braverman, Vladimir, et al.
Publicado: (2026)

Learning-Augmented Moment Estimation on Time-Decay Models
por: Nagawanshi, Soham, et al.
Publicado: (2026)

On Fine-Grained Distinct Element Estimation
por: Diakonikolas, Ilias, et al.
Publicado: (2025)

Fast White-Box Adversarial Streaming Without a Random Oracle
por: Feng, Ying, et al.
Publicado: (2024)

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

Fast Sampling Based Sketches for Tensors
por: Swartworth, William, et al.
Publicado: (2024)

Tight Sampling Bounds for Eigenvalue Approximation
por: Swartworth, William, et al.
Publicado: (2024)

Maximum Coverage in Turnstile Streams with Applications to Fingerprinting Measures
por: Ene, Alina, et al.
Publicado: (2025)

Streaming Complexity Separations for Dense and Sparse Graphs
por: Liu, Yang P., et al.
Publicado: (2026)

Learning Multiple Secrets in Mastermind
por: Prabhu, Milind, et al.
Publicado: (2024)

On Sketching Trimmed Statistics
por: Lin, Honghao, et al.
Publicado: (2025)

The $\ell_p$-Subspace Sketch Problem in Small Dimensions with Applications to Support Vector Machines
por: Li, Yi, et al.
Publicado: (2022)

Tight Bounds for Heavy-Hitters and Moment Estimation in the Sliding Window Model
por: Feng, Shiyuan, et al.
Publicado: (2025)

Massively Parallel Minimum Spanning Tree in General Metric Spaces
por: Azarmehr, Amir, et al.
Publicado: (2024)

Multipass Linear Sketches for Geometric LP-Type Problems
por: Çekirge, N. Efe, et al.
Publicado: (2025)

SVD Provably Denoises Nearest Neighbor Data
por: Kannan, Ravindran, et al.
Publicado: (2026)

Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
por: Gottesbüren, Lars, et al.
Publicado: (2024)

A New Information Complexity Measure for Multi-pass Streaming with Applications
por: Braverman, Mark, et al.
Publicado: (2024)

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