MIT Libraries logoDSpace@MIT

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

New Lower Bound Techniques For VLSI

Author(s)
Leighton, Frank Thomson
Thumbnail
DownloadMIT-LCS-TM-227.pdf (7.464Mb)
Metadata
Show full item record
Abstract
In this paper, we use crossing number and wire area arguments to find lower bounds on the layout area and maximum edge length of a variety of new and computationally useful networks. In particular, we describe 1) an N-node planar graph which has layout area ⊖ (NlogN) and maximum edge length ⊖(N^1/2/log^1/2N), 2) an N-node graph with an O(x^1/2)-separator which has layout area ⊖ (Nlog^2N) and maximum edge length ⊖ (N^1/2logN/loglogN), and 3) an N-node graph with an O(x^1-1/r)-separator which has maximum edge length ⊖(N1-1/4) for an r≥3.
Date issued
1982-08
URI
https://hdl.handle.net/1721.1/149037
Series/Report no.
MIT-LCS-TM-227

Collections
  • LCS Technical Memos (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.