Shin-ichi Minato
- 1.S. B. Akers: "Binary Decision Diagrams", IEEE Trans. Comput., pp. 509-516, 1978Google Scholar
- 2.R. E. Bryant: "Graph-Based Algorithms for Boolean Function Manipulation", IEEE Trans. Comput., pp. 677-691 1986 Google ScholarDigital Library
- 3.M. Fujita, ~I. Fujisawa and n. Kawato: "Evaluation and Improvement of Boolean Comparison Method Based on Binary Decision Diagrams", Proc. IEEE ICCAD'88, pp. 2-5, 1988Google ScholarCross Ref
- 4.R. K. Gaede,M. R. Mercer, K. M. Bulter and D. E. Ross: "CATAPULT: Concurrent Automatic Testing Allowing Parallelization and Using Limited Topology", Proc. ACM/IEEE 25th DAC, pp. 597- 600, 1988 Google ScholarDigital Library
- 5.N. Takahashi, n. Ishiura and S. Yajima: "Fault Simulation for Multiple Faults Using Shared BDD Representation of Fault Sets", Proc. IEEE ICCAD'90, pp. 550-553~ 1991Google ScholarCross Ref
- 6.J. R. Butch, E. M. Clarke, K. L. McMillan and D. L. Dill: "Sequential Circuit Verification Using Symbolic Model Checking", Proc. ACM/IEEE 27th DAC, pp. 46-51, 1990 Google ScholarDigital Library
- 7.O. Coudert and J. C. Madre: "Implicit and Incremental Computation of Primes and Essential Implicant Primes of Boolean Functions", Proc. ACM/IEEE 29th DAC, pp. 36-39, 1992 Google ScholarDigital Library
- 8.Bill Lin and Fabio Somenzi: "Minimization of Symbolic Relations", Proc. IEEE ICCAD'90, pp. 88-91, (1990).Google Scholar
- 9.S. Minato, N. Ishiura and S. Yajima: Shared Binary Decision Diagram with Attributed Edges for Efficient Boolean Function Manipulation, ACM/IEEE Proc. 27th DAC, pp. 52-57, 1990 Google ScholarDigital Library
- 10.M. Fujita, Y. Matsunaga and T. Kakuda: On Variable Ordering of Binary Decision Diagrams for the Application of Multi-level Logic Synthesis, Proc. the European Conference on Design Automation, pp.50- 54, 1991 Google ScholarDigital Library
- 11.H.-T. Liaw and C.-S. Lin: "On the OBDD- Representation of General Boolean Functions" IEEE Trans. Comput., pp. 661-664, 1992 Google ScholarDigital Library
- 12.O. Coudert and J. C. Madre: "A New implicit Graph Based Prime and Essential Prime Computation Technique", Proc. International Symposium on Logic Synthesis and Microprocessor Architecture (ISKIT 92, Japan), pp. 125-131, 1992.Google Scholar
- 13.S. Minato: 'Fast Generation of Irredundant Sumof-Products Forms from Binary Decision Diagrams', Proceedings of the Synthesis and Simulation Meeting and International Interchange (SASIMI'92, Japan), 1992, pp. 64-73Google Scholar
Index Terms
- Zero-suppressed BDDs for set manipulation in combinatorial problems
Recommendations
Partially-shared zero-suppressed multi-terminal BDDs: concept, algorithms and applications
Multi-Terminal Binary Decision Diagrams (MTBDDs) are a well accepted technique for the state graph (SG) based quantitative analysis of large and complex systems specified by means of high-level model description techniques. However, this type of ...
Index-Resilient Zero-Suppressed BDDs: Definition and Operations
Zero-Suppressed Binary Decision Diagrams (ZDDs) are widely used data structures for representing and handling combination sets and Boolean functions. In particular, ZDDs are commonly used in CAD for the synthesis and verification of integrated circuits. ...
Efficient Method of Combinatorial Item Set Analysis Based on Zero-Suppressed BDDs
WIRI '05: Proceedings of the International Workshop on Challenges in Web Information Retrieval and IntegrationManipulation of large-scale combinatorial data is one of the important fundamental technique for web information retrieval, integration, and mining. In this paper, we propose a new approach based on BDDs (Binary Decision Diagrams) for database analysis ...
Comments