 
Summary: The I/OComplexity of Ordered BinaryDecision Diagram
Manipulation
Lars Arge
BRICS
Department of Computer Science
University of Aarhus
Aarhus, Denmark
August 1996
Abstract
Ordered BinaryDecision Diagrams (OBDD) are the stateoftheart data structure for
boolean function manipulation and there exist several software packages for OBDD ma
nipulation. OBDDs have been successfully used to solve problems in e.g. digitalsystems
design, verification and testing, in mathematical logic, concurrent system design and in
artificial intelligence. The OBDDs used in many of these applications quickly get larger
than the avaliable main memory and it becomes essential to consider the problem of min
imizing the Input/Output (I/O) communication. In this paper we analyze why existing
OBDD manipulation algorithms perform poorly in an I/O environment and develop new
I/Oefficient algorithms.
1 Introduction
Many problems in digitalsystems design, verification and testing, mathematical logic, concur
