|
48
|
Symbolic manipulation of boolean functions using a graphical representation
– Randal E. Bryant
- 1985
|
|
46
|
Models of Computation -- Exploring the Power of Computing
– John E. Savage
|
|
224
|
On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication
– Randal E. Bryant
- 1998
|
|
5
|
A Survey of Techniques for Formal Verification of Combinational Circuits
– Jawahar Jain, et al.
- 1997
|
|
793
|
Symbolic Boolean manipulation with ordered binary-decision diagrams
– Randal E Bryant
- 1992
|
|
|
Galois Field Circuits and Realization of Multiple-Valued Logic Functions
– Zeljko Zilic
- 1993
|
|
42
|
Bottom-Up Induction of Oblivious Read-Once Decision Graphs
– Ron Kohavi
- 1994
|
|
|
Evolvability via modularity-induced mutational focussing
– Richard M. Downing
|
|
10
|
Factored Edge-Valued Binary Decision Diagrams and their Application to Matrix Representation and Manipulation
– Paul Tafertshofer
- 1994
|
|
5
|
Cyclic Combinational Circuits
– Marc D. Riedel, Marc D. Riedel
- 2004
|
|
4
|
Distributed Binary Decision Diagrams for Verification of Large Circuits
– Craig Chase, Dinos Moundanos, Contact Person, Prakash Arunachalam Craig, Prakash Arunachalam
- 1996
|
|
5
|
Minimizing ROBDD Sizes of Incompletely Specified Boolean Functions by Exploiting Strong Symmetries
– Christoph Scholl, Stephan Melchior, Günter Hotz, Paul Molitor
- 1997
|
|
8
|
Representing Boolean Functions with If-Then-Else DAGs
– Kevin Karplus
- 1988
|
|
13
|
Symbolic Verification of MOS Circuits
– Randal E. Bryant
- 1985
|
|
107
|
Algorithms for the Satisfiability (SAT) Problem: A Survey
– Jun Gu, Paul W. Purdom, John Franco, Benjamin W. Wah
- 1996
|
|
77
|
Special Purpose Parallel Computing
– W.F. McColl
- 1993
|
|
12
|
A time domain approach for avoiding crosstalk in optical blocking multistage interconnection networks
– Chunming Qiao, Rami Georges Melhem, Donald M. Chiarulli, Steven P. Levitan
- 1994
|
|
421
|
Efficient implementation of a BDD package
– Karl S. Brace, Richard L. Rudell, Randal E. Bryant
- 1991
|
|
25
|
The Area-Time Complexity of Binary Multiplication
– R. P. Brent, H. T. Kung
- 1981
|
