Bounding Fan-out in Logical Networks

DOI10.1145/2422.322412MaRDI QIDQ3030723zbMATH OpenOpenAlexFDO

Authors H. James Hoover, Maria M. Klawe, Nicholas Pippenger

Publication date 1984

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2422.322412

zbMATH Keywords

Algorithmsbounded fan-inbounded fan-outdepthlogic networkssize

Mathematics Subject Classification ID

Recommendations

• scientific article; zbMATH DE number 1236361
• Representing and reasoning about logical network topologies
• scientific article; zbMATH DE number 1535260
• Linear logic for nets with bounded resources
• Linear lower bounds on unbounded fan-in Boolean circuits
• scientific article; zbMATH DE number 4168398
• Fanout limitations on constraint systems
• Fault-tolerant logical network structures

Cited in

(10)

• ERCW PRAMs and optical communication
• The complexity of computing maximal word functions
• Minimax trees in linear time with applications
• The delay of circuits whose inputs have specified arrival times
• Online binary minimax trees
• scientific article; zbMATH DE number 3912286 (Why is no real title available?)
• A VLSI circuit model accounting for wire delay
• Efficient simulation of circuits by EREW PRAMs
• A complexity theory of efficient parallel algorithms
• Parallel models of computation: An introductory survey

This page was built for publication: Bounding Fan-out in Logical Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3030723)