On the public citation graph
An Efficient Sparse Regularity Concept
0 signed · 42 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/(sici)1098-2418(199605)8:3<187::aid-rsa3>3.0.co;2-uopenalex-snapshot
MAX-CUT has a randomized approximation scheme in dense graphs
inferredcites →https://doi.org/10.1002/rsa.20116openalex-snapshot
A spectral heuristic for bisecting random graphs
inferredcites →https://doi.org/10.1006/jagm.1994.1005openalex-snapshot
The Algorithmic Aspects of the Regularity Lemma
inferredcites →https://doi.org/10.1006/jcss.1998.1605openalex-snapshot
Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems
inferredcites →https://doi.org/10.1007/pl00001621openalex-snapshot
Lower bounds of tower type for Szemerédi's uniformity lemma
inferredcites →https://doi.org/10.1007/s004930050052openalex-snapshot
Quick Approximation to Matrices and Applications
inferredcites →https://doi.org/10.1016/s0022-0000(03)00008-4openalex-snapshot
Random sampling and approximation of MAX-CSPs
inferredcites →https://doi.org/10.1017/s096354830600784xopenalex-snapshot
Strong Refutation Heuristics for Random k -SAT
inferredcites →https://doi.org/10.1137/s009753970444096xopenalex-snapshot
Recognizing More Unsatisfiable Random k -SAT Instances Efficiently
inferredcites →https://doi.org/10.1137/s0097539793247634openalex-snapshot
A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
inferredcites →https://doi.org/10.1137/s0097539797328847openalex-snapshot
Gadgets, Approximation, and Linear Programming
inferredcites →https://doi.org/10.1145/258533.258536openalex-snapshot
Some optimal inapproximability results
inferredcites →https://doi.org/10.1145/285055.285060openalex-snapshot
Property testing and its connection to learning and approximation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpa.21398openalex-snapshot
Grothendieck‐Type Inequalities in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1002/rsa.21053openalex-snapshot
A unified view of graph regularity via matrix decompositions
inferred← citeshttps://doi.org/10.1007/978-3-642-04944-6_10openalex-snapshot
Propagation Connectivity of Random Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00039-015-0324-9openalex-snapshot
A relative Szemerédi theorem
inferred← citeshttps://doi.org/10.1007/s10710-010-9110-5openalex-snapshot
Theoretical results in genetic programming: the next ten years?
inferred← citeshttps://doi.org/10.1090/tran/7543openalex-snapshot
An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
inferred← citeshttps://doi.org/10.1103/physrevx.15.021077openalex-snapshot
Quartic Quantum Speedups for Planted Inference
inferred← citeshttps://doi.org/10.1109/focs.2011.95openalex-snapshot
Rounding Semidefinite Programming Hierarchies via Global Correlation
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00026openalex-snapshot
Efficient Algorithms for Semirandom Planted CSPs at the Refutation Threshold
inferred← citeshttps://doi.org/10.1137/1.9781611974782.82openalex-snapshot
Statistical Query Algorithms for Stochastic Convex Optimization
inferred← citeshttps://doi.org/10.1137/1.9781611976465.28openalex-snapshot
Strongly refuting all semi-random Boolean CSPs
inferred← citeshttps://doi.org/10.1137/16m1078471openalex-snapshot
On the Complexity of Random Satisfiability Problems with Planted Solutions
inferred← citeshttps://doi.org/10.1137/16m1086558openalex-snapshot
An Algorithmic Regularity Lemma for $L_p$ Regular Sparse Matrices
inferred← citeshttps://doi.org/10.1145/2554797.2554836openalex-snapshot
Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems
inferred← citeshttps://doi.org/10.1145/2591796.2591820openalex-snapshot
From average case complexity to improper learning complexity
inferred← citeshttps://doi.org/10.1145/2746539.2746577openalex-snapshot
On the Complexity of Random Satisfiability Problems with Planted Solutions
inferred← citeshttps://doi.org/10.1145/2897518.2897520openalex-snapshot
Complexity theoretic limitations on learning halfspaces
inferred← citeshttps://doi.org/10.1145/3055399.3055417openalex-snapshot
Strongly refuting random CSPs below the spectral threshold
inferred← citeshttps://doi.org/10.1145/3717823.3718257openalex-snapshot
Near Optimal Constant Inapproximability under ETH for Fundamental Problems in Parameterized Complexity
inferred← citeshttps://doi.org/10.1215/00127094-2023-0029openalex-snapshot
Regularity method and large deviation principles for the Erdős–Rényi hypergraph
inferred← citeshttps://doi.org/10.1287/moor.2020.1111openalex-snapshot
Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10099openalex-snapshot
Learning Abductive Reasoning Using Random Examples
inferred← citeshttps://doi.org/10.48550/arxiv.1401.2906openalex-snapshot
An $L^p$ theory of sparse graph convergence I: limits, sparse random graph models, and power law distributions
inferred← citeshttps://doi.org/10.48550/arxiv.1404.3378openalex-snapshot
Complexity theoretic limitations on learning DNF's
inferred← citeshttps://doi.org/10.48550/arxiv.1407.2774openalex-snapshot
Subsampled Power Iteration: a Unified Algorithm for Block Models and Planted CSP's
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.