On the public citation graph
Probabilistic verification of Boolean functions
0 signed · 67 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.1002/j.1538-7305.1959.tb01585.xopenalex-snapshot
Representation of Switching Circuits by Binary-Decision Programs
inferredcites →https://doi.org/10.1007/3-540-08860-1_17openalex-snapshot
The complexity of equivalence and containment for free single variable program schemes
inferredcites →https://doi.org/10.1016/s0020-0190(80)90078-2openalex-snapshot
Equivalence of free boolean graphs can be decided probabilistically in polynomial time
inferredcites →https://doi.org/10.1099/00221287-98-2-595openalex-snapshot
Reticulation and Other Methods of Reducing the Size of Printed Diagnostic Keys
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/12.73590openalex-snapshot
On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
inferredcites →https://doi.org/10.1109/2.65openalex-snapshot
Formal verification of hardware correctness: introduction and survey of current research
inferredcites →https://doi.org/10.1109/dac.1988.14759openalex-snapshot
Proving circuit correctness using formal comparison between expected and extracted behaviour
inferredcites →https://doi.org/10.1109/iccad.1988.122450openalex-snapshot
Evaluation and improvement of Boolean comparison method based on binary decision diagrams
inferredcites →https://doi.org/10.1109/iccad.1988.122451openalex-snapshot
Logic verification using binary decision diagrams in a logic synthesis environment
inferredcites →https://doi.org/10.1109/iccad.1990.129833openalex-snapshot
Tautology checking using cross-controllability and cross-observability relations
inferredcites →https://doi.org/10.1109/iccad.1991.185305openalex-snapshot
Extended BDD's: trading off canonicity for structure in verification algorithms
inferredcites →https://doi.org/10.1109/t-c.1975.224279openalex-snapshot
Probabilistic Treatment of General Combinational Networks
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1145/123186.123222openalex-snapshot
Efficient implementation of a BDD package
inferredcites →https://doi.org/10.1145/123186.123223openalex-snapshot
Sequential circuit verification using symbolic model checking
inferredcites →https://doi.org/10.1145/322261.322268openalex-snapshot
Probabilistic Aspects of Boolean Switching Functions via a New Transform
inferredcites →https://doi.org/10.1145/357062.357071openalex-snapshot
A fast algorithm for finding dominators in a flowgraph
inferredcites →https://doi.org/10.5555/285730.285764openalex-snapshot
Proving circuit correctness using formal comparison between expected and extracted behaviour
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-45506-x_6openalex-snapshot
Data Structures for Boolean Functions BDDs — Foundations and Applications
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_54openalex-snapshot
A conjunctively decomposed boolean representation for symbolic model checking
inferred← citeshttps://doi.org/10.1007/978-1-4613-1385-4_5openalex-snapshot
Edge Valued Binary Decision Diagrams
inferred← citeshttps://doi.org/10.1007/978-1-4613-1385-4_6openalex-snapshot
Arithmetic Transform of Boolean Functions
inferred← citeshttps://doi.org/10.1007/978-1-4615-0817-5_11openalex-snapshot
Ordered Binary Decision Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-319-13350-8_11openalex-snapshot
Computing Boolean Functions via Quantum Hashing
inferred← citeshttps://doi.org/10.1007/978-3-642-23178-0_1openalex-snapshot
Classical and Quantum Parallelism in the Quantum Fingerprinting Method
inferred← citeshttps://doi.org/10.1007/bf00709139openalex-snapshot
Mod-2-OBDDs—A data structure that generalizes EXOR-sum-of-products and ordered binary decision diagrams
inferred← citeshttps://doi.org/10.1007/bfb0031825openalex-snapshot
Decomposition techniques for efficient ROBDD construction
inferred← citeshttps://doi.org/10.1007/s10260-009-0123-2openalex-snapshot
Polynomials for classification trees and applications
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00151-1openalex-snapshot
Approximate evaluations of characteristic polynomials of Boolean functions
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80601-2openalex-snapshot
Probabilistic Symbolic Simulation and Verification with ⊕-OBDDs
inferred← citeshttps://doi.org/10.1023/a:1016632423579openalex-snapshot
Numerical computation of characteristic polynomials of Boolean functions and its applications
inferred← citeshttps://doi.org/10.1023/b:aurc.0000030902.91316.b9openalex-snapshot
Malyugin's Theorems: A New Concept in Logical Control, VLSI Design, and Data Structures for New Technologies
inferred← citeshttps://doi.org/10.1051/ita:1999108openalex-snapshot
On the Complexity of the Hidden Weighted Bit Function for Various BDD Models
inferred← citeshttps://doi.org/10.1080/10655140290009800openalex-snapshot
Logic Circuit Equivalence Checking Using Haar Spectral Coefficients and Partial BDDs
inferred← citeshttps://doi.org/10.1109/12.644298openalex-snapshot
Indexed BDDs: algorithmic advances in techniques to represent and verify Boolean functions
inferred← citeshttps://doi.org/10.1109/12.663768openalex-snapshot
On the polynomial form of Boolean functions: derivations and applications
inferred← citeshttps://doi.org/10.1109/12.795227openalex-snapshot
Fast linearly independent arithmetic expansions
inferred← citeshttps://doi.org/10.1109/43.363122openalex-snapshot
Probabilistic manipulation of Boolean functions using free Boolean diagrams
inferred← citeshttps://doi.org/10.1109/5.533956openalex-snapshot
Principles and methods of testing finite state machines-a survey
inferred← citeshttps://doi.org/10.1109/aspdac.2005.1466229openalex-snapshot
Improved Boolean function hashing based on multiple-vertex dominators
inferred← citeshttps://doi.org/10.1109/ats.1994.367233openalex-snapshot
Analysis and improvement of testability measure approximation algorithms
inferred← citeshttps://doi.org/10.1109/dac.1995.249982openalex-snapshot
Efficient OBDD-Based Boolean Manipulation in CAD Beyond Current Limits
inferred← citeshttps://doi.org/10.1109/edtc.1994.326915openalex-snapshot
Boolean manipulation with free BDD's. First experimental results
inferred← citeshttps://doi.org/10.1109/hase.2008.37openalex-snapshot
Randomization Based Probabilistic Approach to Detect Trojan Circuits
inferred← citeshttps://doi.org/10.1109/iccad.1993.580111openalex-snapshot
HANNIBAL: An efficient tool for logic verification based on recursive learning
inferred← citeshttps://doi.org/10.1109/iccad.1993.580112openalex-snapshot
Probabilistic construction and manipulation of Free Boolean Diagrams
inferred← citeshttps://doi.org/10.1109/iccad.1996.569909openalex-snapshot
Partitioned ROBDDs-a compact, canonical and efficiently manipulable representation for Boolean functions
inferred← citeshttps://doi.org/10.1109/iccad.1998.144233openalex-snapshot
Tutorial I Embedded Memories In System Design From Technology To Systems Architecture
inferred← citeshttps://doi.org/10.1109/iccd.1997.628907openalex-snapshot
A survey of techniques for formal verification of combinational circuits
inferred← citeshttps://doi.org/10.1109/icvd.1996.489494openalex-snapshot
A study of composition schemes for mixed apply/compose based construction of ROBDDs
inferred← citeshttps://doi.org/10.1109/icvd.1996.489631openalex-snapshot
Characteristic polynomial method for verification and test of combinational circuits
inferred← citeshttps://doi.org/10.1109/icvd.1997.568079openalex-snapshot
Formal verification of combinational circuits
inferred← citeshttps://doi.org/10.1109/ismvl.2000.848625openalex-snapshot
Mod-p decision diagrams: a data structure for multiple-valued functions
inferred← citeshttps://doi.org/10.1109/ismvl.2000.848656openalex-snapshot
A method for approximate equivalence checking
inferred← citeshttps://doi.org/10.1109/ismvl.2000.848659openalex-snapshot
Probabilistic verification of multiple-valued functions
inferred← citeshttps://doi.org/10.1109/ismvl.2003.1201426openalex-snapshot
Fast algorithm for computing spectral transforms of Boolean and multiple-valued functions on circuit representation
inferred← citeshttps://doi.org/10.1145/1120725.1120965openalex-snapshot
Improved Boolean function hashing based on multiple-vertex dominators
inferred← citeshttps://doi.org/10.1145/288548.289099openalex-snapshot
Sampling schemes for computing OBDD variable orderings
inferred← citeshttps://doi.org/10.1145/307988.307989openalex-snapshot
Formal verification in hardware design
inferred← citeshttps://doi.org/10.32657/10356/3489openalex-snapshot
Spectral techniques : algorithms, analyses and applications
inferred← citeshttps://doi.org/10.4204/eptcs.52.1openalex-snapshot
On Computational Power of Quantum Read-Once Branching Programs
inferred← citeshttps://doi.org/10.4236/iim.2010.22012openalex-snapshot
Probabilistic Verification over GF(2m) Using Mod2-OBDDs
inferred← citeshttps://doi.org/10.48550/arxiv.1312.1661openalex-snapshot
Quantum Communications Based on Quantum Hashing
inferred← citeshttps://doi.org/10.5555/244522.244894openalex-snapshot
Partitioned ROBDDs—a compact, canonical and efficiently manipulable representation for Boolean functions
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.