The delay of circuits whose inputs have specified arrival times

Authors:
Dieter Rautenbach;Christian Szegedy;Jürgen Werber
Affiliations:
Institut für Mathematik, TU Ilmenau, Postfach 100565, D-98684 Ilmenau, Germany;Cadence Berkeley Labs, 1995 University Ave, Berkeley, CA 94704, USA;Forschungsinstitut für Diskrete Mathematik, Lennéstr. 2, D-53113 Bonn, Germany
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 21
Cited 1

The complexity of Boolean functions

The complexity of Boolean functions
Fast Multiplication Without Carry-Propagate Addition

IEEE Transactions on Computers
Circuit complexity: from the worst case to the average case

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improving multiplier design by using improved column compression tree and optimized final adder in CMOS technology

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
On the Time Required to Perform Addition

Journal of the ACM (JACM)
The Parallel Evaluation of General Arithmetic Expressions

Journal of the ACM (JACM)
Restructuring of Arithmetic Expressions For Parallel Evaluation

Journal of the ACM (JACM)
Parallel Prefix Computation

Journal of the ACM (JACM)
Bounding Fan-out in Logical Networks

Journal of the ACM (JACM)
Models of Computation: Exploring the Power of Computing

Models of Computation: Exploring the Power of Computing
A Method for Speed Optimized Partial Product Reduction and Generation of Fast Parallel Multipliers Using an Algorithmic Approach

IEEE Transactions on Computers
Design strategies for the final adder in a parallel multiplier

ASILOMAR '95 Proceedings of the 29th Asilomar Conference on Signals, Systems and Computers (2-Volume Set)
Timing analysis for nMOS VLSI

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
Delay optimization of linear depth boolean circuits with prescribed input arrival times

Journal of Discrete Algorithms
Efficient Parallel Evaluation of Boolean Expressions

IEEE Transactions on Computers
The Parallel Evaluation of Arithmetic Expressions Without Division

IEEE Transactions on Computers
Reduction of Depth of Boolean Networks with a Fan-In Constraint

IEEE Transactions on Computers
Timing analysis of computer hardware

IBM Journal of Research and Development
Generalized earliest-first fast addition algorithm

IEEE Transactions on Computers

On the cost of optimal alphabetic code trees with unequal letter costs

European Journal of Combinatorics

Quantified Score

Hi-index	0.05

Visualization

Abstract

Let C be a circuit representing a straight-line program on n inputs x"1,x"2,...,x"n. If for 1=