The Placement of Computer Logic Modules
Journal of the ACM (JACM)
Algorithm 422: minimal spanning tree [H]
Communications of the ACM
An algorithm for minimizing backboard wiring functions
Communications of the ACM
Computing minimum spanning trees efficiently
ACM '72 Proceedings of the ACM annual conference - Volume 1
Automatic component placement in an interactive minicomputer environment
DAC '81 Proceedings of the 18th Design Automation Conference
The interconnection problem - a tutorial
DAC '73 Proceedings of the 10th Design Automation Workshop
Automatic component placement in the nomad system
DAC '75 Proceedings of the 12th Design Automation Conference
The application of integer programming in design automation
DAC '66 Proceedings of the SHARE design automation project
Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces
IEEE Transactions on Computers
An algorithm for placement of interconnected elements based on minimum wire length
AFIPS '64 (Spring) Proceedings of the April 21-23, 1964, spring joint computer conference
| Hi-index | 0.04 |