High performance BDD package by exploiting memory hierarchy

doi:10.1145/240518.240638

High performance BDD package by exploiting memory hierarchy

Full Text:

Pdf

Buy this Article

Authors:	Jagesh V. Sanghavi	Department of Electrical Engineering and Computer Sciences, University of California at Berkeley, CA
	Rajeev K. Ranjan	Department of Electrical Engineering and Computer Sciences, University of California at Berkeley, CA
	Robert K. Brayton	Department of Electrical Engineering and Computer Sciences, University of California at Berkeley, CA
	Alberto Sangiovanni-Vincentelli	Department of Electrical Engineering and Computer Sciences, University of California at Berkeley, CA

	1996 Article
Bibliometrics
· Downloads (6 Weeks): 2 · Downloads (12 Months): 14 · Citation Count: 16

Published in:

	· Proceeding
	DAC '96 Proceedings of the 33rd annual Design Automation Conference
	ACM New York, NY, USA ©1996 table of contents ISBN:0-89791-779-0 doi>10.1145/240518.240638

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- DAC '12

Tags: algorithms design aids general measurement performance theory

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player