Susan L. Spraragen
International Conference on Design and Emotion 2010
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
Danila Seliayeu, Quinn Pham, et al.
CASCON 2024
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
Baihan Lin, Guillermo Cecchi, et al.
IJCAI 2023