New lower bound techniques for VLSI:
In this paper, crossing number and wire area arguments are used to find lower bounds on the layout area and maximum edge length of a variety of new and computationally useful networks. In particular, an N-node planar graph which has layout are theta(N log N) and maximum edge length theta(N(1/2)/log(...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass.
Laboratory for Computer Science, Massachusetts Inst. of Technology
1982
|
| Schlagworte: | |
| Zusammenfassung: | In this paper, crossing number and wire area arguments are used to find lower bounds on the layout area and maximum edge length of a variety of new and computationally useful networks. In particular, an N-node planar graph which has layout are theta(N log N) and maximum edge length theta(N(1/2)/log(1/2)N), an N-node graph with an theta(x 1/2)-separator which has layout area theta(N log(2)N) and maximum edge length theta(N(1/2)logN/loglogN), and an N-node graph with an theta(x(1-1/r)-separator which has maximum edge length theta(N(1-1/r) for any r > or = .3. |
| Beschreibung: | 29 S. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021876383 | ||
| 003 | DE-604 | ||
| 005 | 20040229000000.0 | ||
| 007 | t | ||
| 008 | 880307s1982 |||| 00||| eng d | ||
| 035 | |a (OCoLC)227552857 | ||
| 035 | |a (DE-599)BVBBV021876383 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 088 | |a MIT/LCS/TM-227 | ||
| 100 | 1 | |a Leighton, Frank T. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a New lower bound techniques for VLSI |c Frank Thomson Leighton |
| 264 | 1 | |a Cambridge, Mass. |b Laboratory for Computer Science, Massachusetts Inst. of Technology |c 1982 | |
| 300 | |a 29 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | 3 | |a In this paper, crossing number and wire area arguments are used to find lower bounds on the layout area and maximum edge length of a variety of new and computationally useful networks. In particular, an N-node planar graph which has layout are theta(N log N) and maximum edge length theta(N(1/2)/log(1/2)N), an N-node graph with an theta(x 1/2)-separator which has layout area theta(N log(2)N) and maximum edge length theta(N(1/2)logN/loglogN), and an N-node graph with an theta(x(1-1/r)-separator which has maximum edge length theta(N(1-1/r) for any r > or = .3. | |
| 650 | 4 | |a Lower bounds | |
| 650 | 4 | |a Thompson grid model | |
| 650 | 4 | |a VLSI(Very Large Scale Integration) | |
| 650 | 7 | |a Chips(electronics) |2 dtict | |
| 650 | 7 | |a Computers |2 dtict | |
| 650 | 7 | |a Edges |2 dtict | |
| 650 | 7 | |a Electrical and Electronic Equipment |2 scgdst | |
| 650 | 7 | |a Graphs |2 dtict | |
| 650 | 7 | |a Grids |2 dtict | |
| 650 | 7 | |a Integrated circuits |2 dtict | |
| 650 | 7 | |a Length |2 dtict | |
| 650 | 7 | |a Mathematical models |2 dtict | |
| 650 | 7 | |a Mesh |2 dtict | |
| 650 | 7 | |a Networks |2 dtict | |
| 650 | 7 | |a Nodes |2 dtict | |
| 650 | 7 | |a Space(room) |2 dtict | |
| 650 | 7 | |a Trees |2 dtict | |
| 650 | 7 | |a Wire |2 dtict | |
| 650 | 4 | |a Mathematisches Modell | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015091999 | ||
Datensatz im Suchindex
| _version_ | 1804135815865958400 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Leighton, Frank T. |
| author_facet | Leighton, Frank T. |
| author_role | aut |
| author_sort | Leighton, Frank T. |
| author_variant | f t l ft ftl |
| building | Verbundindex |
| bvnumber | BV021876383 |
| ctrlnum | (OCoLC)227552857 (DE-599)BVBBV021876383 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01993nam a2200493zc 4500</leader><controlfield tag="001">BV021876383</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040229000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">880307s1982 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227552857</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021876383</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT/LCS/TM-227</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Leighton, Frank T.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">New lower bound techniques for VLSI</subfield><subfield code="c">Frank Thomson Leighton</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Laboratory for Computer Science, Massachusetts Inst. of Technology</subfield><subfield code="c">1982</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">29 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">In this paper, crossing number and wire area arguments are used to find lower bounds on the layout area and maximum edge length of a variety of new and computationally useful networks. In particular, an N-node planar graph which has layout are theta(N log N) and maximum edge length theta(N(1/2)/log(1/2)N), an N-node graph with an theta(x 1/2)-separator which has layout area theta(N log(2)N) and maximum edge length theta(N(1/2)logN/loglogN), and an N-node graph with an theta(x(1-1/r)-separator which has maximum edge length theta(N(1-1/r) for any r > or = .3.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Lower bounds</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Thompson grid model</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">VLSI(Very Large Scale Integration)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Chips(electronics)</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computers</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Edges</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Electrical and Electronic Equipment</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graphs</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Grids</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Integrated circuits</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Length</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematical models</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mesh</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Networks</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Nodes</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Space(room)</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Trees</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Wire</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematisches Modell</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015091999</subfield></datafield></record></collection> |
| id | DE-604.BV021876383 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:03:36Z |
| indexdate | 2024-07-09T20:46:30Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015091999 |
| oclc_num | 227552857 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 29 S. |
| publishDate | 1982 |
| publishDateSearch | 1982 |
| publishDateSort | 1982 |
| publisher | Laboratory for Computer Science, Massachusetts Inst. of Technology |
| record_format | marc |
| spelling | Leighton, Frank T. Verfasser aut New lower bound techniques for VLSI Frank Thomson Leighton Cambridge, Mass. Laboratory for Computer Science, Massachusetts Inst. of Technology 1982 29 S. txt rdacontent n rdamedia nc rdacarrier In this paper, crossing number and wire area arguments are used to find lower bounds on the layout area and maximum edge length of a variety of new and computationally useful networks. In particular, an N-node planar graph which has layout are theta(N log N) and maximum edge length theta(N(1/2)/log(1/2)N), an N-node graph with an theta(x 1/2)-separator which has layout area theta(N log(2)N) and maximum edge length theta(N(1/2)logN/loglogN), and an N-node graph with an theta(x(1-1/r)-separator which has maximum edge length theta(N(1-1/r) for any r > or = .3. Lower bounds Thompson grid model VLSI(Very Large Scale Integration) Chips(electronics) dtict Computers dtict Edges dtict Electrical and Electronic Equipment scgdst Graphs dtict Grids dtict Integrated circuits dtict Length dtict Mathematical models dtict Mesh dtict Networks dtict Nodes dtict Space(room) dtict Trees dtict Wire dtict Mathematisches Modell |
| spellingShingle | Leighton, Frank T. New lower bound techniques for VLSI Lower bounds Thompson grid model VLSI(Very Large Scale Integration) Chips(electronics) dtict Computers dtict Edges dtict Electrical and Electronic Equipment scgdst Graphs dtict Grids dtict Integrated circuits dtict Length dtict Mathematical models dtict Mesh dtict Networks dtict Nodes dtict Space(room) dtict Trees dtict Wire dtict Mathematisches Modell |
| title | New lower bound techniques for VLSI |
| title_auth | New lower bound techniques for VLSI |
| title_exact_search | New lower bound techniques for VLSI |
| title_exact_search_txtP | New lower bound techniques for VLSI |
| title_full | New lower bound techniques for VLSI Frank Thomson Leighton |
| title_fullStr | New lower bound techniques for VLSI Frank Thomson Leighton |
| title_full_unstemmed | New lower bound techniques for VLSI Frank Thomson Leighton |
| title_short | New lower bound techniques for VLSI |
| title_sort | new lower bound techniques for vlsi |
| topic | Lower bounds Thompson grid model VLSI(Very Large Scale Integration) Chips(electronics) dtict Computers dtict Edges dtict Electrical and Electronic Equipment scgdst Graphs dtict Grids dtict Integrated circuits dtict Length dtict Mathematical models dtict Mesh dtict Networks dtict Nodes dtict Space(room) dtict Trees dtict Wire dtict Mathematisches Modell |
| topic_facet | Lower bounds Thompson grid model VLSI(Very Large Scale Integration) Chips(electronics) Computers Edges Electrical and Electronic Equipment Graphs Grids Integrated circuits Length Mathematical models Mesh Networks Nodes Space(room) Trees Wire Mathematisches Modell |
| work_keys_str_mv | AT leightonfrankt newlowerboundtechniquesforvlsi |