On the public citation graph

Easily testable realizations for generalized Reed-Muller expressions

0 signed · 81 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.1007/978-1-4613-1385-4openalex-snapshot
Representations of Discrete Functions
inferredcites →https://doi.org/10.1007/978-1-4613-1385-4_2openalex-snapshot
Representations of Logic Functions Using EXOR Operators
inferredcites →https://doi.org/10.1007/978-1-4615-3154-8openalex-snapshot
Logic Synthesis and Optimization
inferredcites →https://doi.org/10.1007/978-1-4615-3154-8_13openalex-snapshot
And-Exor Expressions and their Optimization
inferredcites →https://doi.org/10.1016/0010-4485(86)90300-3openalex-snapshot
Logic Testing and Design for testability
inferredcites →https://doi.org/10.1016/0378-4754(79)90148-4openalex-snapshot
Discrete and switching functions.
inferredcites →https://doi.org/10.1049/ip-cdt:19960826openalex-snapshot
GRMIN2: A heuristic simplification algorithm for generalised Reed–Muller expressions
inferredcites →https://doi.org/10.1049/ip-e.1993.0009openalex-snapshot
Canonical restricted mixed-polarity exclusive-OR sums of products and the efficient algorithm for their minimisation
inferredcites →https://doi.org/10.1109/12.223676openalex-snapshot
Minimization of AND-EXOR expressions using rewrite rules
inferredcites →https://doi.org/10.1109/12.24287openalex-snapshot
Fault detection in combinational networks by Reed-Muller transforms
inferredcites →https://doi.org/10.1109/12.45212openalex-snapshot
On the complexity of mod-2l sum PLA's
inferredcites →https://doi.org/10.1109/43.277608openalex-snapshot
EXMIN2: a simplification algorithm for exclusive-OR-sum-of-products expressions for multiple-valued-input two-valued-output functions
inferredcites →https://doi.org/10.1109/dac.1992.227867openalex-snapshot
Fast exact and quasi-minimal minimization of highly testable fixed-polarity AND/XOR canonical networks
inferredcites →https://doi.org/10.1109/iccd.1992.276211openalex-snapshot
Fast minimization of mixed-polarity AND/XOR canonical networks
inferredcites →https://doi.org/10.1109/t-c.1971.223163openalex-snapshot
On Realizations of Boolean Functions Requiring a Minimal or Near-Minimal Number of Tests
inferredcites →https://doi.org/10.1109/t-c.1972.223475openalex-snapshot
Easily Testable Realizations ror Logic Functions
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/tc.1977.5009270openalex-snapshot
Diagnosis of Faults in Linear Tree Networks
inferredcites →https://doi.org/10.1109/tc.1978.1675057openalex-snapshot
Universal Test Sets for Multiple Fault Detection in AND-EXOR Arrays
inferredcites →https://doi.org/10.1109/tc.1981.1675840openalex-snapshot
On Closedness and Test Complexity of Logic Circuits
inferredcites →https://doi.org/10.1145/224818.224919openalex-snapshot
GRMIN
inferredcites →https://doi.org/10.5555/113938.113930openalex-snapshot
Fast exact and quasi-minimal minimization of highly testable fixed-polarity AND/XOR canonical networks
inferredcites →https://doi.org/10.7551/mitpress/4317.001.0001openalex-snapshot
Logic Testing and Design for Testability

What points at this work

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

inferred← citeshttps://doi.org/10.1007/0-387-30311-1openalex-snapshot
Fundamentals of Switching Theory and Logic Design - A Hands on Approach
inferred← citeshttps://doi.org/10.1007/978-1-4614-4193-9_9openalex-snapshot
Low Cost C-Testable Finite Field Multiplier Architectures
inferred← citeshttps://doi.org/10.1007/s11767-005-0224-5openalex-snapshot
Fault detection test set for testable realizations of logic functions with ESOP expressions
inferred← citeshttps://doi.org/10.1007/s11767-006-0055-zopenalex-snapshot
Circuit testable design and universal test sets for multiple-valued logic functions
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2009.01.006openalex-snapshot
Testable design of AND–EXOR logic networks with universal test sets
inferred← citeshttps://doi.org/10.1016/j.eswa.2025.128173openalex-snapshot
A two-stage HV-driven adaptive multi-objective evolutionary algorithm and its application in fixed polarity reed-muller circuits
inferred← citeshttps://doi.org/10.1016/s1383-7621(00)00060-6openalex-snapshot
Baldwinian learning utilizing genetic and heuristic algorithms for logic synthesis and minimization of incompletely specified data with Generalized Reed–Muller (AND–EXOR) forms
inferred← citeshttps://doi.org/10.1016/s1383-7621(00)00061-8openalex-snapshot
Self-repairable GALs
inferred← citeshttps://doi.org/10.1023/a:1013724528462openalex-snapshot
Easily Testable Realization of a Circuit on the Basis of Polynomial Representation of Output Functions
inferred← citeshttps://doi.org/10.1049/ip-cdt:20010252openalex-snapshot
Reed--Muller tree-based minimisation of fixed polarity Reed–Muller expansions
inferred← citeshttps://doi.org/10.1049/ip-cdt:20040031openalex-snapshot
Testing of stuck-open faults in generalised Reed–Muller and EXOR sum-of-products CMOS circuits
inferred← citeshttps://doi.org/10.1049/ip-cdt:20050079openalex-snapshot
Universal test set for detecting stuck-at and bridging faults in double fixed-polarity Reed–Muller programmable logic arrays
inferred← citeshttps://doi.org/10.1080/0020721031000093129openalex-snapshot
A new approach to generate fixed-polarity Reed–Muller expansions for completely and incompletely specified functions
inferred← citeshttps://doi.org/10.1088/1674-4926/32/2/025007openalex-snapshot
Low power mapping for AND/XOR circuits and its application in searching the best mixed-polarity
inferred← citeshttps://doi.org/10.1109/12.841130openalex-snapshot
A minimal universal test set for self-test of EXOR-Sum-of-Products circuits
inferred← citeshttps://doi.org/10.1109/12.895943openalex-snapshot
Easily testable multiple-valued logic circuits derived from Reed-Muller circuits
inferred← citeshttps://doi.org/10.1109/apccas.1998.743779openalex-snapshot
Easily testable realization based on OR-AND-EXOR expansion with single rail inputs
inferred← citeshttps://doi.org/10.1109/apccas.2006.342502openalex-snapshot
Simplification of Exclusive-or Sum-of-Products Expressions Through Function Transformation
inferred← citeshttps://doi.org/10.1109/aspdac.2004.1337570openalex-snapshot
Testable design of GRM network with EXOR-tree for detecting stuck-at and bridging faults
inferred← citeshttps://doi.org/10.1109/aspdac.2005.1466152openalex-snapshot
Bridging fault detection in double fixed-polarity Reed-Muller (DFPRM) PLA
inferred← citeshttps://doi.org/10.1109/ats.2002.1181701openalex-snapshot
Testable realizations for ESOP expressions of logic functions
inferred← citeshttps://doi.org/10.1109/ats.2003.1250789openalex-snapshot
A heuristic approach for design of easily testable PLAs using pass transistor logic
inferred← citeshttps://doi.org/10.1109/ats.2003.1250817openalex-snapshot
Fault detection for testable realizations of multiple-valued logic functions
inferred← citeshttps://doi.org/10.1109/ccece.2005.1557053openalex-snapshot
A new logic synthesis, exorbds
inferred← citeshttps://doi.org/10.1109/cjece.2008.4721635openalex-snapshot
Combining ESOP minimization with BDD-based decomposition for improved FPGA synthesis
inferred← citeshttps://doi.org/10.1109/delta.2006.41openalex-snapshot
Efficient search methods for obtaining exact minimum AND-EXOR expressions
inferred← citeshttps://doi.org/10.1109/hldvt.2006.320004openalex-snapshot
Easily Testable Implementation for Bit Parallel Multipliers in GF (2m)
inferred← citeshttps://doi.org/10.1109/icecs.1998.814865openalex-snapshot
Testability of AND-EXOR logic vs. AND-OR logic
inferred← citeshttps://doi.org/10.1109/iciinfs.2008.4798440openalex-snapshot
AND-XOR Network Synthesis with Area-Power Trade-off
inferred← citeshttps://doi.org/10.1109/icvd.2003.1183172openalex-snapshot
Bridging fault detections for testable realizations of logic functions
inferred← citeshttps://doi.org/10.1109/icvd.2004.1260968openalex-snapshot
Easily testable realization of GRM and ESOP networks for detecting stuck-at and bridging faults
inferred← citeshttps://doi.org/10.1109/ismvl.1999.779727openalex-snapshot
Highly testable Boolean ring logic circuits
inferred← citeshttps://doi.org/10.1109/ismvl.2009.72openalex-snapshot
Application of Covering Codes for Reduced Representations of Logic Functions
inferred← citeshttps://doi.org/10.1109/isvdat.2015.7208047openalex-snapshot
Thermal aware AND-OR-XOR network synthesis
inferred← citeshttps://doi.org/10.1109/pacrim.1999.799570openalex-snapshot
Highly testable finite state machines based on EXOR logic
inferred← citeshttps://doi.org/10.1109/tc.2008.63openalex-snapshot
Derivation of Reduced Test Vectors for Bit-Parallel Multipliers over GF(2^m)
inferred← citeshttps://doi.org/10.1109/tc.2009.113openalex-snapshot
Optimization of Polynomial Expressions by Using the Extended Dual Polarity
inferred← citeshttps://doi.org/10.1109/tcad.2020.2966676openalex-snapshot
Development of Programmable Logic Array for Multiple-Valued Logic Functions
inferred← citeshttps://doi.org/10.1109/tst.2014.6787370openalex-snapshot
Design of low-power modern radar SoC based on ASIX
inferred← citeshttps://doi.org/10.1142/s0218126609005356openalex-snapshot
EXACT MINIMIZATION OF AND–EXOR EXPRESSIONS OF PRACTICAL BENCHMARK FUNCTIONS
inferred← citeshttps://doi.org/10.1142/s0218126611007736openalex-snapshot
AND-OR-XOR NETWORK SYNTHESIS WITH AREA-POWER TRADE-OFF
inferred← citeshttps://doi.org/10.1145/1120725.1120798openalex-snapshot
Bridging fault detection in Double Fixed-Polarity Reed-Muller (DFPRM) PLA
inferred← citeshttps://doi.org/10.1201/b15950-19openalex-snapshot
Design for Testability
inferred← citeshttps://doi.org/10.15407/csc.2021.01.003openalex-snapshot
A New Method of the Logical Functions Minimization in the Polynomial Set-Theoretical Format. «Handshaking» Procedure
inferred← citeshttps://doi.org/10.15407/csc.2023.01.005openalex-snapshot
A Simple Stuck-at-faults Detection Method in Digital Combinational Circuits
inferred← citeshttps://doi.org/10.15407/csc.2024.01.003openalex-snapshot
A Simple Stuck-at-faults Detection Method in Digital Combinational Circuits. II
inferred← citeshttps://doi.org/10.15587/1729-4061.2021.229786openalex-snapshot
Developing the minimization of a polynomial normal form of boolean functions by the method of figurative transformations
inferred← citeshttps://doi.org/10.15760/etd.129openalex-snapshot
Design of Regular Reversible Quantum Circuits
inferred← citeshttps://doi.org/10.15760/etd.7850openalex-snapshot
Classical Search and Quantum Search Algorithms for Synthesis of Quantum Circuits and Optimization of Quantum Oracles
inferred← citeshttps://doi.org/10.17869/enu.255026openalex-snapshot
Combinational logic synthesis based on the dual form of Reed-Muller representation.
inferred← citeshttps://doi.org/10.2298/fuee1604701aopenalex-snapshot
Multi-valued Galois Shanon-Davio trees and their complexity
inferred← citeshttps://doi.org/10.2298/fuee1701049aopenalex-snapshot
An extended Green-Sasao hierarchy of canonical ternary Galois forms and Universal Logic Modules
inferred← citeshttps://doi.org/10.3390/app11209476openalex-snapshot
A New, Fast Pseudo-Random Pattern Generator for Advanced Logic Built-In Self-Test Structures
inferred← citeshttps://doi.org/10.3390/electronics9010012openalex-snapshot
Application of Generalized Reed–Muller Expression for Development of Non-Binary Circuits
inferred← citeshttps://doi.org/10.3748/wjg.v19.i8.1327openalex-snapshot
Glomus tumor in the stomach: Computed tomography and endoscopic ultrasound findings
inferred← citeshttps://doi.org/10.3844/jcssp.2006.595.599openalex-snapshot
Single Stuck-At Fault Diagnosing Circuit of Reed-Muller Canonical Exclusive-Or Sum of Product Boolean Expressions
inferred← citeshttps://doi.org/10.3844/jcssp.2011.744.748openalex-snapshot
OR-Bridging Fault Identification and Diagnosis for Exclusive-OR Sum of Products Reed-Muller Canonical Circuits
inferred← citeshttps://doi.org/10.7227/ijeee.45.3.7openalex-snapshot
The Inclusive-AND (Equivalence, Exclusive-NOR (EXNOR, XNOR)) and Exclusive-OR (EXOR, XOR) Gates in Mixed Logic
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.