A framework for solving VLSI graph layout problems (Q796306): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0022-0000(84)90071-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029282358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of minimizing wire lengths in VLSI layouts / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Compilation of Regular Expressions into Integrated Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Algorithms for Path Selection in a Nonblocking Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bound techniques for VLSI / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wafer-Scale Integration of Systolic Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for the circuit value update problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient detection of determinacy races in cilk programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5180413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3206972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network of microprocessors to execute reduction languages, part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On driving many long wires in a VLSI layout / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient heuristic cluster algorithm for tearing large-scale networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3326832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality considerations in VLSI circuits / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:26, 14 June 2024

scientific article
Language Label Description Also known as
English
A framework for solving VLSI graph layout problems
scientific article

    Statements

    A framework for solving VLSI graph layout problems (English)
    0 references
    0 references
    1984
    0 references
    0 references
    divide-and-conquer framework for VLSI graph layout
    0 references
    layout area
    0 references
    propagation delay
    0 references
    large networks of processors
    0 references
    faulty processors
    0 references
    graph partitioning heuristics
    0 references
    0 references