HERO: Hierarchical EMC-constrained routing
暂无分享,去创建一个
Anja Feldmann | Thomas Lengauer | Ralf Thiele | D. Theune | Thomas Lengauer | A. Feldmann | D. Theune | R. Thiele
[1] Michael Burstein,et al. Hierarchical Wire Routing , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[2] D.. Experimental Results for a Linear Program Global Router , 1986 .
[3] Gary Jackoway,et al. Global Forced Hierarchical Router , 1986, DAC 1986.
[4] Chak-Kuen Wong,et al. A Hierarchical Global Wiring Algorithm for Custom Chip Design , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[5] Prabhakar Raghavan,et al. Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..
[6] Jonathan S. Turner,et al. Almost All k-Colorable Graphs are Easy to Color , 1988, J. Algorithms.
[7] Rob A. Rutenbar,et al. Automatic layout of custom analog cells in ANAGRAM , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.
[8] Krzysztof Wawryn,et al. Layout including parasitics for printed circuit boards , 1988 .
[9] R. Guerrieri,et al. A general router for analog layout , 1989, Proceedings. VLSI and Computer Peripherals. COMPEURO 89.
[10] W. John. Remarks to the solution of EMC-problems on printed-circuit-boards , 1990 .
[11] Thomas Lengauer,et al. A robust framework for hierarchical floorplanning with integrated global wiring , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.
[12] Alberto L. Sangiovanni-Vincentelli,et al. A routing methodology for analog integrated circuits , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.
[13] Thomas Lengauer,et al. Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.
[14] Alberto L. Sangiovanni-Vincentelli,et al. Constraint generation for routing analog circuits , 1991, DAC '90.
[15] Thomas Lengauer,et al. Unstructured Path Problems and the Making of Semirings (Preliminary Version) , 1991, WADS.
[16] Thomas Lengauer,et al. Efficient Algorithms for Path Problems with Gernal Cost Citeria , 1991, ICALP.