Graph-based algorithms for Boolean function manipulation (1986)

by Randal E. Bryant
Venue:IEEE Transactions on Computers
Citations:2939 - 46 self

Active Bibliography

60 Symbolic manipulation of boolean functions using a graphical representation – - 1985
58 Models of Computation -- Exploring the Power of Computing
13 Forward and inverse transformations between Haar spectra and ordered binary decision diagrams of Boolean functions – - 1997
233 On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication – - 1998
3 DDBDD: Delay-driven BDD synthesis for FPGAs
5 A Survey of Techniques for Formal Verification of Combinational Circuits – - 1997
881 Symbolic Boolean manipulation with ordered binary-decision diagrams – - 1992
Galois Field Circuits and Realization of Multiple-Valued Logic Functions – - 1993
45 Bottom-Up Induction of Oblivious Read-Once Decision Graphs – - 1994
Evolvability via modularity-induced mutational focussing
11 Factored Edge-Valued Binary Decision Diagrams and their Application to Matrix Representation and Manipulation – - 1994
4 Distributed Binary Decision Diagrams for Verification of Large Circuits – - 1996
6 Cyclic Combinational Circuits – - 2004
6 Minimizing ROBDD Sizes of Incompletely Specified Boolean Functions by Exploiting Strong Symmetries – - 1997
8 Representing Boolean Functions with If-Then-Else DAGs – - 1988
13 Symbolic Verification of MOS Circuits – - 1985
124 Algorithms for the Satisfiability (SAT) Problem: A Survey – - 1996
77 Special Purpose Parallel Computing – - 1993
15 A time domain approach for avoiding crosstalk in optical blocking multistage interconnection networks – - 1994