Universality considerations in VLSI circuits

@article{Valiant1981UniversalityCI,
  title={Universality considerations in VLSI circuits},
  author={Leslie G. Valiant},
  journal={IEEE Transactions on Computers},
  year={1981},
  volume={C-30},
  pages={135-140}
}
The problem of embedding the interconnection pattern of a circuit into a two-dimensional surface of minimal area is discussed. Since even for some natural patterns graphs containing m connections may require Ω(m2) area, in order to achieve compact embeddings restricted classes of graphs have to be considered. For example, arbitrary trees (of bounded degree) can be embedded in linear area without edges crossing over. Planar graphs can be embedded efficiently only if crossovers are allowed in the… CONTINUE READING
Highly Influential
This paper has highly influenced 18 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 170 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Area-time complexity for VLSI

  • C. D. Thompson
  • Proc. 11th ACM Symp. on Theory of Comput., 1979…
  • 1979
1 Excerpt

Applications of a planar separator theorem

  • Proc. 18th IEEE Symp. on FOCS, 1977, pp. 162-170.
  • 1977
3 Excerpts

Linear and planar arrangements of graphs

  • Y. Shiloach
  • Ph.D. dis­ sertation, Weizmann Institute, Rehovot…
  • 1976
2 Excerpts

Universal circuits

  • Proc. 8th ACM Symp. on Theory of Comput., 1976…
  • 1976
3 Excerpts

Graphs and Hypergraphs

  • C. Berge
  • Amsterdam, The Netherlands: North-Holland,
  • 1973
2 Excerpts

Similar Papers

Loading similar papers…