- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Switchbox Routing in VLSI Design: Closing the Complexity Gap ; 1996, 500
Preprint Reihe Mathematik ; 1996, 500
- Klassifikation
-
Mathematik
- DOI
-
10.14279/depositonce-14345
- Handle
-
11303/15572
- URN
-
urn:nbn:de:101:1-2022011306444935001621
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:35 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
Ähnliche Objekte (12)
Design rules in VLSI routing
Design Rules in VLSI Routing
VLSI Routing for Advanced Technology
Fast resource sharing in VLSI routing
VLSI placement and routing : the PI project
Routing congestion in VLSI circuits : estimation and optimization
Shortest paths and Steiner trees in VLSI routing
On the test complexity of VLSI systems
On the test complexity of VLSI systems
Closing the Accountability Gap
Packet Routing: Complexity and Algorithms
Cellular neural networks : chaos, complexity and VLSI processing
Design rules in VLSI routing
Design Rules in VLSI Routing
VLSI Routing for Advanced Technology
Fast resource sharing in VLSI routing
VLSI placement and routing : the PI project
Routing congestion in VLSI circuits : estimation and optimization
Shortest paths and Steiner trees in VLSI routing
On the test complexity of VLSI systems
On the test complexity of VLSI systems
Closing the Accountability Gap
Packet Routing: Complexity and Algorithms
Cellular neural networks : chaos, complexity and VLSI processing
Design rules in VLSI routing
Design Rules in VLSI Routing
VLSI Routing for Advanced Technology
Fast resource sharing in VLSI routing
VLSI placement and routing : the PI project
Routing congestion in VLSI circuits : estimation and optimization
Shortest paths and Steiner trees in VLSI routing
On the test complexity of VLSI systems
On the test complexity of VLSI systems
Closing the Accountability Gap
Packet Routing: Complexity and Algorithms