Journal of the ACM

Paper

01 Jan 1984

Bounding Fan-out in Logical Networks

Abstract

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

Related

Paper

Sublinear optimization for machine learning

Kenneth L. Clarkson, Elad Hazan, et al.

Journal of the ACM

Paper

On Seeing Spaghetti: Self-Adjusting Piecewise Toroidal Recognition of Flexible Extruded Objects

John R. Kender, Rick Kjeldsen

IEEE Transactions on Pattern Analysis and Machine Intelligence

Paper

Processor Allocation in Multiprogrammed Distributed-Memory Parallel Computer Systems

Vijay K. Naik, Sanjeev K. Setia, et al.

Journal of Parallel and Distributed Computing

Paper

An agent-based approach for scheduling multiple machines

Rama Akkiraju, Pinar Keskinocak, et al.

Applied Intelligence

View all publications