1. Graph-based algorithms for Boolean function manipulation;Bryant;IEEE Trans. Comput.,1986
2. On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication;Bryant;IEEE Trans. Comput.,1991
3. Y.-T. Lai, S. Sastry, Edge-valued binary decision diagrams for multi-level hierarchical verification, Design Automation Conference, 1992, pp. 608–613.
4. R. Drechsler, A. Sarabi, M. Theobald, B. Becker, M.A. Perkowski, Efficient representation and manipulation of switching functions based on ordered Kronecker functional decision diagrams, Design Automation Conference, 1994, pp. 415–419.
5. E. Clarke, M. Fujita, P. McGeer, K.L. McMillan, J. Yang, X. Zhao, Multi terminal binary decision diagrams: An efficient data structure for matrix representation, International Workshop on Logic Synthesis, 1993, pp. P6a:1–15.