The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
An automatic/interactive layout planning system for arbitrarily-sized rectangular building blocks
DAC '81 Proceedings of the 18th Design Automation Conference
SHARPS: A hierarchical layout system for VLSI
DAC '81 Proceedings of the 18th Design Automation Conference
Representation and generation of rectangular dissections
DAC '78 Proceedings of the 15th Design Automation Conference
Methods for hierarchical automatic layout of custom LSI circuit masks
DAC '78 Proceedings of the 15th Design Automation Conference
The genealogical approach to the layout problem
DAC '80 Proceedings of the 17th Design Automation Conference
Placement algorithms for arbitrarily shaped blocks
DAC '79 Proceedings of the 16th Design Automation Conference
Placement and routing algorithms for hierarchical integrated circuit layout
Placement and routing algorithms for hierarchical integrated circuit layout
Shape determination and placement algorithms for hierarchical integrated circuit layout
Shape determination and placement algorithms for hierarchical integrated circuit layout
Big Omicron and big Omega and big Theta
ACM SIGACT News
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
Canonical embedding of rectangular duals with applications to VLSI floorplanning
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Floorplanning strategy for mixed analog-digital VLSI integrated circuits
EURO-DAC '91 Proceedings of the conference on European design automation
| Hi-index | 0.00 |
Algorithms are presented for placement and for modifying existing placements to be used in channel routing solutions for custom VLSI layout. The placements are produced so as not to have channel routing order constraint cycles, which constitute a familiar problem for custom VLSI. The algorithms are based on mathematical results characterizing the structure of channel routing order constraints.