ACM Home Page
Please provide us with feedback. Feedback
VIA design rule consideration in multi-layer maze routing algorithms
Full text PdfPdf (1.21 MB)
Source International Symposium on Physical Design archive
Proceedings of the 1999 international symposium on Physical design table of contents
Monterey, California, United States
Pages: 214 - 220  
Year of Publication: 1999
ISBN:1-58113-089-9
Authors
Jason Cong  Computer Science Department, UCLA, Los Angeles, CA
Jie Fang  Computer Science Department, UCLA, Los Angeles, CA
Kei-Yong Khoo  Computer Science Department, UCLA, Los Angeles, CA
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 10,   Citation Count: 2
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/299996.300084
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
E. W. Dijkstra, "A note on two problems in connexion with graphs, Numeri~ehe Mathematik, vol. 1, pp. 269 271, 1959.
 
2
C. Lee, An algorithm for path connections and its applications, IRE Trans Electronic Computers, vol. EC- 10, no. 1, pp. 346-65, 1961.
 
3
 
4
5
 
6
A. Tetelbaum, Generalized optimum path search, IEEE Trans. Computer-Aided Design, vol. 14, no. 12, pp. 1586-1590, Dee. 1995.
 
7


Collaborative Colleagues:
Jason Cong: colleagues
Jie Fang: colleagues
Kei-Yong Khoo: colleagues