An O(n) algorithm for transistor stacking with performance constraints

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Bulent Basaran Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA
Rob A. Rutenbar Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA
Published in:
Cover Image
 
· Proceeding
DAC '96 Proceedings of the 33rd annual Design Automation Conference
Pages 221-226
ACM New York, NY, USA ©1996
table of contents ISBN:0-89791-779-0 doi>10.1145/240518.240559
An <italic>O</italic>(<italic>n</italic>) algorithm for transistor stacking with performance constraints Published by ACM 1996 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 9
· Downloads (cumulative): 204
· Citation Count: 5


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


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

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder