On the public citation graph
https://doi.org/10.4086/toc.2009.v005a003
0 signed · 52 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/rsa.3240030308openalex-snapshot
Simple Constructions of Almost k‐wise Independent Random Variables
inferredcites →https://doi.org/10.1007/b11961openalex-snapshot
Approximation, randomization, and combinatorial optimization : algorithms and techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003, and 7th International Workshop on Randomization and Approximation Techniques in Computer Science,…
inferredcites →https://doi.org/10.1007/s00037-009-0273-5openalex-snapshot
The Sum of D Small-Bias Generators Fools Polynomials of Degree D
inferredcites →https://doi.org/10.1007/s00039-001-0332-9openalex-snapshot
A new proof of Szemerédi's theorem
inferredcites →https://doi.org/10.1016/0022-0000(93)90044-wopenalex-snapshot
Self-testing/correcting with applications to numerical problems
inferredcites →https://doi.org/10.1017/s0013091505000325openalex-snapshot
AN INVERSE THEOREM FOR THE GOWERS $U^3(G)$ NORM
inferredcites →https://doi.org/10.1109/18.556674openalex-snapshot
Linearity testing in characteristic two
inferredcites →https://doi.org/10.1109/ccc.2007.15openalex-snapshot
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols
inferredcites →https://doi.org/10.1109/focs.2007.42openalex-snapshot
Pseudorandom Bits for Polynomials
inferredcites →https://doi.org/10.1109/focs.2007.56openalex-snapshot
Spectral Graph Theory and its Applications
inferredcites →https://doi.org/10.1109/istcs.1993.253488openalex-snapshot
Deterministic approximate counting of depth-2 circuits
inferredcites →https://doi.org/10.1137/050640941openalex-snapshot
Pseudorandom Bits for Constant‐Depth Circuits with Few Arbitrary Symmetric Gates
inferredcites →https://doi.org/10.1145/100216.100244openalex-snapshot
Small-bias probability spaces: efficient constructions and applications
inferredcites →https://doi.org/10.1145/1060590.1060594openalex-snapshot
Pseudorandom generators for low degree polynomials
inferredcites →https://doi.org/10.1145/1132516.1132519openalex-snapshot
Gowers uniformity, influence of variables, and PCPs
inferredcites →https://doi.org/10.1145/1250790.1250864openalex-snapshot
Low-degree tests at large distances
inferredcites →https://doi.org/10.1145/1374376.1374454openalex-snapshot
Inverse conjecture for the gowers norm is false
inferredcites →https://doi.org/10.1145/1374376.1374455openalex-snapshot
Unconditional pseudorandom generators for low degree polynomials
inferredcites →https://doi.org/10.1145/780542.780631openalex-snapshot
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
inferredcites →https://doi.org/10.4230/lipics.stacs.2017.12openalex-snapshot
On Polynomial Approximations Over Z/2^kZ*
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-1-4614-6642-0_4openalex-snapshot
Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_46openalex-snapshot
Pseudorandom Bit Generators That Fool Modular Sums
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_19openalex-snapshot
Optimal Testing of Reed-Muller Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_40openalex-snapshot
A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_71openalex-snapshot
Fast Pseudorandomness for Independence and Load Balancing
inferred← citeshttps://doi.org/10.1007/s00037-010-0290-4openalex-snapshot
The Complexity of Boolean Functions in Different Characteristics
inferred← citeshttps://doi.org/10.1007/s00037-012-0036-6openalex-snapshot
Pseudorandom Generators for Combinatorial Checkerboards
inferred← citeshttps://doi.org/10.1007/s00037-012-0051-7openalex-snapshot
Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields
inferred← citeshttps://doi.org/10.1007/s00037-015-0121-8openalex-snapshot
Cryptographic Hardness of Random Local Functions
inferred← citeshttps://doi.org/10.1109/ccc.2008.14openalex-snapshot
Noisy Interpolating Sets for Low Degree Polynomials
inferred← citeshttps://doi.org/10.1109/ccc.2012.20openalex-snapshot
Hitting Set Generators for Sparse Polynomials over Any Finite Fields
inferred← citeshttps://doi.org/10.1109/ccc.2014.33openalex-snapshot
Algorithms for Circuits and Circuits for Algorithms
inferred← citeshttps://doi.org/10.1109/focs.2009.68openalex-snapshot
Bounded Independence Fools Halfspaces
inferred← citeshttps://doi.org/10.1109/focs.2010.54openalex-snapshot
Optimal Testing of Reed-Muller Codes
inferred← citeshttps://doi.org/10.1109/focs.2010.72openalex-snapshot
Pseudorandom Generators for CC0[p] and the Fourier Spectrum of Low-Degree Polynomials over Finite Fields
inferred← citeshttps://doi.org/10.1109/focs.2011.41openalex-snapshot
New Extension of the Weil Bound for Character Sums with Applications to Coding
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00045openalex-snapshot
Fooling polynomials using invariant theory
inferred← citeshttps://doi.org/10.1109/tit.2012.2184841openalex-snapshot
Weight Distribution and List-Decoding Size of Reed–Muller Codes
inferred← citeshttps://doi.org/10.1109/tit.2014.2340869openalex-snapshot
A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem
inferred← citeshttps://doi.org/10.1137/17m1129088openalex-snapshot
Bounded Independence Plus Noise Fools Products
inferred← citeshttps://doi.org/10.1145/1536414.1536510openalex-snapshot
Random graphs and the parity quantifier
inferred← citeshttps://doi.org/10.1561/0400000064openalex-snapshot
Higher-order Fourier Analysis and Applications
inferred← citeshttps://doi.org/10.1561/0400000108openalex-snapshot
Quantified Derandomization: How to Find Water in the Ocean
inferred← citeshttps://doi.org/10.1561/0400000109openalex-snapshot
Paradigms for Unconditional Pseudorandom Generators
inferred← citeshttps://doi.org/10.1561/9781680835939openalex-snapshot
Higher-order Fourier Analysis and Applications
inferred← citeshttps://doi.org/10.48550/arxiv.2107.10797openalex-snapshot
Fourier growth of structured $\mathbb{F}_2$-polynomials and applications
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.