Journal of Computer and System Sciences
Symbolic layout compaction review
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
Fundamentals of Data Structures in Pascal
Fundamentals of Data Structures in Pascal
DAC '81 Proceedings of the 18th Design Automation Conference
On routing two-point nets across a channel
DAC '82 Proceedings of the 19th Design Automation Conference
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
A fast algorithm to test planar topological routability
VLSID '95 Proceedings of the 8th International Conference on VLSI Design
| Hi-index | 14.98 |
Three algorithms to join two compacted cells by using a combination of stretching and river routing are developed. Each of these obtains the minimum area joining. One algorithm obtains a minimum area joining that also minimizes the length of the longest wire. Another obtains a minimum area joining that has the least possible total wire length. The simplest of the algorithms guarantees only a minimum are joining. All algorithms have a low-order polynomial complexity. Experimental results indicate that the algorithms obtain joinings that are significantly superior to those obtained using the heuristic of G. Cheng and A. Despain (1989).