The I/O-complexity of ordered binary-decision diagram manipulation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1004, Issue , 1995, Pages 82-91

  Arge, Lars ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS;

ORDERED BINARY DECISION DIAGRAMS;

BINARY DECISION DIAGRAMS;

EID: 84955617838     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0015411     Document Type: Conference Paper

References (20)

1. A. Aggarwal, J.S. Vitter: The Input/Output Complexity of Sorting and Related Problems. Communications of the ACM, 31 (9), 1988.
2. L. Arge: The Buffer Tree: A New Technique for Optimal I/O-Algorithms. In Proc. of 4th Workshop on Algorithms and Data Structures, 1995.
3. L. Arge, D.E. Vengroff, J.S. Vitter: External-Memory Algorithms for Processing Line Segments in Geographic Information Systems. In Proc. of 3rd Annual European Symposium on Algorithms, 1995.
4. P. Ashar, M. Cheong: Efficient Breadth-First Manipulation of Binary Decision Diagrams. In Proc. of 1994 IEEE International Conference on CAD.
5. S.K. Brace, R.L. Rudell, R.E. Bryant: Efficient Implementation of a BDD Package. In Proc. of 27th ACM/IEEE Design Automation Conference, 1990.
6. R. Bryant: Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on computers, C-35 (8), 1986.
7. R. Bryant: Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams. ACM Computing Surveys, 24 (3), 1992.
8. Y.-J. Chiang: Experiments on the Practical I/O Efficiency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep. In Proc. of 4th Workshop on Algorithms and Data Structures, 1995.
9. Y.-J. Chiang, M.T. Goodrich, E.F. Grove, R. Tamassia, D.E. Vengroff, J.S. Vitter: External-Memory Graph Algorithms. In Proc. of 6th ACM/SIAM Symposium on Discrete Algorithms, 1995.
10. J. Gergov, C. Meinel: Frontiers of Feasible and Probabilistic Feasible Boolean Manipulation with Branching Programs. In Proc. of 10th Symposium on Theoretical Aspects of Computer Science, LNCS 665, 1993.
11. M.T. Goodrich, M.H. Nodine, J.S. Vitter: Blocking for External Graph Searching. In Proc. of 1993 ACM Symposium on Principles of Database Systems.
12. M.T. Goodrich, J.-J. Tsay, D.E. Vengroff, J.S. Vitter: External-Memory Computational Geometry. In Proc. of 34th IEEE Foundations of Computer Science, 1993.
13. S. Malik, A.R. Wang, R.K. Brayton, A. Sangiovanni-Vincentelli: Logic Verification using Binary Decision Diagrams in a Logic Synthesis Environment. In Proc. of 1988 IEEE International Conference on CAD.
14. H. Ochi, N. Ishiura, S. Yajima: Breadth-First Manipulation of SBDD of Boolean Functions for Vector Processing. In Proc. of 28th ACM/IEEE Design Automation Conference, 1991.
15. H. Ochi, K. Yasuoka, S. Yajima: Breadth-First manipulation of Very Large Binary- Decision Diagrams. In Proc. of 1993 IEEE International Conference on CAD.
16. R. Rudell: Dynamic Variable Ordering for Ordered Binary Decision Diagrams. In Proc. of 1993 IEEE International Conference on CAD.
17. C. Ruemmler, J. Wilkes: An introduction to disk drive modeling. IEEE Computer, 27 (3), 1994.
18. D. Sieling, I. Wegener: Reduction of OBDDs in linear time. Information Processing Letters, 48, 1993.
19. D.E. Vengroff, J.S. Vitter: I/O-Efficient Scientific Computation Using TPIE. In Proc. of 7th IEEE Symposium on Parallel and Distributed Processing, 1995.
20. J.S. Vitter, E.A.M Shrive: Algorithms for Parallel Memory I: Two-level Memories. Algoritmica, 12 (2), 1994.