New lower bound techniques for VLSI (Q3950484)

From MaRDI portal
Revision as of 00:56, 21 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
New lower bound techniques for VLSI
scientific article

    Statements

    New lower bound techniques for VLSI (English)
    0 references
    0 references
    1984
    0 references
    0 references
    crossing number
    0 references
    wire area
    0 references
    layout area
    0 references
    maximum edge length
    0 references
    N-node planar graph
    0 references
    area-efficient chip layouts
    0 references
    bisection width
    0 references
    graph embedding
    0 references
    mesh of trees
    0 references
    parallel computation
    0 references
    separator
    0 references
    Thompson grid model
    0 references
    tree of meshes
    0 references
    very large scale integration
    0 references
    wire length
    0 references