On the public citation graph

Sketching in Adversarial Environments

https://doi.org/10.1137/080733772
0 signed · 45 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.1006/jcss.1997.1546openalex-snapshot
Extracting Randomness: A Survey and New Constructions
inferredcites →https://doi.org/10.1006/jcss.1999.1690openalex-snapshot
Min-Wise Independent Permutations
inferredcites →https://doi.org/10.1007/bf01185212openalex-snapshot
Checking the correctness of memories
inferredcites →https://doi.org/10.1007/s000370050018openalex-snapshot
On Randomized One-round Communication Complexity
inferredcites →https://doi.org/10.1007/s00493-007-0053-2openalex-snapshot
Lossless Condensers, Unbalanced Expanders, And Extractors
inferredcites →https://doi.org/10.1016/0022-0000(88)90035-9openalex-snapshot
Expanders, randomness, or time versus space
inferredcites →https://doi.org/10.1016/s0169-7552(97)00031-7openalex-snapshot
Syntactic clustering of the Web
inferredcites →https://doi.org/10.1109/tit.2006.871582openalex-snapshot
Compressed sensing
inferredcites →https://doi.org/10.1109/tit.2006.885507openalex-snapshot
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
inferredcites →https://doi.org/10.1137/0222053openalex-snapshot
Small-Bias Probability Spaces: Efficient Constructions and Applications
inferredcites →https://doi.org/10.1137/s0097539792235864openalex-snapshot
Amortized Communication Complexity
inferredcites →https://doi.org/10.1137/s0097539793255151openalex-snapshot
Robust Characterizations of Polynomials with Applications to Program Testing
inferredcites →https://doi.org/10.1137/s0097539798347177openalex-snapshot
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
inferredcites →https://doi.org/10.1137/s0097539799361701openalex-snapshot
An Approximate L 1 -Difference Algorithm for Massive Data Streams
inferredcites →https://doi.org/10.1145/1159892.1159900openalex-snapshot
Secure multiparty computation of approximations
inferredcites →https://doi.org/10.1145/285055.285060openalex-snapshot
Property testing and its connection to learning and approximation
inferredcites →https://doi.org/10.4086/toc.2009.v005a002openalex-snapshot

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-031-15982-4_9openalex-snapshot
Low Communication Complexity Protocols, Collision Resistant Hash Functions and Secret Key-Agreement Protocols
inferred← citeshttps://doi.org/10.1007/978-3-031-38551-3_7openalex-snapshot
Cuckoo Hashing in Cryptography: Optimal Parameters, Robustness and Applications
inferred← citeshttps://doi.org/10.1007/978-3-662-48000-7_28openalex-snapshot
Bloom Filters in Adversarial Environments
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.1103/physreva.99.062331openalex-snapshot
Quantum sketching protocols for Hamming distance and beyond
inferred← citeshttps://doi.org/10.1109/eurosp.2019.00027openalex-snapshot
The Case of Adversarial Inputs for Secure Similarity Approximation Protocols
inferred← citeshttps://doi.org/10.1109/focs.2018.00026openalex-snapshot
Bloom Filters, Adaptivity, and the Dictionary Problem
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/focs61266.2024.00136openalex-snapshot
A Strong Separation for Adversarially Robust ℓ0 Estimation for Linear Sketches
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/21m1441924openalex-snapshot
Adversarial Laws of Large Numbers and Optimal Regret in Online Classification
inferred← citeshttps://doi.org/10.1145/3306193openalex-snapshot
Bloom Filters in Adversarial Environments
inferred← citeshttps://doi.org/10.1145/3319535.3354235openalex-snapshot
Probabilistic Data Structures in Adversarial Environments
inferred← citeshttps://doi.org/10.1145/3375395.3387643openalex-snapshot
The Adversarial Robustness of Sampling
inferred← citeshttps://doi.org/10.1145/3375395.3387658openalex-snapshot
A Framework for Adversarially Robust Streaming Algorithms
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.3471488openalex-snapshot
A Framework for Adversarially Robust Streaming Algorithms
inferred← citeshttps://doi.org/10.1145/3498334openalex-snapshot
A Framework for Adversarially Robust Streaming Algorithms
inferred← citeshttps://doi.org/10.1145/3517804.3526228openalex-snapshot
The White-Box Adversarial Data Stream Model
inferred← citeshttps://doi.org/10.1145/3556972openalex-snapshot
Adversarially Robust Streaming Algorithms via Differential Privacy
inferred← citeshttps://doi.org/10.1145/3798129.3800929openalex-snapshot
Adversarial Robustness on Insertion-Deletion Streams
inferred← citeshttps://doi.org/10.23919/cnsm52442.2021.9615566openalex-snapshot
Analyzing and Assessing Pollution Attacks on Bloom Filters: Some Filters are More Vulnerable than Others
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2019.15openalex-snapshot
Two Party Distribution Testing: Communication and Security
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2022.37openalex-snapshot
Adversarially Robust Coloring for Graph Streams
inferred← citeshttps://doi.org/10.48550/arxiv.2010.11252openalex-snapshot
On Adaptive Distance Estimation
inferred← citeshttps://doi.org/10.48550/arxiv.2101.10836openalex-snapshot
Separating Adaptive Streaming from Oblivious Streaming
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.