Skip to content
Descubridor Institucional UMAR
Inicio
Búsqueda avanzada
Explorar
Inicio
Búsqueda avanzada
Explorar
Login
Language
English
Deutsch
Español
Français
Italiano
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Guaranteed Yet Hard to Find: Uncovering FPGA Routing Convergence Paradox
Guaranteed Yet Hard to Find: Uncovering FPGA Routing Convergence Paradox
Fuente:
Zenodo
Saved in:
Bibliographic Details
Main Authors:
Shrivastava, Shashwat
,
Nikolić, Stefan
,
Tanaka, Sun
,
Ravishankar, Chirag
,
Gaitonde, Dinesh
,
Stojilović, Mirjana
Format:
Recurso digital
Language:
English
Published:
Zenodo
2025
Subjects:
FPGA
Routing
PathFinder
Computer-aided design
Online Access:
Acceder al recurso
Tags:
Add Tag
No Tags, Be the first to tag this record!
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Save to List
Permanent link
Holdings
Description
Comments
Similar Items
Staff View
Description
Description not available.
Similar Items
Szenario: SZ-SB-III-02-01: Suche nach anderen Schüler*innen
by: Peil, Ricarda, et al.
Published: (2025)
Análisis de los FRBR en la ejecución de tareas genéricas en catálogos compartidos
by: Enrique Orduña-Malea
Published: (2008)
The Central Mediterranean Route: East African Migration to Libya and Europe: Perspectives from Eastern Africa
by: (Ph.D), Abraham Kuol Nyuon
Published: (2022)
Executable Branch-and-Price-Algorithm for the Pollution Routing Problem
by: Bektas, Tolga, et al.
Published: (2025)
Cultural Tourism and Historical Routes. The Way of St Peter from Jerusalem to Rome
by: Anna Trono
Published: (2017)