Publisher
Springer Berlin Heidelberg
Reference20 articles.
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 27'th ACM/IEEE Design Automation Conference, 1990.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. HermesBDD: A Multi-Core and Multi-Platform Binary Decision Diagram Package;2023 26th International Symposium on Design and Diagnostics of Electronic Circuits and Systems (DDECS);2023-05-03
2. Predicting Memory Demands of BDD Operations Using Maximum Graph Cuts;Automated Technology for Verification and Analysis;2023
3. Adiar Binary Decision Diagrams in External Memory;Tools and Algorithms for the Construction and Analysis of Systems;2022
4. I/O-efficient batched union-find and its applications to terrain analysis;ACM Transactions on Algorithms;2010-11
5. Algorithms and Data Structures for External Memory;Foundations and Trends® in Theoretical Computer Science;2006