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
Parents
157
Jason Luu, Jeffrey Goeders, Michael Wainberg et al. · ACM Transactions on Reconfigurable Technology and Systems · 2014 · 362 citations
Kevin E. Murray, Oleg Petelin, Sheng Zhong et al. · ACM Transactions on Reconfigurable Technology and Systems · 2020 · 293 citations
1–5 of 157
323
University of Illinois Urbana-Champaign, United States
16 publications · 368 citations
13
h-index
10
h-index
8
h-index
7
h-index
6
h-index
1–5 of 323
116
The University of Texas at Austin
Austin, United States
13 h-index
28 publications
658 citations

University of Toronto
Toronto, Canada
12 h-index
46 publications
7.4K citations
Xilinx (United States)
San Jose, United States
10 h-index
17 publications
1.8K citations
University of Washington
Seattle, United States
10 h-index
21 publications
1.6K citations
University of Illinois Urbana-Champaign
Urbana, United States
7 h-index
12 publications
208 citations
University of California, Santa Barbara
Santa Barbara, United States
7 h-index
11 publications
241 citations

University of British Columbia
Vancouver, Canada
7 h-index
10 publications
811 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
6 h-index
9 publications
134 citations
1–8 of 116
21 publications · 812 citations
16
h-index
Conference · 6 publications · 215 citations
6
h-index
5 publications · 243 citations
5
h-index
5 publications · 163 citations
5
h-index
TODAES · 4 publications · 139 citations
4
h-index
1–5