Revisiting floorplan representations

Proceedings of the International Symposium on Physical Design

Volumn , Issue , 2001, Pages 138-143

  Yao, B ^a   Chen, H ^a   Cheng, C K ^a   Graham, R ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; PERTURBATION TECHNIQUES; RANDOM PROCESSES; TOPOLOGY;

BINARY TREE STRUCTURE; MOSAIC FLOORPLANS; SLICING FLOORPLANS;

COMPUTATIONAL COMPLEXITY;

EID: 0034823712     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/369691.369753     Document Type: Conference Paper

References (11)

1. On fixed points of the composite of commuting functions
2. B*-trees: A new representation for non-slicing floorplans
3. The number of baxter permutations
4. Baxter permutations
5. Some problems of non-associative combinations
6. An O-tree representation of non-slicing floorplan and its applications
7. Conner block list: An effective and efficient topological representation of non-slicing floorplan
8. Rectangle-packing-based module placement
9. Module packing based on the BSG-structure and IC layout applications
10. Automatic floorplan design
11. FAST-SP a fast algorithm for block placement based on sequence pair