On the public citation graph
Logical Design of Electrical Circuits.
0 signed · 37 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf00267849openalex-snapshot
Monokaryotic fruiting in Schizophyllum commune: Genetic control of the response to mechanical injury
inferred← citeshttps://doi.org/10.1007/bf01031171openalex-snapshot
Classification of Boolean functions of n variables
inferred← citeshttps://doi.org/10.1007/bf01039772openalex-snapshot
Synthesis and estimation of number of contacts in minimal switching circuits
inferred← citeshttps://doi.org/10.1007/s00426-022-01753-0openalex-snapshot
A comparative investigation of integral- and separable-dimension stimulus-sorting behavior
inferred← citeshttps://doi.org/10.1007/s10339-017-0840-7openalex-snapshot
On the learning difficulty of visual and auditory modal concepts: Evidence for a single processing system
inferred← citeshttps://doi.org/10.1016/j.ins.2011.05.020openalex-snapshot
Representational information: a new general notion and measure of information
inferred← citeshttps://doi.org/10.1016/j.jmp.2006.05.007openalex-snapshot
A note on the complexity of Boolean concepts
inferred← citeshttps://doi.org/10.1016/j.jmp.2009.04.009openalex-snapshot
Categorical invariance and structural complexity in human concept learning
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00086-9openalex-snapshot
Transistor chaining in static CMOS functional cells of arbitrary planar topology
inferred← citeshttps://doi.org/10.1027/1618-3169/a000337openalex-snapshot
Constructing and Deconstructing Concepts
inferred← citeshttps://doi.org/10.1037/h0093825openalex-snapshot
Learning and memorization of classifications.
inferred← citeshttps://doi.org/10.1080/20445911.2012.755510openalex-snapshot
Will the most informative object stand? Determining the impact of structural context on informativeness judgements
inferred← citeshttps://doi.org/10.1109/aqtr.2012.6237718openalex-snapshot
Software minimization of ternary functions using Matlab
inferred← citeshttps://doi.org/10.1109/focs.1961.10openalex-snapshot
Boolean two-terminal analysis and synthesis
inferred← citeshttps://doi.org/10.1109/glsv.1996.497619openalex-snapshot
Transistor chaining in CMOS leaf cells of planar topology
inferred← citeshttps://doi.org/10.1109/icecs.2014.7050068openalex-snapshot
Why hybridize NEMS with CMOS?
inferred← citeshttps://doi.org/10.1109/jrproc.1961.287790openalex-snapshot
Arbitrary Boolean Functions of N Variables Realizable in Terms of Threshold Devices
inferred← citeshttps://doi.org/10.1109/mwscas.1992.271270openalex-snapshot
Dual independent layout generation of arbitrary circuit topologies
inferred← citeshttps://doi.org/10.1109/pgec.1963.263531openalex-snapshot
A Catalog of Three-Variable Or-Invert and And-Invert Logical Circuits
inferred← citeshttps://doi.org/10.1109/pgec.1966.264299openalex-snapshot
A Survey and Assessment of Progress in Switching Theory and Logical Design in the Soviet Union
inferred← citeshttps://doi.org/10.1109/reepe.2019.8708838openalex-snapshot
Formalized Choice of Electric Grid Configuration With Specific Properties
inferred← citeshttps://doi.org/10.1109/socc.2016.7905496openalex-snapshot
Self-dual diamond-graph CMOS H-bridge logic family
inferred← citeshttps://doi.org/10.1109/swat.1966.32openalex-snapshot
The universal logic block (ULB) and its application to logic design
inferred← citeshttps://doi.org/10.1109/te.1969.4320516openalex-snapshot
New Considerations in Teaching Switching Theory
inferred← citeshttps://doi.org/10.1109/tec.1959.5222698openalex-snapshot
Logical Machine Design II: A Selected Bibliography
inferred← citeshttps://doi.org/10.1109/tec.1960.5219832openalex-snapshot
Self-Complementary Symmetry Types of Boolean Functions
inferred← citeshttps://doi.org/10.1109/tec.1962.5219458openalex-snapshot
The Design of Complementary-Output Networks
inferred← citeshttps://doi.org/10.1137/0111059openalex-snapshot
The Number of Transitivity Sets of Boolean Functions
inferred← citeshttps://doi.org/10.1145/362929.362976openalex-snapshot
Curriculum 68: Recommendations for academic programs in computer science
inferred← citeshttps://doi.org/10.1287/opre.12.4.519openalex-snapshot
An Application of Symbolic Logic to a Selection Problem
inferred← citeshttps://doi.org/10.1371/journal.pone.0328368openalex-snapshot
Constructing concepts without feedback: An empirical investigation of how relational information affects multidimensional concept completion behavior in an unsupervised task
inferred← citeshttps://doi.org/10.2178/bsl/1246453975openalex-snapshot
Enumerating Types of Boolean Functions
inferred← citeshttps://doi.org/10.3390/info4010001openalex-snapshot
Complexity over Uncertainty in Generalized Representational Information Theory (GRIT): A Structure-Sensitive General Theory of Information
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.