HERO: hierarchical EMC-constrained routing

Authors:
D. Theune;R. Thiele;T. Lengauer;A. Feldmann
Affiliations:
University of Paderborn/Siemens Nixdorf Informationssysteme AG, Bahnhofstraβe 32, D-4790 Paderborn, Germany;University of Paderborn/Siemens Nixdorf Informationssysteme AG, Bahnhofstraβe 32, D-4790 Paderborn, Germany;German National Computer Science Research Center (GMD-II), Schloβ Birlinghoven, W5205 St., Augustin 1, Germany and Department of Computer Science, University of Bonn, Römersträβ ...;Department of Computer Science, Carnegie Mellon University, Pittsburgh PA and University of Paderborn/Siemens Nixdorf Informationssysteme AG, Bahnhofstraβe 32, D-4790 Paderborn, Germany
Venue:
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Year:
1992

Experimental results for a linear program global router

Computers and Artificial Intelligence
Randomized rounding: a technique for provably good algorithms and algorithmic proofs

Combinatorica - Theory of Computing
Almost all k-colorable graphs are easy to color

Journal of Algorithms
Combinatorial algorithms for integrated circuit layout

Combinatorial algorithms for integrated circuit layout
Efficient algorithms for path problems with general cost criteria

Proceedings of the 18th international colloquium on Automata, languages and programming
Constraint generation for routing analog circuits

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Global forced hierarchical router

DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference

Layer assignment for high-performance multi-chip modules

ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Performance driven global routing and wiring rule generation for high speed PCBs and MCMs

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference

Hi-index	0.03