On the public citation graph

FO[\le]-Uniformity

https://doi.org/10.1109/ccc.2006.20
0 signed · 21 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.2000.1742openalex-snapshot
The Descriptive Complexity Approach to LOGCFL
inferredcites →https://doi.org/10.1007/11672142_40openalex-snapshot
Definability of Languages by Generalized First-Order Formulas over (N,+)
inferredcites →https://doi.org/10.1007/978-1-4612-0289-9openalex-snapshot
Finite Automata, Formal Logic, and Circuit Complexity
inferredcites →https://doi.org/10.1007/978-3-540-31856-9_41openalex-snapshot
Characterizing TC0 in Terms of Infinite Groups
inferredcites →https://doi.org/10.1016/0022-0000(90)90022-dopenalex-snapshot
On uniformity within NC1
inferredcites →https://doi.org/10.1109/ccc.2004.1313817openalex-snapshot
Some results on majority quantifiers over words
inferredcites →https://doi.org/10.1109/lics.2001.932496openalex-snapshot
The Crane Beach Conjecture

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11874683_28openalex-snapshot
An Algebraic Point of View on the Crane Beach Property
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_15openalex-snapshot
Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_7openalex-snapshot
Extensional Uniformity for Boolean Circuits
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_11openalex-snapshot
Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG]
inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_23openalex-snapshot
Randomisation and Derandomisation in Descriptive Complexity Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_52openalex-snapshot
The Lower Reaches of Circuit Uniformity
inferred← citeshttps://doi.org/10.1007/978-3-662-53132-7_6openalex-snapshot
A Language-Theoretical Approach to Descriptive Complexity
inferred← citeshttps://doi.org/10.1007/s00037-014-0089-9openalex-snapshot
The complexity of intersecting finite automata having few final states
inferred← citeshttps://doi.org/10.1007/s00236-012-0157-zopenalex-snapshot
First-order logics: some characterizations and closure properties
inferred← citeshttps://doi.org/10.1007/s00236-022-00432-2openalex-snapshot
The regular languages of wire linear AC$$^0$$
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.07.005openalex-snapshot
Linear circuits, two-variable logic and weakly blocked monoids
inferred← citeshttps://doi.org/10.1109/lics.2012.55openalex-snapshot
Non-definability of Languages by Generalized First-order Formulas over (N,+)
inferred← citeshttps://doi.org/10.1109/lics.2017.8005148openalex-snapshot
A crevice on the Crane Beach: Finite-degree predicates
inferred← citeshttps://doi.org/10.1145/3090064.3090068openalex-snapshot
Stone duality for languages and complexity
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.