The complexity of Boolean functions
The complexity of Boolean functions
On the Time Required to Perform Addition
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Models of Computation: Exploring the Power of Computing
Models of Computation: Exploring the Power of Computing
DAC '83 Proceedings of the 20th Design Automation Conference
Timing Verification and the Timing Analysis program
DAC '82 Proceedings of the 19th Design Automation Conference
An Algorithmic Approach for Generic Parallel Adders
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Timing analysis of computer hardware
IBM Journal of Research and Development
Generalized earliest-first fast addition algorithm
IEEE Transactions on Computers
The delay of circuits whose inputs have specified arrival times
Discrete Applied Mathematics
Timing optimization by restructuring long combinatorial paths
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
On the cost of optimal alphabetic code trees with unequal letter costs
European Journal of Combinatorics
| Hi-index | 0.02 |
We consider boolean circuits C over the basis @W={@?,@?} with inputs x"1, x"2,...,x"n for which arrival times t"1,t"2,...,t"n@?N"0 are given. For 1=