Fpga Routing Algorithms

FPGA Routing Algorithms is a computational method in electronic design automation that determines optimal interconnection paths between configurable logic blocks in a field-programmable gate array to satisfy timing, resource, and congestion constraints while enabling efficient hardware reconfiguration.

157

Publications

6.2K

Citations

323

Authors

116

Institutions

Publications per year

2017–2026

16

Authors

323

  1. MD
    Martin D. F. Wong

    University of Illinois Urbana-Champaign, United States

    16 publications · 368 citations

    13

    h-index

  2. YC
    Yao‐Wen Chang

    National Taiwan University, Taiwan

    10 publications · 254 citations

    10

    h-index

  3. YW
    Yu‐Liang Wu

    Chinese University of Hong Kong, Hong Kong SAR China

    8 publications · 162 citations

    8

    h-index

  4. SH
    Scott Hauck

    University of Washington, United States

    7 publications · 326 citations

    7

    h-index

  5. JR
    Jonathan Rose

    University of Toronto, Canada

    6 publications · 712 citations

    6

    h-index

1–5 of 323

Venues

  1. 16

    h-index

  2. International Conference on Computer Aided Design

    Conference · 6 publications · 215 citations

    6

    h-index

  3. 5

    h-index

  4. 5

    h-index

  5. ACM Transactions on Design Automation of Electronic Systems

    TODAES · 4 publications · 139 citations

    4

    h-index

1–5