Design of the IBM RISC System/6000 floating-point execution unit
IBM Journal of Research and Development
Leading-zero anticipator (LZA) in the IBM RISC System/6000 floating-point execution unit
IBM Journal of Research and Development
Higher Radix Square Root with Prescaling
IEEE Transactions on Computers - Special issue on computer arithmetic
Fast Addition of Large Integers
IEEE Transactions on Computers
ELM-A Fast Addition Algorithm Discovered by a Program
IEEE Transactions on Computers
Asynchronous Parallel Prefix Computation
IEEE Transactions on Computers
On the Time Required to Perform Multiplication
Journal of the ACM (JACM)
The Time Required for Group Multiplication
Journal of the ACM (JACM)
Computational Work and Time on Finite Machines
Journal of the ACM (JACM)
The Area-Time Complexity of Binary Multiplication
Journal of the ACM (JACM)
A Survey of Parallel Machine Organization and Programming
ACM Computing Surveys (CSUR)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
IEEE Transactions on Computers
Over-Redundant Digit Sets and the Design of Digit-By-Digit Division Units
IEEE Transactions on Computers
Area-time efficient addition in charge based technology
DAC '81 Proceedings of the 18th Design Automation Conference
The relationship between computational circuit complexity and radix
MVL '76 Proceedings of the sixth international symposium on Multiple-valued logic
The chip complexity of binary arithmetic
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
On the problem of computational time and complexity of arithmetic functions
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
On the computation time of certain classes of boolean functions
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
The complexity of computations by networks
IBM Journal of Research and Development - Mathematics and computing
Delay optimization of linear depth boolean circuits with prescribed input arrival times
Journal of Discrete Algorithms
The delay of circuits whose inputs have specified arrival times
Discrete Applied Mathematics
ACM Turing award lectures
On the Time Necessary to Compute Switching Functions
IEEE Transactions on Computers
A Regular Layout for Parallel Adders
IEEE Transactions on Computers
Combinational Circuit Synthesis with Time and Component Bounds
IEEE Transactions on Computers
On the Addition of Binary Numbers
IEEE Transactions on Computers
AFIPS '65 (Fall, part I) Proceedings of the November 30--December 1, 1965, fall joint computer conference, part I
Observations on high-performance machines
AFIPS '67 (Fall) Proceedings of the November 14-16, 1967, fall joint computer conference
Establishing lower bounds on algorithms: a survey
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Theory of computing in computer science education
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Mathematical ``Lower Bounds'' and the Logic Circuit Designer
IEEE Transactions on Computers
Computation Times of Arithmetic and Boolean Functions in (d, r) Circuits
IEEE Transactions on Computers
Engineering and scientific processing on the IBM 3090
IBM Systems Journal
Parallel solution of recurrence problems
IBM Journal of Research and Development
On the computational complexity of finite functions and semigroup multiplication
Information Sciences: an International Journal
An area-time efficient NMOS adder
Integration, the VLSI Journal
An improved maximally redundant signed digit adder
Computers and Electrical Engineering
Constant addition with flagged binary adder architectures
Integration, the VLSI Journal
Parallelism and Array Processing
IEEE Transactions on Computers
| Hi-index | 0.06 |