Reachability analysis using partitioned-ROBDDs
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Separating Oblivious and Non-oblivious BPs
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
BDDs: design, analysis, complexity, and applications
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
Information Processing Letters
BDDs-design, analysis, complexity, and applications
Discrete Applied Mathematics
Information Processing Letters
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
| Hi-index | 5.23 |