Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Efficient implementation of a BDD package
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Learning &mgr;-branching programs with queries
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
A lower bound for integer multiplication with read-once branching programs
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Improving the Variable Ordering of OBDDs Is NP-Complete
IEEE Transactions on Computers
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Indexed BDDs: Algorithmic Advances in Techniques to Represent and Verify Boolean Functions
IEEE Transactions on Computers
ACM Computing Surveys (CSUR)
A Characterization of Binary Decision Diagrams
IEEE Transactions on Computers
Efficient Boolean Manipulation with OBDD's Can be Extended to FBDD's
IEEE Transactions on Computers
The complexity of minimizing and learning OBDDs and FBDDs
Discrete Applied Mathematics
The Complexity of Minimizing FBDDs
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Restrictive Acceptance Suffices for Equivalence Problems
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Learning from examples with unspecified attribute values
Information and Computation
Formal Verification of Combinational Circuit
VLSID '97 Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia Applications
On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
New compilation languages based on structured decomposability
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
Survey: Linear Temporal Logic Symbolic Model Checking
Computer Science Review
| Hi-index | 0.01 |