Graph driven BDDs — a new data structure for Boolean functions

This publication has 7 references indexed in Scilit:

• Reduction of OBDDs in linear time
  Information Processing Letters, 1993
• On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
  IEEE Transactions on Computers, 1991
• Polynomial size Ω-branching programs and their computational power
  Information and Computation, 1990
• Binary decision tree test functions
  IEEE Transactions on Computers, 1988
• Graph-Based Algorithms for Boolean Function Manipulation
  IEEE Transactions on Computers, 1986
• Equivalence of free boolean graphs can be decided probabilistically in polynomial time
  Information Processing Letters, 1980
• Binary Decision Diagrams
  IEEE Transactions on Computers, 1978