메뉴 건너뛰기




Volumn 32, Issue 7, 1997, Pages 145-156

Parallel Breadth-First BDD Construction

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0347306324     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/263767.263784     Document Type: Article
Times cited : (8)

References (24)
  • 1
    • 0030083764 scopus 로고    scopus 로고
    • Treadmarks: Shared memory computing on networks of workstations
    • Feb
    • AMZA, C., COX, A., DWARKADAS, S., HYAMS, C., LI, Z., AND ZWAENEPOEL, W. Treadmarks: Shared memory computing on networks of workstations. IEEE Computer 29, 2 (Feb 1996), 18-28.
    • (1996) IEEE Computer , vol.29 , Issue.2 , pp. 18-28
    • Amza, C.1    Cox, A.2    Dwarkadas, S.3    Hyams, C.4    Li, Z.5    Zwaenepoel, W.6
  • 5
    • 0022769976 scopus 로고
    • Graph-based algorithms for Boolean function manipulation
    • BRYANT, R. E. Graph-based algorithms for Boolean function manipulation. In IEEE Transactions on Computers (1986), vol. C-35, pp. 8:677-691.
    • (1986) IEEE Transactions on Computers , vol.C-35 , pp. 8
    • Bryant, R.E.1
  • 7
    • 1642292086 scopus 로고    scopus 로고
    • Breadth-first with depth-first BDD construction: A hybrid approach
    • School of Computer Science, Carnegie Mellon University
    • CHEN, Y.-A., YANG, B., AND BRYANT, R. E. Breadth-first with depth-first BDD construction: A hybrid approach. Tech. Rep. CMU-CS-97-120, School of Computer Science, Carnegie Mellon University, 1997.
    • (1997) Tech. Rep. CMU-CS-97-120
    • Chen, Y.-A.1    Yang, B.2    Bryant, R.E.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.