On the public citation graph

A Framework for Adversarially Robust Streaming Algorithms

https://doi.org/10.1145/3498334
0 signed · 72 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jcss.1997.1545openalex-snapshot
The Space Complexity of Approximating the Frequency Moments
inferredcites →https://doi.org/10.1007/978-3-030-84252-9_4openalex-snapshot
Separating Adaptive Streaming from Oblivious Streaming Using the Bounded Storage Model
inferredcites →https://doi.org/10.1007/978-3-319-32162-2_12openalex-snapshot
The Discrete Logarithm Problem
inferredcites →https://doi.org/10.1007/978-3-642-02026-1_28openalex-snapshot
Deterministically Estimating Data Stream Frequencies
inferredcites →https://doi.org/10.1007/978-3-642-40328-6_43openalex-snapshot
A Tight Lower Bound for High Frequency Moment Estimation with Small Error
inferredcites →https://doi.org/10.1007/978-3-662-48000-7_28openalex-snapshot
Bloom Filters in Adversarial Environments
inferredcites →https://doi.org/10.1016/0167-6423(82)90012-0openalex-snapshot
Finding repeated elements
inferredcites →https://doi.org/10.1016/j.jcss.2003.11.006openalex-snapshot
An information statistics approach to data stream and communication complexity
inferredcites →https://doi.org/10.1016/s0304-3975(03)00400-6openalex-snapshot
Finding frequent items in data streams
inferredcites →https://doi.org/10.1080/00949658908811160openalex-snapshot
C332. Surprise indexes and p-values
inferredcites →https://doi.org/10.1109/focs.2008.76openalex-snapshot
Sketching and Streaming Entropy via Approximation Theory
inferredcites →https://doi.org/10.1109/focs.2009.82openalex-snapshot
The Data Stream Space Complexity of Cascaded Norms
inferredcites →https://doi.org/10.1109/focs.2016.14openalex-snapshot
Strong Fooling Sets for Multi-player Communication with Applications to Deterministic Estimation of Stream Statistics
inferredcites →https://doi.org/10.1109/ita.2012.6181772openalex-snapshot
Recovering simple signals
inferredcites →https://doi.org/10.1109/ssp.2012.6319752openalex-snapshot
Reusable low-error compressive sampling schemes through privacy
inferredcites →https://doi.org/10.1137/080733772openalex-snapshot
Sketching in Adversarial Environments
inferredcites →https://doi.org/10.1137/1.9781611973099.40openalex-snapshot
Analyzing Graph Structure via Linear Measurements
inferredcites →https://doi.org/10.1137/1.9781611975031.156openalex-snapshot
Optimal streaming and tracking distinct elements with high probability
inferredcites →https://doi.org/10.1137/1.9781611975482.48openalex-snapshot
Sublinear Algorithms for (Δ + 1) Vertex Coloring
inferredcites →https://doi.org/10.1137/1.9781611977066.15openalex-snapshot
Adversarially Robust Streaming via Dense-Sparse Trade-offs
inferredcites →https://doi.org/10.1137/s089548019223872xopenalex-snapshot
Chernoff–Hoeffding Bounds for Applications with Limited Independence
inferredcites →https://doi.org/10.1145/1806689.1806787openalex-snapshot
Differential privacy under continual observation
inferredcites →https://doi.org/10.1145/1807085.1807094openalex-snapshot
An optimal algorithm for the distinct elements problem
inferredcites →https://doi.org/10.1145/2213556.2213560openalex-snapshot
Graph sketches
inferredcites →https://doi.org/10.1145/2483699.2483706openalex-snapshot
Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error
inferredcites →https://doi.org/10.1145/2488608.2488624openalex-snapshot
How robust are linear sketches to adaptive inputs?
inferredcites →https://doi.org/10.1145/2591796.2591812openalex-snapshot
Turnstile streaming algorithms might as well be linear sketches
inferredcites →https://doi.org/10.1145/3034786.3034798openalex-snapshot
BPTree
inferredcites →https://doi.org/10.1145/3196959.3196986openalex-snapshot
Data Streams with Bounded Deletions
inferredcites →https://doi.org/10.1145/3357713.3384278openalex-snapshot
Separations and equivalences between turnstile streaming and linear sketching
inferredcites →https://doi.org/10.1145/3375395.3387643openalex-snapshot
The Adversarial Robustness of Sampling
inferredcites →https://doi.org/10.1145/3406325.3451041openalex-snapshot
Adversarial laws of large numbers and optimal regret in online classification
inferredcites →https://doi.org/10.1145/3556972openalex-snapshot
Adversarially Robust Streaming Algorithms via Differential Privacy
inferredcites →https://doi.org/10.1145/3596494openalex-snapshot
Towards Optimal Moment Estimation in Streaming and Distributed Models
inferredcites →https://doi.org/10.1561/0400000001openalex-snapshot
Foundations of Cryptography – A Primer
inferredcites →https://doi.org/10.1561/0400000002openalex-snapshot
Data Streams: Algorithms and Applications
inferredcites →https://doi.org/10.1561/9781933019529openalex-snapshot
Foundations of Cryptography – A Primer
inferredcites →https://doi.org/10.1561/9781933019604openalex-snapshot
Data Streams: Algorithms and Applications
inferredcites →https://doi.org/10.2307/2002914openalex-snapshot
Proceedings of Symposia in Applied Mathematics.
inferredcites →https://doi.org/10.4064/sm-70-3-231-283openalex-snapshot
The best constants in the Khintchine inequality
inferredcites →https://doi.org/10.4230/lipics.ccc.2016.20openalex-snapshot
New Characterizations in Turnstile Streams with Applications
inferredcites →https://doi.org/10.4230/lipics.ccc.2021.37openalex-snapshot
A Simple Proof of a New Set Disjointness with Applications to Data Streams
inferredcites →https://doi.org/10.4230/lipics.itcs.2022.107openalex-snapshot
Keep That Card in Mind: Card Guessing with Limited Memory
inferredcites →https://doi.org/10.4230/lipics.itcs.2022.37openalex-snapshot
Adversarially Robust Coloring for Graph Streams
inferredcites →https://doi.org/10.48550/arxiv.1704.06710openalex-snapshot
Continuous monitoring of $\ell_p$ norms in data streams
inferredcites →https://doi.org/10.48550/arxiv.2106.14952openalex-snapshot
Adversarial Robustness of Streaming Algorithms through Importance Sampling
inferredcites →https://doi.org/10.5555/2095116.2095156openalex-snapshot
Analyzing graph structure via linear measurements
inferredcites →https://doi.org/10.5555/3310435.3310483openalex-snapshot
Sublinear algorithms for (Δ + 1) vertex coloring
inferredcites →https://doi.org/10.5860/choice.37-5723openalex-snapshot
Modern computer algebra

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-91398-3_30openalex-snapshot
Performative Drift Resistant Classification Using Generative Domain Adversarial Networks
inferred← citeshttps://doi.org/10.1007/s00453-024-01259-8openalex-snapshot
A Framework for Adversarial Streaming Via Differential Privacy and Difference Estimators
inferred← citeshttps://doi.org/10.1007/s11704-025-41203-9openalex-snapshot
Streaming algorithms for triangle counting: adversarial robustness and the weighted case
inferred← citeshttps://doi.org/10.1016/j.ssaho.2026.103697openalex-snapshot
Robust machine learning for fraud detection under imbalance, rarity, and adversarial behavior: Evidence across financial reporting, payments, and graph ecosystems
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00097openalex-snapshot
The Complexity of Dynamic Least-Squares Regression
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00136openalex-snapshot
A Strong Separation for Adversarially Robust ℓ0 Estimation for Linear Sketches
inferred← citeshttps://doi.org/10.1109/iccvbic71195.2026.11688312openalex-snapshot
Beyond Uniformity in Combinatorial Streams: Sparsity-Adaptive and Adversarially Robust Oracles for MAX-CUT Approximation
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00236openalex-snapshot
The SpaceSaving± Family of Algorithms for Data Streams with Bounded Deletions
inferred← citeshttps://doi.org/10.1109/sp54263.2024.00245openalex-snapshot
Private Analytics via Streaming, Sketching, and Silently Verifiable Proofs
inferred← citeshttps://doi.org/10.1145/3556972openalex-snapshot
Adversarially Robust Streaming Algorithms via Differential Privacy
inferred← citeshttps://doi.org/10.1145/3576915.3623216openalex-snapshot
Compact Frequency Estimators in Adversarial Environments
inferred← citeshttps://doi.org/10.1145/3617891openalex-snapshot
Relative Error Streaming Quantiles
inferred← citeshttps://doi.org/10.1145/3651145openalex-snapshot
Streaming Algorithms with Few State Changes
inferred← citeshttps://doi.org/10.1145/3662158.3662770openalex-snapshot
Streaming Graph Algorithms in the Massively Parallel Computation Model
inferred← citeshttps://doi.org/10.1145/3711896.3737152openalex-snapshot
The Adaptive Use of Count-Min Sketch: What is Safe and What is Not?
inferred← citeshttps://doi.org/10.1145/3717823.3718194openalex-snapshot
Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms
inferred← citeshttps://doi.org/10.1145/3717823.3718227openalex-snapshot
Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness
inferred← citeshttps://doi.org/10.1145/3717823.3718295openalex-snapshot
Fingerprinting Codes Meet Geometry: Improved Lower Bounds for Private Query Release and Adaptive Data Analysis
inferred← citeshttps://doi.org/10.1145/3725239openalex-snapshot
On the Adversarial Robustness of Locality-Sensitive Hashing in Hamming Space
inferred← citeshttps://doi.org/10.1145/3798129.3800929openalex-snapshot
Adversarial Robustness on Insertion-Deletion Streams
inferred← citeshttps://doi.org/10.1609/aaai.v37i6.25882openalex-snapshot
Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs
inferred← citeshttps://doi.org/10.62056/a3txom2hdopenalex-snapshot
Adversarially Robust Bloom Filters: Monotonicity and Betting
inferred← citeshttps://doi.org/10.62056/ak2i5w7sfopenalex-snapshot
On the Privacy of Sublinear-Communication Jaccard Index Estimation via Min-hash
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.