Data structures and network algorithms
Data structures and network algorithms
Fast algorithms for shortest paths in planar graphs, with applications
SIAM Journal on Computing
Two-dimensional compaction by “zone refining”
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
On minimal closure constraint generation for symbolic cell assembly
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Hierarchical pitchmatching compaction using minimum design
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Cell-based hierarchical pitchmatching compaction using minimal LP
DAC '93 Proceedings of the 30th international Design Automation Conference
A compaction method for full chip VLSI layouts
DAC '93 Proceedings of the 30th international Design Automation Conference
HIMALAYAS — a hierarchical compaction system with a minimized constraint set
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Automatic process migration of datapath hard IP libraries
Proceedings of the 2004 Asia and South Pacific Design Automation Conference
| Hi-index | 0.00 |
In this paper, we bound the complexity of the major algorithms of 1-d compaction in graph solution and module assembly to be &Ogr;(n15logn). An 1-d hierarchical module assembly method is shown to be free from the x-y interlock problem and achieves significant improvement in space and time requirements by exploiting hierarchy.