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

Vertex-Ant-Walk - A robust method for efficient exploration of faulty graphs

Vladimir Yanovski, Israel A. Wagner, et al.

Ann. Math. Artif. Intell.

Conference paper

Selecting an optimal combination of storage & transmission assets with a non-dispatchable electricity supply

Khalid Abdulla, Andrew Wirth, et al.

ICIAfS 2014

Paper

Few shot chain-of-thought driven reasoning to prompt LLMs for open-ended medical question answering

Saeel Sandeep Nachane, Ojas Gramopadhye, et al.

EMNLP 2024

Conference paper

Social navigation through the Spoken Web: Improving audio access through collaborative filtering in Gujarat, India

Robert Farrell, Rajarshi Das, et al.

AAAI-SS 2010

View all publications