Information Transfer in Distributed Computing with Applications to VLSI
暂无分享,去创建一个
[1] Bernard Chazelle,et al. Census functions: An approach to VLSI upper bounds , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[2] AbelsonHarold. Lower Bounds on Information Transfer in Distributed Computations , 1980 .
[3] Jean Vuillemin,et al. A Combinatorial Limit to the Computing Power of VLSI Circuits , 1983, IEEE Transactions on Computers.
[4] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.
[5] John E. Savage. Area-Time Tradeoffs for Matrix Multiplication and Related Problems in VLSI Models , 1981, J. Comput. Syst. Sci..
[6] Richard J. Lipton,et al. Lower bounds for VLSI , 1981, STOC '81.
[7] Amiel Feinstein,et al. Transmission of Information. , 1962 .
[8] AbelsonHarold,et al. Information transfer and area-time tradeoffs for VLSI multiplication , 1980 .
[9] H. T. Kung,et al. The chip complexity of binary arithmetic , 1980, STOC '80.
[10] Lynn Conway,et al. Introduction to VLSI systems , 1978 .
[11] Andrew Chi-Chih Yao,et al. The entropic limitations on VLSI computations(Extended Abstract) , 1981, STOC '81.
[12] Mill Johannes G.A. Van,et al. Transmission Of Information , 1961 .