Compressing Binary Decision Diagrams

Research output: Conference Article in Proceeding or Book/Report chapterArticle in proceedingsResearchpeer-review

View graph of relations

The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and compression will in many cases reduce the size of the BDD to 1-2 bits per node.
Empirical results for our compression technique are presented, including comparisons with previously introduced techniques, showing that the new technique dominate on all tested instances
Original languageEnglish
Title of host publicationProceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
PublisherAssociation for Computing Machinery
Publication date2008
Pages 799-800
ISBN (Print)978-1-58603-891-5
Publication statusPublished - 2008

ID: 51708036