Space-efficient extraction algorithms
暂无分享,去创建一个
[1] Franco P. Preparata,et al. Plane-sweep algorithms for intersecting geometric figures , 1982, CACM.
[2] J. P. Eurich. A Tutorial Introduction to the Electronic Design Interchange Format , 1986, DAC 1986.
[3] Thomas Szymanski,et al. Goalie: A Space Efficient System for VLSI Artwork Analysis , 1985, IEEE Design & Test of Computers.
[4] Pieter van der Wolf,et al. On the architecture of a CAD framework: The NELSIS approach , 1990, Proceedings of the European Design Automation Conference, 1990., EDAC..
[5] Christopher J. Van Wyk,et al. Space Efficient Algorithms for VLSI Artwork Analysis , 1983, 20th Design Automation Conference Proceedings.
[6] N. P. van der Meijs,et al. An efficient algorithm for analysis of non-orthogonal layout , 1989 .
[7] Robert E. Tarjan,et al. Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.
[8] Walter S. Scott,et al. Magic's Circuit Extractor , 1985, DAC 1985.
[9] Ulrich Lauther. An O (N log N) Algorithm for Boolean Mask Operations , 1981, 18th Design Automation Conference.
[10] Dileep A. Divekar. Corner Stitching: A Data-Structuring Technique for VLSI Layout Tools , 1984 .
[11] N.P. van der Meijs,et al. Reduced RC models for IC interconnections with coupling capacitances , 1992, [1992] Proceedings The European Conference on Design Automation.
[12] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[13] N. P. van der Meijs,et al. Extracting simple but accurate RC models for VLSI interconnect , 1988 .