Bounding Fan-out in Logical Networks

Authors

H. James Hoover, University of Toronto
Maria M. Klawe, IBM Research Laboratory
Nicholas Pippenger, Harvey Mudd CollegeFollow

Document Type

Article

Department

Mathematics (HMC)

Publication Date

1984

Abstract

Algorithms are presented which modify logical networks of bounded fan-in to obtain functionally equivalent networks of bounded fan-in and fan-out, so that both size and depth are not increased by more than constant factors.

Rights Information

© 1984 Association for Computing Machinery

Terms of Use & License Information

Terms of Use for work posted in Scholarship@Claremont.

DOI

10.1145/2422.322412

Recommended Citation

Hoover, H.J., Klawe, M.K., and Pippenger, N. "Bounding Fan-Out in Logical Networks", J. ACM, 31 (1984), 13-18. doi: 10.1145/2422.322412