Baihan Lin, Guillermo Cecchi, et al.
IJCAI 2023
Paper
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
Guojing Cong, David A. Bader
Journal of Parallel and Distributed Computing
Harsha Kokel, Aamod Khatiwada, et al.
VLDB 2025
Conference paper
Counterexample to theorems of Cox and Fine
Joseph Y. Halpern
aaai 1996