Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:pure.atira.dk:publications/6f4226f0-f6b6-11dd-9b71-000ea68e967b

Compressing Binary Decision Diagrams

Authors
Publication date
1 January 2008
Publisher
'Association for Computing Machinery (ACM)'

Abstract

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 instance

Similar works

Full text

thumbnail-image

The IT University of Copenhagen's Repository

redirect
oaioai:pure.atira.dk:publications...
Last time updated on 11/11/2016

This paper was published in The IT University of Copenhagen's Repository.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.