Show simple item record

dc.contributor.advisorLeiserson, Charles E.en_US
dc.contributor.authorMaley, F. Milleren_US
dc.date.accessioned2023-03-29T15:13:54Z
dc.date.available2023-03-29T15:13:54Z
dc.date.issued1986-11
dc.identifier.urihttps://hdl.handle.net/1721.1/149639
dc.description.abstractThis thesis presents an algorithm for one-dimensional compaction of VLSI layouts. It differs from older methods in treating wires not as objects to be moved, but as constraints on the positions of other circuit components. These constraints are determined for each wiring layer using the theory of planar routing.en_US
dc.relation.ispartofseriesMIT-LCS-TR-372
dc.titleCompaction with Automatic Job Introductionen_US
dc.identifier.oclc16963144


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record