The pin redistribution problem in multi-chip modules (Q1327562): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Reporting and Counting Geometric Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition algorithm for circuit routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global wire routing in two-dimensional arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding a fundamental set of cycles of a graph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:36, 22 May 2024

scientific article
Language Label Description Also known as
English
The pin redistribution problem in multi-chip modules
scientific article

    Statements

    The pin redistribution problem in multi-chip modules (English)
    0 references
    0 references
    0 references
    0 references
    19 June 1994
    0 references
    0 references
    0 references
    0 references
    0 references
    pin redistribution problem
    0 references
    layout design of multi-chip modules
    0 references