Image de couverture de livre

Perfect Sampling in Turnstile Streams Beyond Small Moments

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Woodruff, David P., Xie, Shenghao, Zhou, Samson
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

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

Nearly Space-Optimal Graph and Hypergraph Sparsification in Insertion-Only Data Streams
par: Cohen-Addad, Vincent, et autres
Publié: (2025)

Perfect $L_p$ Sampling with Polylogarithmic Update Time
par: Swartworth, William, et autres
Publié: (2025)

Maximum Coverage in Turnstile Streams with Applications to Fingerprinting Measures
par: Ene, Alina, et autres
Publié: (2025)

Streaming Algorithms with Few State Changes
par: Jayaram, Rajesh, et autres
Publié: (2024)

Consistent Low-Rank Approximation
par: Woodruff, David P., et autres
Publié: (2026)

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

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings
par: Cohen-Addad, Vincent, et autres
Publié: (2025)

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

Unbiased Insights: Optimal Streaming Algorithms for $\ell_p$ Sampling, the Forget Model, and Beyond
par: Lin, Honghao, et autres
Publié: (2025)

Learning-Augmented Moment Estimation on Time-Decay Models
par: Nagawanshi, Soham, et autres
Publié: (2026)

Better Bounds for the Distributed Experts Problem
par: Woodruff, David P., et autres
Publié: (2026)

Approximating the Top Eigenvector in Random Order Streams
par: Kacham, Praneeth, et autres
Publié: (2024)

Transductive and Learning-Augmented Online Regression
par: Raman, Vinod, et autres
Publié: (2025)

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

Tight Bounds for Heavy-Hitters and Moment Estimation in the Sliding Window Model
par: Feng, Shiyuan, et autres
Publié: (2025)

Distributed Algorithms for Euclidean Clustering
par: Cohen-Addad, Vincent, et autres
Publié: (2026)

Fast Sampling Based Sketches for Tensors
par: Swartworth, William, et autres
Publié: (2024)

Tight Sampling Bounds for Eigenvalue Approximation
par: Swartworth, William, et autres
Publié: (2024)

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

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

Turnstile Streaming Algorithms Might (Still) as Well Be Linear Sketches, for Polynomial-Length Streams
par: Jiang, Cheng, et autres
Publié: (2026)

Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming
par: Kacham, Praneeth, et autres
Publié: (2023)

The $\ell_p$-Subspace Sketch Problem in Small Dimensions with Applications to Support Vector Machines
par: Li, Yi, et autres
Publié: (2022)

On Socially Fair Low-Rank Approximation and Column Subset Selection
par: Song, Zhao, et autres
Publié: (2024)

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

Sharper Bounds for $\ell_p$ Sensitivity Sampling
par: Woodruff, David P., et autres
Publié: (2023)

Ridge Leverage Score Sampling for $\ell_p$ Subspace Approximation
par: Woodruff, David P., et autres
Publié: (2024)

Online Learning with Limited Information in the Sliding Window Model
par: Braverman, Vladimir, et autres
Publié: (2026)

On Fine-Grained Distinct Element Estimation
par: Diakonikolas, Ilias, et autres
Publié: (2025)

Fast White-Box Adversarial Streaming Without a Random Oracle
par: Feng, Ying, et autres
Publié: (2024)

Optimal Communication for Classic Functions in the Coordinator Model and Beyond
par: Esfandiari, Hossein, et autres
Publié: (2024)

Space Complexity of Minimum Cut Problems in Single-Pass Streams
par: Ding, Matthew, et autres
Publié: (2024)

Faster Algorithms for Schatten-p Low Rank Approximation
par: Kacham, Praneeth, et autres
Publié: (2024)

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

Streaming Complexity Separations for Dense and Sparse Graphs
par: Liu, Yang P., et autres
Publié: (2026)

Turnstile $\ell_p$ leverage score sampling with applications
par: Munteanu, Alexander, et autres
Publié: (2024)

Private Counting of Distinct Elements in the Turnstile Model and Extensions
par: Henzinger, Monika, et autres
Publié: (2024)

LevAttention: Time, Space, and Streaming Efficient Algorithm for Heavy Attentions
par: Kannan, Ravindran, et autres
Publié: (2024)

Universal Perfect Samplers for Incremental Streams
par: Pettie, Seth, et autres
Publié: (2024)