On the public citation graph
A global postsynthesis optimization method for combinational circuits
0 signed · 35 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.1007/978-1-4899-5327-8_25openalex-snapshot
On the Complexity of Derivation in Propositional Calculus
inferredcites →https://doi.org/10.1007/978-3-540-46239-2_9openalex-snapshot
Cartesian Genetic Programming
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_28openalex-snapshot
On the Complexity of Derivation in Propositional Calculus
inferredcites →https://doi.org/10.1007/s10710-010-9112-3openalex-snapshot
Human-competitive results produced by genetic programming
inferredcites →https://doi.org/10.1016/j.asoc.2008.08.004openalex-snapshot
Practical and scalable evolution of digital circuits
inferredcites →https://doi.org/10.1023/b:aire.0000006609.72718.ddopenalex-snapshot
Evolutionary Synthesis of Arithmetic Circuit Structures
inferredcites →https://doi.org/10.1109/date.2001.915010openalex-snapshot
Using SAT for combinational equivalence checking
inferredcites →https://doi.org/10.1109/date.2009.5090755openalex-snapshot
A graph grammar based approach to automated multi-objective analog circuit design
inferredcites →https://doi.org/10.1109/date.2010.5456949openalex-snapshot
Large-scale Boolean matching
inferredcites →https://doi.org/10.1109/ddecs.2010.5491755openalex-snapshot
On logic synthesis of conventionally hard to synthesize circuits using genetic programming
inferredcites →https://doi.org/10.1109/iccd.2008.4751838openalex-snapshot
Improving SAT-based Combinational Equivalence Checking through circuit preprocessing
inferredcites →https://doi.org/10.1145/1278480.1278712openalex-snapshot
Simultaneous multi-topology multi-objective sizing across thousands of analog circuit topologies
inferredcites →https://doi.org/10.1145/1830761.1830924openalex-snapshot
Cartesian genetic programming
inferredcites →https://doi.org/10.5555/1874620.1874793openalex-snapshot
A graph grammar based approach to automated multi-objective analog circuit design
inferredcites →https://doi.org/10.5555/367072.367111openalex-snapshot
Using SAT for combinational equivalence checking
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-3-319-16501-1_12openalex-snapshot
Cartesian GP in Optimization of Combinational Circuits with Hundreds of Inputs and Thousands of Gates
inferred← citeshttps://doi.org/10.1007/978-3-319-67997-6_9openalex-snapshot
Approximate Computing: An Old Job for Cartesian Genetic Programming?
inferred← citeshttps://doi.org/10.1007/978-3-319-99322-5_9openalex-snapshot
Automated Search-Based Functional Approximation for Digital Circuits
inferred← citeshttps://doi.org/10.1007/s10710-012-9178-1openalex-snapshot
A module-level three-stage approach to the evolutionary design of sequential logic circuits
inferred← citeshttps://doi.org/10.1049/cdt2.12062openalex-snapshot
Multi‐objective digital circuit block optimisation based on cell mapping in an industrial electronic design automation flow
inferred← citeshttps://doi.org/10.1109/cec.2012.6256649openalex-snapshot
On area minimization of complex combinational circuits using cartesian genetic programming
inferred← citeshttps://doi.org/10.1109/cec.2014.6900326openalex-snapshot
Cartesian genetic programming as local optimizer of logic networks
inferred← citeshttps://doi.org/10.1109/fpl.2016.7577305openalex-snapshot
Search-based synthesis of approximate circuits implemented into FPGAs
inferred← citeshttps://doi.org/10.1109/ices.2013.6613288openalex-snapshot
Designing function configuration decoders for the PAnDA architecture using multi-objective Cartesian Genetic Programming
inferred← citeshttps://doi.org/10.1109/ices.2014.7008732openalex-snapshot
How to evolve complex combinational circuits from scratch?
inferred← citeshttps://doi.org/10.1109/icufn69619.2026.11628624openalex-snapshot
CCGP: A Cooperative Coevolutionary Cartesian Genetic Programming Algorithm for Finite State Machine Synthesis
inferred← citeshttps://doi.org/10.1109/ssci.2016.7850173openalex-snapshot
Evolutionary functional approximation of circuits implemented into FPGAs
inferred← citeshttps://doi.org/10.1145/2001858.2002140openalex-snapshot
Evolution of digital circuits
inferred← citeshttps://doi.org/10.1145/2228360.2228507openalex-snapshot
Generalized SAT-sweeping for post-mapping optimization
inferred← citeshttps://doi.org/10.1145/3299819.3299832openalex-snapshot
An extrinsic EHW system for the evolutionary optimization and design of sequential circuit
inferred← citeshttps://doi.org/10.23919/date.2017.7926993openalex-snapshot
EvoApprox8b: Library of Approximate Adders and Multipliers for Circuit Design and Benchmarking of Approximation Methods
inferred← citeshttps://doi.org/10.48550/arxiv.2105.10410openalex-snapshot
Multi-objective Optimisation of Digital Circuits based on Cell Mapping in an Industrial EDA Flow
inferred← citeshttps://doi.org/10.5555/2492708.2492889openalex-snapshot
A SAT-based fitness function for evolutionary optimization of polymorphic circuits
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.