OKFDDs versus OBDDs and OFDDs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 944, Issue , 1995, Pages 475-486

  Becker, Bernd ^a   Drechsler, Rolf ^a   Theobald, Michael ^b  

^a GOETHE UNIVERSITY   (Germany)

^b Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; BOOLEAN FUNCTIONS; COMPUTATIONAL LINGUISTICS; GRAPHIC METHODS;

COMPUTATIONAL POWER; DECISION DIAGRAM; KRONECKER; ORDERED BINARY DECISION DIAGRAMS; THEORETICAL POINTS;

BINARY DECISION DIAGRAMS;

EID: 84958051424     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60084-1_98     Document Type: Conference Paper

References (18)

1. M. Ajtai, L. Babai, P. Hajnal, J. Komlos, P. Pudlak, V. Rödl, E. Szemeredi, and G. Turan. Two lower bounds for branching programs. In Syrup. on Theory of Computing, pages 30-38, 1986.
2. B. Becket and R. Drechsler. How many decomposition types do we need? In European Design & Test Conf., pages 438-443, 1995.
3. B. Becker, R. Drechsler, and R. Werctmer. On the relation between BDDs and FDDs. In LATIN95, LNCS, 1995.
4. Ph.W. Besslich and E.A. Trachtenberg. A three-valued quasi-llnear transformation for logic synthesis. In C. Moraga and R. Creutzburg, editors, Spectral Techniques: Theory and Applications. Elsevier, North Holland, 1992.
5. R.E. Bryant. Graph - based algorithms for Boolean function manipulation. IEEE Trans. on Comp., 8:677-691, 1986.
6. R.E. Bryant. On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication. IEEE Trans. on Comp., 40:205-213, 1991.
7. R.E. Bryant. Symbolic boolean manipulation with ordered binary decision diagrams. ACM, Comp. Surveys, 24:293-318, 1992.
8. J.R. Butch. Using BDDs to verify multipliers. In Design Automation Conf., pages 408-412, 1991.
9. R. Drechsler, A. Sarabi, M. Theobald, B. Becket, and M.A. Perkowski. Efficient representation and manipulation of switching functions based on ordered kronecker functional decision diagrams. In Design Automation Conf., pages 415-419, 1994.
10. R. Drechsler, M. Theobald, and B. Becket. Fast OFDD based minimization of fixed polarity reed-muller expressions. In European Design Automation Conf., pages 2-7, 1994.
11. S. J. Friedman. Efficient Data Structures for Boolean Function Representation. PhD thesis, Dept. of Comput. Sciences, Princeton University, 1990. 12.
12. Jain, M. Abadir, J. Bitner, D. Fussell, and J. Abraham. IBDDs: An efficient functional representation for digital circuits. In European Conf. on Design Automation, pages 441-446, 1992.
13. S.-W. Jeong, B. Plessier, G. Hachtel, and F. Somenzi. Extended BDD's: Trading of canonicity for structure in verification algorithms. In Int'l Conf. on CAD, pages 464-467, 1991.
14. U. Kebschull. Die Aquivalenz-Expansion Boolescher Funktionen. Technical report, WSI-93-15, Unlversität Tfibingen, 1993.
15. U. Kebschull, E. Schubert, and W. Rosenstiel. Multilevel logic synthesis based on functional decision diagrams. In European Conf. on Design Automation, pages 43-47, 1992.
16. M.S. Paterson. On Razborov's result for bounded depth circuits over {⊕, A}. Technical report, University Warwick, 1986.
17. Richard Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Int'l Conf. on CAD, pages 42-47, 1993.
18. I. Wegener. The Complexity of Boolean Functions. John Wiley & Sons Ltd., and B.C. Teubner, Stuttgart, 1987.