SIGN IN
SIGN UP
Bounded-skew clock and Steiner routing under Elmore delay
Full Text:
PDF
Buy this Article
Authors:
Jason Cong
UCLA, Dept. of Computer Science, Los Angeles, CA
Andrew B. Kahng
UCLA, Dept. of Computer Science, Los Angeles, CA
Cheng-Kok Koh
UCLA, Dept. of Computer Science, Los Angeles, CA
C.-W. Albert Tsao
UCLA, Dept. of Computer Science, Los Angeles, CA
1995 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 7
· Downloads (cumulative): 196
· Citation Count: 19
Published in:
· Proceeding
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Pages 66-71
IEEE Computer Society
Washington, DC
, USA
©1995
table of contents
ISBN:0-8186-7213-7
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
ICCAD'13
Publisher Site
Share:
|
Tags:
algorithms
bounded-skew, zero-skew, clock routing, elmore delay, pathlength delay, zero-skew, vlsi, routing trees, global routing
measurement
placement and routing
routing and layout
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