We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

The Complexity of Graph Layour and Channel Routing for VLSI

Thumbnail Image
Download
Name

MIT-LCS-TR-351.pdf

Size

3.6 MB

Format

Adobe PDF

Checksum (MD5)

e68e1422f1da7dfbac7e32d09ff54deb

Author(s)
Bhatt, Sandeep N.
Date Issued
February 1984
Series/Report no.
MIT-LCS-TR-351
Abstract
This thesis is motivated by the need for a clearer understanding of various issues in VLSI layout. Within a formal setting, we identify critical properties of circuits that determine the quality of their layouts.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.