On the public citation graph

https://doi.org/10.4086/toc.2011.v007a006

0 signed · 66 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.1002/rsa.10068openalex-snapshot
Simple analysis of graph tests for linearity and PCP
inferredcites →https://doi.org/10.1007/978-3-031-40744-4_5openalex-snapshot
Suspending OpenMP Tasks on Asynchronous Events: Extending the Taskwait Construct
inferredcites →https://doi.org/10.1007/978-3-540-45198-3_17openalex-snapshot
Testing Low-Degree Polynomials over GF(2)
inferredcites →https://doi.org/10.1007/978-3-642-16367-8_18openalex-snapshot
Testing Linear-Invariant Non-linear Properties: A Short Report
inferredcites →https://doi.org/10.1007/bf01200430openalex-snapshot
Non-deterministic exponential time has two-prover interactive protocols
inferredcites →https://doi.org/10.1007/s00039-005-0509-8openalex-snapshot
A Szemerédi-type regularity lemma in abelian groups, with applications
inferredcites →https://doi.org/10.1007/s11856-011-0080-yopenalex-snapshot
A removal lemma for systems of linear equations over finite fields
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.1016/j.jcta.2008.12.003openalex-snapshot
A combinatorial proof of the Removal Lemma for Groups
inferredcites →https://doi.org/10.1090/s0002-9947-1959-0101527-3openalex-snapshot
Matroids and graphs
inferredcites →https://doi.org/10.1109/18.556674openalex-snapshot
Linearity testing in characteristic two
inferredcites →https://doi.org/10.1109/focs.2004.64openalex-snapshot
Testing Low-Degree Polynomials over Prime Fields
inferredcites →https://doi.org/10.1109/focs.2004.65openalex-snapshot
Testing Polynomials over General Fields
inferredcites →https://doi.org/10.1109/focs.2010.53openalex-snapshot
A Unified Framework for Testing Linear-Invariant Properties
inferredcites →https://doi.org/10.1109/sfcs.2005.5openalex-snapshot
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
inferredcites →https://doi.org/10.1112/plms/pdp019openalex-snapshot
The true complexity of a system of linear equations
inferredcites →https://doi.org/10.1137/06064888xopenalex-snapshot
A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
inferredcites →https://doi.org/10.1137/060667177openalex-snapshot
A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
inferredcites →https://doi.org/10.1137/s0097539700366528openalex-snapshot
Regular Languages are Testable with a Constant Number of Queries
inferredcites →https://doi.org/10.1137/s0097539793255151openalex-snapshot
Robust Characterizations of Polynomials with Applications to Program Testing
inferredcites →https://doi.org/10.1137/s0097539796302531openalex-snapshot
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
inferredcites →https://doi.org/10.1137/s0895480101407444openalex-snapshot
Testing Basic Boolean Formulae
inferredcites →https://doi.org/10.1145/100216.100225openalex-snapshot
Self-testing/correcting with applications to numerical problems
inferredcites →https://doi.org/10.1145/1060590.1060611openalex-snapshot
Every monotone graph property is testable
inferredcites →https://doi.org/10.1145/1132516.1132519openalex-snapshot
Gowers uniformity, influence of variables, and PCPs
inferredcites →https://doi.org/10.1145/1132516.1132555openalex-snapshot
A combinatorial characterization of the testable graph properties
inferredcites →https://doi.org/10.1145/1132516.1132556openalex-snapshot
Graph limits and parameter testing
inferredcites →https://doi.org/10.1145/1374376.1374434openalex-snapshot
Algebraic property testing
inferredcites →https://doi.org/10.1145/1536414.1536438openalex-snapshot
Green's conjecture and testing linear-invariant properties
inferredcites →https://doi.org/10.1145/258533.258536openalex-snapshot
Some optimal inapproximability results
inferredcites →https://doi.org/10.1145/273865.273901openalex-snapshot
Probabilistic checking of proofs
inferredcites →https://doi.org/10.1145/278298.278306openalex-snapshot
Proof verification and the hardness of approximation problems
inferredcites →https://doi.org/10.1145/285055.285060openalex-snapshot
Property testing and its connection to learning and approximation
inferredcites →https://doi.org/10.1145/335305.335329openalex-snapshot
A PCP characterization of NP with optimal amortized query complexity
inferredcites →https://doi.org/10.2307/1993185openalex-snapshot
Matroids and Graphs
inferredcites →https://doi.org/10.4007/annals.2010.171.1753openalex-snapshot
Linear equations in primes
inferredcites →https://doi.org/10.4086/tocopenalex-snapshot
Theory of Computing
inferredcites →https://doi.org/10.4230/lipics.stacs.2009.1823openalex-snapshot
Testing Linear-Invariant Non-Linear Properties
inferredcites →https://doi.org/10.48550/arxiv.1008.4401openalex-snapshot
Separations of Matroid Freeness Properties
inferredcites →https://doi.org/10.48550/arxiv.math/0310476openalex-snapshot
A Szemeredi-type regularity lemma in abelian groups, with applications

What points at this work

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

inferred← citeshttps://doi.org/10.1002/rsa.20507openalex-snapshot
A unified framework for testing linear‐invariant properties
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_12openalex-snapshot
Invariance in Property Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_30openalex-snapshot
Green’s Conjecture and Testing Linear Invariant Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_34openalex-snapshot
On Sums of Locally Testable Affine Invariant Properties
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_11openalex-snapshot
Polynomial Decompositions in Polynomial Time
inferred← citeshttps://doi.org/10.1007/s00037-015-0115-6openalex-snapshot
Sparse affine-invariant linear codes are locally testable
inferred← citeshttps://doi.org/10.1017/9781009490559.008openalex-snapshot
The Slice Rank Polynomial Method – A Survey a Few Years Later
inferred← citeshttps://doi.org/10.1017/s0963548312000363openalex-snapshot
Testing Odd-Cycle-Freeness in Boolean Functions
inferred← citeshttps://doi.org/10.1109/focs.2010.53openalex-snapshot
A Unified Framework for Testing Linear-Invariant Properties
inferred← citeshttps://doi.org/10.1109/focs.2012.38openalex-snapshot
Sparse Affine-Invariant Linear Codes Are Locally Testable
inferred← citeshttps://doi.org/10.1109/focs.2013.33openalex-snapshot
Estimating the Distance from Testable Affine-Invariant Properties
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00113openalex-snapshot
Testing linear-invariant properties
inferred← citeshttps://doi.org/10.1137/1.9781611973105.97openalex-snapshot
Testing Low Complexity Affine-Invariant Properties
inferred← citeshttps://doi.org/10.1137/100791075openalex-snapshot
Sublinear Time Algorithms
inferred← citeshttps://doi.org/10.1137/18m1217978openalex-snapshot
Flipping Out with Many Flips: Hardness of Testing $k$-Monotonicity
inferred← citeshttps://doi.org/10.1137/21m1397246openalex-snapshot
Testing Linear-Invariant Properties
inferred← citeshttps://doi.org/10.1145/1536414.1536438openalex-snapshot
Green's conjecture and testing linear-invariant properties
inferred← citeshttps://doi.org/10.1145/2488608.2488662openalex-snapshot
Every locally characterized affine-invariant property is testable
inferred← citeshttps://doi.org/10.1145/2556663.2556678openalex-snapshot
Guest column
inferred← citeshttps://doi.org/10.1145/2591796.2591802openalex-snapshot
A characterization of locally testable affine-invariant properties via decomposition theorems
inferred← citeshttps://doi.org/10.1561/0400000064openalex-snapshot
Higher-order Fourier Analysis and Applications
inferred← citeshttps://doi.org/10.1561/9781680835939openalex-snapshot
Higher-order Fourier Analysis and Applications
inferred← citeshttps://doi.org/10.4086/toc.2012.v008a004openalex-snapshot
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2014.669openalex-snapshot
Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication
inferred← citeshttps://doi.org/10.48550/arxiv.1008.4401openalex-snapshot
Separations of Matroid Freeness Properties
inferred← citeshttps://doi.org/10.48550/arxiv.1010.4925openalex-snapshot
Property Testing via Set-Theoretic Operations
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.