The following publications are possibly variants of this publication:
- Using Lower Bounds During Dynamic BDD MinimizationRolf Drechsler, Wolfgang Günther. dac 1999: 29-32 [doi]
- Using lower bounds during dynamic BDD minimizationRolf Drechsler, Wolfgang Günther, Fabio Somenzi. tcad, 20(1):51-57, 2001. [doi]
- Quasi-Exact BDD Minimization Using Relaxed Best-First SearchRüdiger Ebendt, Rolf Drechsler. isvlsi 2005: 59-64 [doi]
- Minimization of BDDs using linear transformations based on evolutionary techniquesWolfgang Günther, Rolf Drechsler. iscas 1999: 387-390 [doi]
- Approximate BDD Minimization by Weighted ARüdiger Ebendt, Rolf Drechsler. iscas 2009: 2974-2977 [doi]
- BDD minimization for approximate computingMathias Soeken, Daniel Große, Arun Chandrasekharan, Rolf Drechsler. aspdac 2016: 474-479 [doi]
- Minimization of Free BDDsWolfgang Günther, Rolf Drechsler. aspdac 1999: 323-326 [doi]
- Fast Exact Minimization of BDDsRolf Drechsler, Nicole Drechsler, Wolfgang Günther. dac 1998: 200-205 [doi]
- Minimizing the Number of Paths in BDDsGörschwin Fey, Rolf Drechsler. sbcci 2002: 359-364 [doi]
- Minimization of free BDDsWolfgang Günther, Rolf Drechsler. integration, 32(1-2):41-59, 2002. [doi]