On the public citation graph
Automated synthesis of combinational circuits by cascade networks of multiplexers
0 signed · 16 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.1049/ip-e.1980.0012openalex-snapshot
Cascade networks of logic functions built in multiplexer units
inferredcites →https://doi.org/10.1109/t-c.1970.222879openalex-snapshot
Universal Logic Modules and Their Applications
inferredcites →https://doi.org/10.1109/t-c.1975.224108openalex-snapshot
Fault Detecting Test Sets for Reed-Muller Canonic Networks
inferredcites →https://doi.org/10.1109/t-c.1975.224191openalex-snapshot
Characterization of Unate Cascade Realizability Using Parameters
inferredcites →https://doi.org/10.1109/tc.1986.1676826openalex-snapshot
An Algorithm for Optimal Logic Design Using Multiplexers
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1049/ip-e.1992.0048openalex-snapshot
Automated synthesis of digital multiplexer networks
inferred← citeshttps://doi.org/10.1049/ip-e.1993.0015openalex-snapshot
Reed-Muller universal logic module networks
inferred← citeshttps://doi.org/10.1080/03052150410001686503openalex-snapshot
Using genetic programing and multiplexers for the synthesis of logic circuits
inferred← citeshttps://doi.org/10.1109/43.248076openalex-snapshot
Synthesis of multilevel multiplexer circuits for incompletely specified multioutput Boolean functions with mapping to multiplexer based FPGA's
inferred← citeshttps://doi.org/10.1109/cec.2000.870363openalex-snapshot
Gate-level synthesis of Boolean functions using binary multiplexers and genetic programming
inferred← citeshttps://doi.org/10.1109/eh.1999.785434openalex-snapshot
A genetic programming approach to logic function synthesis by means of multiplexers
inferred← citeshttps://doi.org/10.1109/icvd.1995.512079openalex-snapshot
Synthesis of multiplexer network using ratio parameters and mapping onto FPGAs
inferred← citeshttps://doi.org/10.1109/tencon.1989.177076openalex-snapshot
Ratio parameters: a new signature for exhaustive testing
inferred← citeshttps://doi.org/10.1109/tencon.1991.753862openalex-snapshot
State assignment of finite state machines for optimal implementation using MUXs
inferred← citeshttps://doi.org/10.15760/etd.1338openalex-snapshot
Orthogonal and Nonorthogonal Expansions for Multi-Level Logic Synthesis for Nearly Linear Functions and their Application to Field Programmable Gate Array Mapping
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.