메뉴 건너뛰기




Volumn 3, Issue 3, 1998, Pages 496-514

Optimal river routing with crosstalk constraints

Author keywords

Algorithms; Crosstalk; Design; Experimentation; Performance; River routing

Indexed keywords


EID: 22644451449     PISSN: 10844309     EISSN: None     Source Type: Journal    
DOI: 10.1145/293625.293636     Document Type: Article
Times cited : (5)

References (13)
  • 2
    • 27944444681 scopus 로고
    • Circuits, Interconnections and Packaging for VLSI
    • BAKOGLU, H. B. 1990. Circuits, Interconnections and Packaging for VLSI. Addison-Wesley, Reading, MA.
    • (1990) Addison-Wesley, Reading, MA.
    • Bakoglu, H.B.1
  • 10
    • 0003828819 scopus 로고
    • Combinatorial Algorithms for Integrated Circuit Layout
    • LENGAUER, T. 1990. Combinatorial Algorithms for Integrated Circuit Layout. Wiley, New York.
    • (1990) Wiley, New York.
    • Lengauer, T.1
  • 11
    • 0021450923 scopus 로고
    • One-layer routing without component constraints
    • 28 (June 1984), 420-438.
    • LLOYD, E. L. RAVI, S. S. 1984. One-layer routing without component constraints. J. Comput. Syst. Sci. 28 (June 1984), 420-438.
    • (1984) J. Comput. Syst. Sci.
    • Lloyd, E.L.1    Ravi, S.S.2
  • 12
    • 33746690787 scopus 로고
    • A computer program for optimal routing of printed circuit connectors. /F/PS Proc
    • 47, 1475-1478.
    • MlKAMI, K. TABUCHI, K. 1968. A computer program for optimal routing of printed circuit connectors. /F/PS Proc. H47, 1475-1478.
    • (1968) H
    • Mlkami, K.1    Tabuchi, K.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.