메뉴 건너뛰기




Volumn 2000-January, Issue , 2000, Pages 447-450

Timing driven gate duplication: Complexity issues and algorithms

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER AIDED DESIGN; DYNAMIC PROGRAMMING; LOGIC SYNTHESIS; POLYNOMIALS; CAPACITANCE; ELECTRIC NETWORK TOPOLOGY; HEURISTIC METHODS; OPTIMIZATION; THEOREM PROVING;

EID: 0034477856     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCAD.2000.896512     Document Type: Conference Paper
Times cited : (19)

References (9)
  • 2
    • 84949904822 scopus 로고    scopus 로고
    • Gate duplication for performance optimization
    • Northwestern University, June
    • A. Srivastava, R Kastner and M. Sarrafzadeh. "Gate Duplication for Performance Optimization". In Internal Memo, Northwestern University, June 2000.
    • (2000) Internal Memo
    • Srivastava, A.1    Kastner, R.2    Sarrafzadeh, M.3
  • 7
    • 0032595829 scopus 로고    scopus 로고
    • Evaluation and optimization of replication algorithms for logic bipartitioning
    • September
    • M. Enos, S. Hauck and M. Sarrafzadeh. "Evaluation and Optimization of Replication Algorithms for Logic Bipartitioning In IEEE Transactions on Computer Aided Design, pages 1237-1248, September 1999.
    • (1999) IEEE Transactions on Computer Aided Design , pp. 1237-1248
    • Enos, M.1    Hauck, S.2    Sarrafzadeh, M.3
  • 8
    • 84946209030 scopus 로고    scopus 로고
    • On the complexity of minimum-delay gate resizing/technology mapping under load-dependent delay model
    • pages, June
    • R. Murgai. "On the Complexity of Minimum-delay Gate Resizing/Technology Mapping under Load-dependent Delay Model". In Workshop Handouts, International Workshop on Logic Synthesis, pages 209-211, June 1999.
    • (1999) Workshop Handouts, International Workshop on Logic Synthesis , pp. 209-211
    • Murgai, R.1


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