Binary Decision Diagrams (BDD)

• K. Hayase: On Relationship between Boolean Functions and Their Prime Implicants in OBDD Size, in 6th BDD Workshop, Dec. 1995, Department of Information Science, University of Tokyo. Abstract Paper(ps)
• K. Hayase and H. Imai: OBDDs of a Monotone Function and of Its Prime Implicants, Technical Report, Department of Information Science, University of Tokyo, 1996. Abstract Paper(ps)
• J. Niwa, K. Sadakane, K. Hayase, and H. Imai: Parallel Top-down Construction of OBDDs of Monotone Functions, in Proceedings of the Joint Symposium on Parallel Processing 1996, pp. 161-168, 1996, IPSJ, (in Japanese). Abstract Paper(ps)
• K. Sadakane, K. Hayase, and H. Imai: A Parallel Top-down Algorithm to Construct Binary Decision Diagrams, IPSJ SIG Notes 95-AL-48-11, IPSJ, 1995. Abstract Paper(ps)
• S. Tani, K. Hamaguchi, and S. Yajima: The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams, in Proceedings of the 4th International Symposium on Algorithms and Computation (ISAAC'93), Lecture Notes in Computer Science, Lecture Notes in Computer Science, Vol. 762, pp. 389-398, 1993. Abstract Paper(ps)
• S. Tani, K. Hamaguchi, and S. Yajima: The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams, Technical Report 93-06, Department of Information Science, University of Tokyo, Dec. 1993. Paper(ps)
• S. Tani and H. Imai: A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs, in Proceedings of the 5th International Symposium on Algorithms and Computation (ISAAC'94), Lecture Notes in Computer Science, Vol. 834, pp. 575-583, 1994. Abstract Paper(ps)
• H. Imai and S. Tani: Ordered Binary Decision Diagrams, Gaussian Elimination and Graph Theory, IPSJ SIG Notes 94-AL-41-2, IPSJ, 1994. Paper(ps)