On the public citation graph

Adversarially Robust Streaming Algorithms via Differential Privacy

https://doi.org/10.1145/3556972
0 signed · 78 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/11681878_14openalex-snapshot
Calibrating Noise to Sensitivity in Private Data Analysis
inferredcites →https://doi.org/10.1007/3-540-45465-9_59openalex-snapshot
Finding Frequent Items in Data Streams
inferredcites →https://doi.org/10.1007/3-540-45726-7_1openalex-snapshot
Counting Distinct Elements in a Data Stream
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-642-40328-6_26openalex-snapshot
Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
inferredcites →https://doi.org/10.1007/s00446-005-0147-2openalex-snapshot
Efficient algorithms for constructing (1+∊,β)-spanners in the distributed and streaming models
inferredcites →https://doi.org/10.1007/s00453-024-01259-8openalex-snapshot
A Framework for Adversarial Streaming Via Differential Privacy and Difference Estimators
inferredcites →https://doi.org/10.1016/0022-0000(85)90041-8openalex-snapshot
Probabilistic counting algorithms for data base applications
inferredcites →https://doi.org/10.1016/b978-155860869-6/50038-xopenalex-snapshot
Approximate Frequency Counts over Data Streams
inferredcites →https://doi.org/10.1016/j.jalgor.2003.12.001openalex-snapshot
An improved data stream summary: the count-min sketch and its applications
inferredcites →https://doi.org/10.1016/s0304-3975(03)00400-6openalex-snapshot
Finding frequent items in data streams
inferredcites →https://doi.org/10.1109/focs.2007.41openalex-snapshot
Towards Sharp Inapproximability For Any 2-CSP
inferredcites →https://doi.org/10.1109/focs.2007.66openalex-snapshot
Mechanism Design via Differential Privacy
inferredcites →https://doi.org/10.1109/focs.2010.12openalex-snapshot
Boosting and Differential Privacy
inferredcites →https://doi.org/10.1109/focs.2010.85openalex-snapshot
A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis
inferredcites →https://doi.org/10.1109/focs.2014.55openalex-snapshot
Preventing False Discovery in Interactive Data Analysis Is Hard
inferredcites →https://doi.org/10.1109/focs.2015.45openalex-snapshot
Differentially Private Release and Learning of Threshold Functions
inferredcites →https://doi.org/10.1109/focs.2018.00084openalex-snapshot
Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling
inferredcites →https://doi.org/10.1109/focs52979.2021.00116openalex-snapshot
Tight Bounds for Adversarially Robust Streams and Sliding Windows via Difference Estimators
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.9781611973075.93openalex-snapshot
On the Exact Space Complexity of Sketching and Streaming Small Norms
inferredcites →https://doi.org/10.1137/1.9781611977066.15openalex-snapshot
Adversarially Robust Streaming via Dense-Sparse Trade-offs
inferredcites →https://doi.org/10.1137/s0097539701398363openalex-snapshot
Maintaining Stream Statistics over Sliding Windows
inferredcites →https://doi.org/10.1145/1060590.1060621openalex-snapshot
Optimal approximations of the frequency moments of data streams
inferredcites →https://doi.org/10.1145/1061318.1061325openalex-snapshot
What's hot and what's not: tracking most frequent items dynamically
inferredcites →https://doi.org/10.1145/1536414.1536467openalex-snapshot
On the complexity of differentially private data release
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/2488608.2488624openalex-snapshot
How robust are linear sketches to adaptive inputs?
inferredcites →https://doi.org/10.1145/2746539.2746580openalex-snapshot
Preserving Statistical Validity in Adaptive Data Analysis
inferredcites →https://doi.org/10.1145/2897518.2897566openalex-snapshot
Algorithmic stability for adaptive data analysis
inferredcites →https://doi.org/10.1145/3188745.3188946openalex-snapshot
Composable and versatile privacy via truncated CDP
inferredcites →https://doi.org/10.1145/3196959.3196986openalex-snapshot
Data Streams with Bounded Deletions
inferredcites →https://doi.org/10.1145/3375395.3387643openalex-snapshot
The Adversarial Robustness of Sampling
inferredcites →https://doi.org/10.1145/3375395.3387658openalex-snapshot
A Framework for Adversarially Robust Streaming Algorithms
inferredcites →https://doi.org/10.1145/3498334openalex-snapshot
A Framework for Adversarially Robust Streaming Algorithms
inferredcites →https://doi.org/10.14778/2367502.2367508openalex-snapshot
Approximate frequency counts over data streams
inferredcites →https://doi.org/10.1561/9781933019604openalex-snapshot
Data Streams: Algorithms and Applications
inferredcites →https://doi.org/10.29012/jpc.658openalex-snapshot
Concentration Bounds for High Sensitivity Functions Through Differential Privacy
inferredcites →https://doi.org/10.48550/arxiv.1211.1056openalex-snapshot
How Robust are Linear Sketches to Adaptive Inputs?
inferredcites →https://doi.org/10.48550/arxiv.1806.06100openalex-snapshot
The Limits of Post-Selection Generalization
inferredcites →https://doi.org/10.48550/arxiv.1911.10137openalex-snapshot
Privately Learning Thresholds: Closing the Exponential Gap
inferredcites →https://doi.org/10.5555/2095116.2095156openalex-snapshot
Analyzing graph structure via linear measurements

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-030-84252-9_4openalex-snapshot
Separating Adaptive Streaming from Oblivious Streaming Using the Bounded Storage Model
inferred← citeshttps://doi.org/10.1007/978-3-032-03985-9_8openalex-snapshot
Differential Privacy and Homomorphic Encryption in Healthcare Artificial Intelligence
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.1109/eurosp53844.2022.00018openalex-snapshot
HyperLogLog: Exponentially Bad in Adversarial Settings
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00116openalex-snapshot
Tight Bounds for Adversarially Robust Streams and Sliding Windows via Difference Estimators
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00069openalex-snapshot
Near Optimal Memory-Regret Tradeoff for Online Learning
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00097openalex-snapshot
The Complexity of Dynamic Least-Squares Regression
inferred← citeshttps://doi.org/10.1109/sp54263.2024.00245openalex-snapshot
Private Analytics via Streaming, Sketching, and Silently Verifiable Proofs
inferred← citeshttps://doi.org/10.1137/1.9781611977066.15openalex-snapshot
Adversarially Robust Streaming via Dense-Sparse Trade-offs
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch101openalex-snapshot
Optimal Fully Dynamic k -Center Clustering for Adaptive and Oblivious Adversaries
inferred← citeshttps://doi.org/10.1137/21m1441924openalex-snapshot
Adversarial Laws of Large Numbers and Optimal Regret in Online Classification
inferred← citeshttps://doi.org/10.1145/3406325.3451041openalex-snapshot
Adversarial laws of large numbers and optimal regret in online classification
inferred← citeshttps://doi.org/10.1145/3471485.3471487openalex-snapshot
Technical Perspective
inferred← citeshttps://doi.org/10.1145/3498334openalex-snapshot
A Framework for Adversarially Robust Streaming Algorithms
inferred← citeshttps://doi.org/10.1145/3516431.3516433openalex-snapshot
Current Trends in Data Summaries
inferred← citeshttps://doi.org/10.1145/3517804.3524139openalex-snapshot
Truly Perfect Samplers for Data Streams and Sliding Windows
inferred← citeshttps://doi.org/10.1145/3519935.3520064openalex-snapshot
Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds
inferred← citeshttps://doi.org/10.1145/3576915.3623216openalex-snapshot
Compact Frequency Estimators in Adversarial Environments
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/3725239openalex-snapshot
On the Adversarial Robustness of Locality-Sensitive Hashing in Hamming Space
inferred← citeshttps://doi.org/10.1145/3725243openalex-snapshot
Perfect Sampling in Turnstile Streams Beyond Small Moments
inferred← citeshttps://doi.org/10.1145/3810280.3810299openalex-snapshot
Image-Based Domain Adaptive Vulnerability Detection via Graph Centrality Representation
inferred← citeshttps://doi.org/10.1360/ssm-2026-0032openalex-snapshot
Algorithmic inference: A modern machine learning framework that blends algorithmic thinking and inferential thinking
inferred← citeshttps://doi.org/10.14778/3705829.3705838openalex-snapshot
Unleash the Power of Ellipsis: Accuracy-Enhanced Sparse Vector Technique with Exponential Noise
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.17760/d20652998openalex-snapshot
Higher utility methods for differentially private optimization
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2022.107openalex-snapshot
Keep That Card in Mind: Card Guessing with Limited Memory
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2022.37openalex-snapshot
Adversarially Robust Coloring for Graph Streams
inferred← citeshttps://doi.org/10.48550/arxiv.2101.10836openalex-snapshot
Separating Adaptive Streaming from Oblivious Streaming
inferred← citeshttps://doi.org/10.48550/arxiv.2106.14952openalex-snapshot
Adversarial Robustness of Streaming Algorithms through Importance Sampling
inferred← citeshttps://doi.org/10.48550/arxiv.2112.00828openalex-snapshot
The Price of Differential Privacy under Continual Observation
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.