SIGN IN
SIGN UP
Optimal buffered routing path constructions for single and multiple clock domain systems
Full Text:
PDF
Buy this Article
Authors:
Soha Hassoun
Tufts University, Medford, MA
Charles J. Alpert
IBM Austin Research Laboratory, Austin, TX
Meera Thiagarajan
Tufts University, Medford, MA
Published in:
· Proceeding
ICCAD '02
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Pages 247-253
ACM
New York, NY
, USA
©2002
table of contents
ISBN:0-7803-7607-2
doi>
10.1145/774572.774609
2002 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 11
· Downloads (cumulative): 215
· Citation Count: 18
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
ICCAD'13
Share:
|
Tags:
algorithms
algorithms implemented in hardware
analysis of algorithms
design
documentation
placement and routing
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder