MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Computer Science and Artificial Intelligence Lab (CSAIL)
  • LCS Publications
  • LCS Technical Reports (1974 - 2003)
  • View Item
  • DSpace@MIT Home
  • Computer Science and Artificial Intelligence Lab (CSAIL)
  • LCS Publications
  • LCS Technical Reports (1974 - 2003)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

The Complexity of Graph Layour and Channel Routing for VLSI

Author(s)
Bhatt, Sandeep N.
Thumbnail
DownloadMIT-LCS-TR-351.pdf (3.604Mb)
Metadata
Show full item record
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.
Date issued
1984-02
URI
https://hdl.handle.net/1721.1/149619
Series/Report no.
MIT-LCS-TR-351

Collections
  • LCS Technical Reports (1974 - 2003)

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.