Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems

@article{Minato1993ZeroSuppressedBF,
  title={Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems},
  author={Shin-ichi Minato},
  journal={30th ACM/IEEE Design Automation Conference},
  year={1993},
  pages={272-277}
}
In this paper, we propose Zero-Suppressed BDDs (0-Sup-BDDs), which are BDDs based on a new reduction rule. This data structure brings unique and compact representation of sets which appear in many combinatorial problems. Using 0-Sup-BDDs, we can manipulate such sets more simply and efficiently than using original BDDs. We show the properties of 0-Sup-BDDs, their manipulation algorithms, and good applications for LSI CAD systems. 
Highly Influential
This paper has highly influenced 58 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 643 citations. REVIEW CITATIONS
400 Citations
1 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 400 extracted citations

643 Citations

02040'93'98'04'10'16
Citations per Year
Semantic Scholar estimates that this publication has 643 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…