J. Bern, C. Meinel, and A. Slobodova. Some heuristics for generating tree-like FBDD types. Technical Report 94-03, Universitat Trier, 1994. Home/Search Document Details and Download
Context Related Articles Check |
This paper is cited by the following papers:
Implementation of Read-k-times BDDs on top of standard BDD.. - Günther, Drechsler (2001) (Correct)
A Comparison Of Free BDDs And Transformed BDDs - Sieling, Wegener (Correct)
A Comparison Of Free BDDs And Transformed BDDs - Sieling, Wegener (Correct)
Minimization of Free BDDs - Günther, Drechsler (1999) (Correct)
Formal Verification of Combinational Circuits - Jain, Narayan, Fujita.. (1997) (5 citations) (Correct)
The Complexity of Minimizing FBDDs - Sieling (Correct)
Succinct Representation of Graphs - Project Report For (Correct)
Binary Decision Diagrams - Bollig, Sauerhoff, Sieling, Wegener (Correct)
Bi-Partition of Shared Binary Decision Diagrams - Matsuura, Sasao, Butler, Iguchi (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC