Rezultati
| Title: | Guaranteed Yet Hard to Find: Uncovering FPGA Routing Convergence Paradox | Authors: | Shrivastava, Shashwat; Nikolic, Stefan |
Issue Date: | 2025 | Publication: | 2025 IEEE 33RD ANNUAL INTERNATIONAL SYMPOSIUM ON FIELD-PROGRAMMABLE CUSTOM COMPUTING MACHINES, FCCM | ISSN: | 2576-2613![]() Search Idenfier |
Type: | Conference Paper | Collation: | str. 143-151 | DOI: | 10.1109/FCCM62733.2025.00060 | WoS-ID: | 001552189600018 | Scopus-ID: | 2-s2.0-105007979611 | URI: | https://cris.uns.ac.rs/en/scientific-results/proceedings-publication/47979 https://enauka.gov.rs/handle/123456789/1000170 |
Project: | Swiss National Science Foundation [182428] Ministry of Science, Technological Development and Innovation of the Republic of Serbia [451-03-137/2025-03/ 200125, 451-03-136/2025-03/ 200125] |
Metadata source: | (Preuzeto iz Nasi u WoS) | M-category: | Mp. category will be shown later |
Items in eNauka are protected by copyright, with all rights reserved, unless otherwise indicated.
