Upper and lower bounds on switching energy in VLSI
暂无分享,去创建一个
[1] John Tromp,et al. The energy complexity of threshold and other functions (preliminary version) , 1991 .
[2] H. T. Kung,et al. On the Area of Binary Tree Layouts , 1980, Inf. Process. Lett..
[3] H. T. Kung,et al. A Regular Layout for Parallel Adders , 1982, IEEE Transactions on Computers.
[4] C. Thomborson,et al. A Complexity Theory for VLSI , 1980 .
[5] Andrew Chi-Chih Yao,et al. The entropic limitations on VLSI computations(Extended Abstract) , 1981, STOC '81.
[6] H. T. Kung,et al. The Area-Time Complexity of Binary Multiplication , 1981, JACM.
[7] Alok Aggarwal,et al. Energy consumption in VLSI circuits , 1988, STOC '88.
[8] Thomas Lengauer,et al. On the Complexity of VLSI Computations , 1981 .
[9] Gloria Kissin. Measuring energy consumption in VLSI circuits: A foundation , 1982, STOC '82.
[10] J. Rhodes,et al. Algebraic theory of machines. I. Prime decomposition theorem for finite semigroups and machines , 1965 .
[11] Allan Borodin,et al. On Relating Time and Space to Size and Depth , 1977, SIAM J. Comput..
[12] G. Kissin. Models of multiswitch energy , 1990 .
[13] J. Rhodes,et al. RESULTS ON FINITE SEMIGROUPS DERIVED FROM THE ALGEBRAIC THEORY OF MACHINES. , 1965, Proceedings of the National Academy of Sciences of the United States of America.