Maximum Coverage in Turnstile Streams with Applications to Fingerprinting Measures
Fuente:
arXiv
Saved in:
| Main Authors: | Ene, Alina, Epasto, Alessandro, Mirrokni, Vahab, Nguyen, Hoai-An, Nguyen, Huy L., Woodruff, David P., Zhong, Peilin |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
High-Dimensional Geometric Streaming for Nearly Low Rank Data
by: Esfandiari, Hossein, et al.
Published: (2024)
by: Esfandiari, Hossein, et al.
Published: (2024)
Optimal Communication for Classic Functions in the Coordinator Model and Beyond
by: Esfandiari, Hossein, et al.
Published: (2024)
by: Esfandiari, Hossein, et al.
Published: (2024)
Perfect Sampling in Turnstile Streams Beyond Small Moments
by: Woodruff, David P., et al.
Published: (2025)
by: Woodruff, David P., et al.
Published: (2025)
Differentially Private Space-Efficient Algorithms for Counting Distinct Elements in the Turnstile Model
by: Cummings, Rachel, et al.
Published: (2025)
by: Cummings, Rachel, et al.
Published: (2025)
Optimal Approximation -- Smoothness Tradeoffs for Soft-Max Functions
by: Epasto, Alessandro, et al.
Published: (2020)
by: Epasto, Alessandro, et al.
Published: (2020)
Unbiased Insights: Optimal Streaming Algorithms for $\ell_p$ Sampling, the Forget Model, and Beyond
by: Lin, Honghao, et al.
Published: (2025)
by: Lin, Honghao, et al.
Published: (2025)
Differentially Private Clustering in Data Streams
by: Epasto, Alessandro, et al.
Published: (2023)
by: Epasto, Alessandro, et al.
Published: (2023)
On Sketching Trimmed Statistics
by: Lin, Honghao, et al.
Published: (2025)
by: Lin, Honghao, et al.
Published: (2025)
Perturb-and-Project: Differentially Private Similarities and Marginals
by: Cohen-Addad, Vincent, et al.
Published: (2024)
by: Cohen-Addad, Vincent, et al.
Published: (2024)
Streaming Complexity Separations for Dense and Sparse Graphs
by: Liu, Yang P., et al.
Published: (2026)
by: Liu, Yang P., et al.
Published: (2026)
Solving Positive Linear Programs with Differential Privacy
by: Ene, Alina, et al.
Published: (2026)
by: Ene, Alina, et al.
Published: (2026)
Solving Linear Programs with Differential Privacy
by: Ene, Alina, et al.
Published: (2025)
by: Ene, Alina, et al.
Published: (2025)
Massively Parallel Minimum Spanning Tree in General Metric Spaces
by: Azarmehr, Amir, et al.
Published: (2024)
by: Azarmehr, Amir, et al.
Published: (2024)
Adaptive Power Iteration Method for Differentially Private PCA
by: Nguyen, Ta Duy, et al.
Published: (2026)
by: Nguyen, Ta Duy, et al.
Published: (2026)
Multiplicative Weights Update, Area Convexity and Random Coordinate Descent for Densest Subgraph Problems
by: Nguyen, Ta Duy, et al.
Published: (2024)
by: Nguyen, Ta Duy, et al.
Published: (2024)
Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming
by: Kacham, Praneeth, et al.
Published: (2023)
by: Kacham, Praneeth, et al.
Published: (2023)
Approximating the Top Eigenvector in Random Order Streams
by: Kacham, Praneeth, et al.
Published: (2024)
by: Kacham, Praneeth, et al.
Published: (2024)
Skirting Additive Error Barriers for Private Turnstile Streams
by: Aamand, Anders, et al.
Published: (2026)
by: Aamand, Anders, et al.
Published: (2026)
PriorBoost: An Adaptive Algorithm for Learning from Aggregate Responses
by: Javanmard, Adel, et al.
Published: (2024)
by: Javanmard, Adel, et al.
Published: (2024)
Streaming Algorithms with Few State Changes
by: Jayaram, Rajesh, et al.
Published: (2024)
by: Jayaram, Rajesh, et al.
Published: (2024)
$L_p$ Sampling in Distributed Data Streams with Applications to Adversarial Robustness
by: Lin, Honghao, et al.
Published: (2025)
by: Lin, Honghao, et al.
Published: (2025)
A New Information Complexity Measure for Multi-pass Streaming with Applications
by: Braverman, Mark, et al.
Published: (2024)
by: Braverman, Mark, et al.
Published: (2024)
Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond
by: Axiotis, Kyriakos, et al.
Published: (2024)
by: Axiotis, Kyriakos, et al.
Published: (2024)
Turnstile Streaming Algorithms Might (Still) as Well Be Linear Sketches, for Polynomial-Length Streams
by: Jiang, Cheng, et al.
Published: (2026)
by: Jiang, Cheng, et al.
Published: (2026)
Improved $\ell_{p}$ Regression via Iteratively Reweighted Least Squares
by: Ene, Alina, et al.
Published: (2025)
by: Ene, Alina, et al.
Published: (2025)
Quasi-Self-Concordant Optimization with Lewis Weights
by: Ene, Alina, et al.
Published: (2025)
by: Ene, Alina, et al.
Published: (2025)
Adversarial Robustness on Insertion-Deletion Streams
by: Gribelyuk, Elena, et al.
Published: (2026)
by: Gribelyuk, Elena, et al.
Published: (2026)
Numerical Linear Algebra in Linear Space
by: Liu, Yiping, et al.
Published: (2025)
by: Liu, Yiping, et al.
Published: (2025)
Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings
by: Cohen-Addad, Vincent, et al.
Published: (2025)
by: Cohen-Addad, Vincent, et al.
Published: (2025)
Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound
by: Cervenjak, Philip, et al.
Published: (2024)
by: Cervenjak, Philip, et al.
Published: (2024)
Nearly Space-Optimal Graph and Hypergraph Sparsification in Insertion-Only Data Streams
by: Cohen-Addad, Vincent, et al.
Published: (2025)
by: Cohen-Addad, Vincent, et al.
Published: (2025)
The $\ell_p$-Subspace Sketch Problem in Small Dimensions with Applications to Support Vector Machines
by: Li, Yi, et al.
Published: (2022)
by: Li, Yi, et al.
Published: (2022)
Approximately Optimal Core Shapes for Tensor Decompositions
by: Ghadiri, Mehrdad, et al.
Published: (2023)
by: Ghadiri, Mehrdad, et al.
Published: (2023)
FPT Approximations for Connected Maximum Coverage
by: Inamdar, Tanmay, et al.
Published: (2026)
by: Inamdar, Tanmay, et al.
Published: (2026)
Replicable Clustering
by: Esfandiari, Hossein, et al.
Published: (2023)
by: Esfandiari, Hossein, et al.
Published: (2023)
Fast White-Box Adversarial Streaming Without a Random Oracle
by: Feng, Ying, et al.
Published: (2024)
by: Feng, Ying, et al.
Published: (2024)
Space Complexity of Minimum Cut Problems in Single-Pass Streams
by: Ding, Matthew, et al.
Published: (2024)
by: Ding, Matthew, et al.
Published: (2024)
Fast Sampling Based Sketches for Tensors
by: Swartworth, William, et al.
Published: (2024)
by: Swartworth, William, et al.
Published: (2024)
Faster Algorithms for Schatten-p Low Rank Approximation
by: Kacham, Praneeth, et al.
Published: (2024)
by: Kacham, Praneeth, et al.
Published: (2024)
Tight Sampling Bounds for Eigenvalue Approximation
by: Swartworth, William, et al.
Published: (2024)
by: Swartworth, William, et al.
Published: (2024)
Similar Items
-
High-Dimensional Geometric Streaming for Nearly Low Rank Data
by: Esfandiari, Hossein, et al.
Published: (2024) -
Optimal Communication for Classic Functions in the Coordinator Model and Beyond
by: Esfandiari, Hossein, et al.
Published: (2024) -
Perfect Sampling in Turnstile Streams Beyond Small Moments
by: Woodruff, David P., et al.
Published: (2025) -
Differentially Private Space-Efficient Algorithms for Counting Distinct Elements in the Turnstile Model
by: Cummings, Rachel, et al.
Published: (2025) -
Optimal Approximation -- Smoothness Tradeoffs for Soft-Max Functions
by: Epasto, Alessandro, et al.
Published: (2020)