Using lower bounds during dynamic BDD minimization
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
The nonapproximability of OBDD minimization
Information and Computation
Minimization of word-level decision diagrams
Integration, the VLSI Journal
Efficient Dynamic Minimization of Word-Level DDs Based on Lower Bound Computation
ICCD '00 Proceedings of the 2000 IEEE International Conference on Computer Design: VLSI in Computers & Processors
BDDs: design, analysis, complexity, and applications
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
Lower bounds for dynamic BDD reordering
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
BDDs-design, analysis, complexity, and applications
Discrete Applied Mathematics
Genetic algorithms for the variable ordering problem of binary decision diagrams
FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
On symbolic OBDD-based algorithms for the minimum spanning tree problem
Theoretical Computer Science
Implicit computation of maximum bipartite matchings by sublinear functional operations
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Priority functions for the approximation of the metric TSP
Information Processing Letters
| Hi-index | 0.89 |