On Driving Many Long Lines in a VLSI Layout
暂无分享,去创建一个
[1] M. Rem,et al. Cost and performance of VLSI computing structures , 1979, IEEE Transactions on Electron Devices.
[2] Jean Vuillemin,et al. A combinatorial limit to the computing power of V.L.S.I. circuits , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[3] J. von Neumann,et al. Probabilistic Logic and the Synthesis of Reliable Organisms from Unreliable Components , 1956 .
[4] Thompson. The VLSI Complexity of Sorting , 1983, IEEE Transactions on Computers.
[5] H. T. Kung,et al. The chip complexity of binary arithmetic , 1980, STOC '80.
[6] F. Leighton. New lower bound techniques for VLSI , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[7] Bernard Chazelle,et al. Census functions: An approach to VLSI upper bounds , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[8] Lawrence Snyder,et al. Bounds on minimax edge length for complete binary trees , 1981, STOC '81.
[9] Richard C. Jaeger,et al. Comments on "An optimized output stage for MOS integrated circuits" [with reply] , 1975 .
[10] W. L. Ruzzo,et al. Minimum Edge Length Planar Embeddings of Trees , 1981 .
[11] L.W. Linholm,et al. An optimized output stage for MOS integrated circuits , 1975, IEEE Journal of Solid-State Circuits.
[12] Franco P. Preparata,et al. A Critique and an Appraisal of VLSI Models of Computation. , 1981 .