The I/O-complexity of Ordered Binary-Decision Diagram manipulation

This publication has 12 references indexed in Scilit:

• Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep
  Published by Springer Nature ,1995
• The buffer tree: A new technique for optimal I/O-algorithms
  Published by Springer Nature ,1995
• Algorithms for parallel memory, I: Two-level memories
  Algorithmica, 1994
• Reduction of OBDDs in linear time
  Information Processing Letters, 1993
• Frontiers of feasible and probabilistic feasible Boolean manipulation with branching programs
  Published by Springer Nature ,1993
• Symbolic Boolean manipulation with ordered binary-decision diagrams
  ACM Computing Surveys, 1992
• Breadth-first manipulation of SBDD of Boolean functions for vector processing
  Published by Association for Computing Machinery (ACM) ,1991
• Efficient implementation of a BDD package
  Published by Association for Computing Machinery (ACM) ,1990
• The input/output complexity of sorting and related problems
  Communications of the ACM, 1988
• Graph-Based Algorithms for Boolean Function Manipulation
  IEEE Transactions on Computers, 1986