The Size of Reduced OBDD's and Optimal Read-Once Branching Programs for Almost all Boolean Functions
IEEE Transactions on Computers
Binary decision diagrams and beyond: enabling technologies for formal verification
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
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
Reachability analysis using partitioned-ROBDDs
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
A Unifying Theoretical Background for Some Bdd-based Data Structures
Formal Methods in System Design
On separating the read-k-times branching program hierarchy
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The Theory of Zero-Suppressed BDDs and the Number of Knight‘s Tours
Formal Methods in System Design
Efficient manipulation algorithms for linearly transformed BDDs
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Decomposable negation normal form
Journal of the ACM (JACM)
A Comparison of Free BDDs and Transformed BDDs
Formal Methods in System Design
The complexity of minimizing and learning OBDDs and FBDDs
Discrete Applied Mathematics
Integration, the VLSI Journal
Lower bounds for linearly transformed OBDDs and FBDDs
Journal of Computer and System Sciences
The Complexity of Minimizing FBDDs
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
BDD-Based Cryptanalysis of Keystream Generators
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Symbolic representation with ordered function templates
Proceedings of the 40th annual Design Automation Conference
Information and Computation - Special issue: LICS'97
Information Processing Letters
Decision Diagrams in Synthesis - Algorithms, Applications and Extensions
VLSID '97 Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia Applications
Efficient Minimization and Manipulation of Linearly Transformed Binary Decision Diagrams
IEEE Transactions on Computers
BDDs: design, analysis, complexity, and applications
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
Lower bounds for restricted read-once parity branching programs
Theoretical Computer Science
Theoretical Computer Science
AND/OR search spaces for graphical models
Artificial Intelligence
Synthesis of irregular combinational functions with large don't care sets
Proceedings of the 17th ACM Great Lakes symposium on VLSI
Symbolic OBDD representations for mechanical assembly sequences
Computer-Aided Design
Redundancy-free residual dispatch: using ordered binary decision diagrams for efficient dispatch
Proceedings of the 7th workshop on Foundations of aspect-oriented languages
The symbolic OBDD scheme for generating mechanical assembly sequences
Formal Methods in System Design
BDDs-design, analysis, complexity, and applications
Discrete Applied Mathematics
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
On the size of randomized OBDDs and read-once branching programs for k-stable functions
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Knowledge compilation meets database theory: compiling queries to decision diagrams
Proceedings of the 14th International Conference on Database Theory
Efficient query processing with compiled knowledge bases
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Hi-index | 5.24 |