ACM Home Page
Please provide us with feedback. Feedback
Exact switchbox routing with search space reduction
Full text PdfPdf (203 KB)
Source International Symposium on Physical Design archive
Proceedings of the 2000 international symposium on Physical design table of contents
San Diego, California, United States
Pages: 26 - 32  
Year of Publication: 2000
ISBN:1-58113-191-7
Authors
Frank Schmiedle  Institute for Computer Science, Albert-Ludwig+University Freiburg, Am Flughafen 17, 79110 Freiburg, Germany
Daniel Unruh  Institute for Computer Science, Albert-Ludwig+University Freiburg, Am Flughafen 17, 79110 Freiburg, Germany
Bernd Becker  Institute for Computer Science, Albert-Ludwig+University Freiburg, Am Flughafen 17, 79110 Freiburg, Germany
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 10,   Citation Count: 2
Additional Information:

references   cited by   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/332357.332369
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
 
2
S. Devadas. Optimal layout via Boolean satisfiability. In Int'l Conf. on CAD, pages 294-297, 1989.
 
3
N. GSckel, R. Drechsler, and B. Becker. A multi-layer detailed routing approach based on evolutionary algorithms. In Int'l Conference on Evolutionary Computation, pages 557-562, 1997.
 
4
T. Kam, T. Villa, R. Brayton, and A. Sangiovanni- Vincentelli. Multi-valued decision diagrams: Theory and applications. Multiple Valued Logic - An International Journal, pages 9-62, 1998.
 
5
6
 
7
F. Schmiedle, R. Drechsler, and B. Becker. Exact routing using symbolic representation. In Int'l Syrup. Circ. and Systems, pages VI:394-VI:397, 1999.
 
8
 
9
F. Somenzi. CUDD: CU Decision Diagram Package Release 2.3.0. University of Colorado at Boulder, 1998.
 
10
A. Srinivasan, T. Kam, S. Malik, and R. Brayton. Algorithms for discrete function manipulation. In Int'l Conf. on CAD, pages 92-95, 1990.
 
11
T. Szymanski. Dogleg channel routing is NP-complete. IEEE Trans. on CAD, 4(1):31-41, 1985.
 
12
 
13
T. Yoshimura and E. Kuh. Efficient algorithms for channel routing. IEEE Trans. on CAD, CAD-1(1):23- 35, Jan. 1982.

Collaborative Colleagues:
Frank Schmiedle: colleagues
Daniel Unruh: colleagues
Bernd Becker: colleagues