Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
The least weight subsequence problem
SIAM Journal on Computing
The concave least-weight subsequence problem revisited
Journal of Algorithms
The Z notation: a reference manual
The Z notation: a reference manual
Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
Optimal algorithms for tree partitioning
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Programming by multiset transformation
Communications of the ACM
Finding a minimum weight K-link path in graphs with Monge property and applications
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Computational aspects of inlining
Computational aspects of inlining
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Inlining to Reduce Stack Space
PLILP '93 Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming
Restructuring VLSI layout representations for efficiency
EURO-DAC '91 Proceedings of the conference on European design automation
On squashing hierarchical designs [VLSI]
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
Hierarchical descriptions of objects may be restructured by selective inlining. This paper considers the improvement of tree-structured hierarchies. Trade-offs are observed between the increased size of an inlined description, and its reduced number of hierarchical levels. Optimization problems are formulated where the minimum size expansion is incurred while obtaining a desired height reduction. Two varieties of inlining are considered, and weighted graphs are used to model the optimization problem. For one variety of inlining, an O(n√H log n)-time algorithm is described; it can reduce an n-cell hierarchy to H levels, if the structure of the hierarchy is linear. For general trees, an O(Hn2)-time algorithm is given. With the other variety of inlining, the linear problem is solved in O(H2n3) time, while for general trees with certain arc-weight constraints, a 2-approximate algorithm runs in O(Hn2) time. Related open problems are given and applications are discussed.