Advances in homotopic layout compaction

Authors:
S. Gao;M. Kaufmann;F. M. Maley
Affiliations:
Fachbereich 10, Informatik, Universität des Saarlandes, 6600 Saarbrücken, West Germany;Fachbereich 10, Informatik, Universität des Saarlandes, 6600 Saarbrücken, West Germany;Department of Computer Science, Princeton University, Princeton, New Jersey
Venue:
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Year:
1989

Algorithms for routing and testing routability of planar VLSI layouts

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A faster strongly polynomial minimum cost flow algorithm

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On continuous Homotopic one layer routing

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Toward a mathematical theory of single-layer wire routing

Proceedings of the fifth MIT conference on Advanced research in VLSI
A faster compaction algorithm with automatic jog insertion

Proceedings of the fifth MIT conference on Advanced research in VLSI

Hi-index	0.00