On the public citation graph

Non‐Abelian homomorphism testing, and distributions close to their self‐convolutions

0 signed · 28 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-540-27821-4_25openalex-snapshot
Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutions
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.1109/18.556674openalex-snapshot
Linearity testing in characteristic two
inferredcites →https://doi.org/10.1109/sfcs.2002.1181878openalex-snapshot
Locally testable codes and PCPs of almost-linear length
inferredcites →https://doi.org/10.1145/100216.100225openalex-snapshot
Self-testing/correcting with applications to numerical problems
inferredcites →https://doi.org/10.1145/1007352.1007421openalex-snapshot
Derandomizing homomorphism testing in general groups
inferredcites →https://doi.org/10.1145/278298.278306openalex-snapshot
Proof verification and the hardness of approximation problems
inferredcites →https://doi.org/10.1145/335305.335329openalex-snapshot
A PCP characterization of NP with optimal amortized query complexity
inferredcites →https://doi.org/10.1145/780542.780631openalex-snapshot
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets

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.20639openalex-snapshot
Testing properties of functions on finite groups
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_202openalex-snapshot
Linearity Testing/Testing Hadamard Codes
inferred← citeshttps://doi.org/10.1007/978-3-319-96884-1_18openalex-snapshot
On the Local Leakage Resilience of Linear Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_202-2openalex-snapshot
Linearity and Group Homomorphism Testing/Testing Hadamard Codes
inferred← citeshttps://doi.org/10.1007/s00145-021-09375-2openalex-snapshot
On the Local Leakage Resilience of Linear Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/s10878-011-9445-8openalex-snapshot
Property testing for cyclic groups and beyond
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.10.009openalex-snapshot
On the distance between non-isomorphic groups
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.04.009openalex-snapshot
A characterization of testable hypergraph properties
inferred← citeshttps://doi.org/10.1109/focs.2017.84openalex-snapshot
A Characterization of Testable Hypergraph Properties
inferred← citeshttps://doi.org/10.1137/060667177openalex-snapshot
A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
inferred← citeshttps://doi.org/10.1137/100791075openalex-snapshot
Sublinear Time Algorithms
inferred← citeshttps://doi.org/10.1137/140958578openalex-snapshot
Approximate Representations, Approximate Homomorphisms, and Low-Dimensional Embeddings of Groups
inferred← citeshttps://doi.org/10.1137/16m1061655openalex-snapshot
Direct Sum Testing
inferred← citeshttps://doi.org/10.1137/16m1076666openalex-snapshot
Sampling Correctors
inferred← citeshttps://doi.org/10.31237/osf.io/rx6ztopenalex-snapshot
Property Testing and Probability Distributions: New Techniques, New Models, and New Goals
inferred← citeshttps://doi.org/10.31237/osf.io/rx6zt_v1openalex-snapshot
Property Testing and Probability Distributions: New Techniques, New Models, and New Goals
inferred← citeshttps://doi.org/10.4086/toc.2020.v016a003openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2020.v016a005openalex-snapshot
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.