Maze router without a grid map

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Maze router without a grid map

Full text

Pdf (409 KB)

Source

International Conference on Computer Aided Design archive
Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design table of contents

Santa Clara, California, United States

Pages: 382 - 385

Year of Publication: 1992

ISBN:0-89791-540-2

Author

Jiri Soukup

Code Farms Inc., 7214 Jock Trail, Richmond, Ont., K0A 2Z0, Canada

Sponsors

IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
IEEE-CS : Computer Society

Publisher

IEEE Computer Society Press Los Alamitos, CA, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 13, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Lee C.Y.: An algorithm for path connections .... IRE Trans. Electron.Comput., pp.346-365, Sept. 1961.
	2	Rubin F.: The Lee .... 1974 IEEE T.Com., C-23, pp.907-914.
	3	Soukup J.: Circuit Layout, Proc.of IEEE, Vol.69, No.10.
	4	Jiri Soukup, Organized C: A unified method of handling data in CAD algorithms and databases, Proceedings of the 27th ACM/IEEE conference on Design automation, p.425-430, June 24-27, 1990, Orlando, Florida, United States [doi>10.1145/123186.123325]
	5	goyle et al: Geometrical compaction .... 1987 DAC, pp.140-4.
	6	Hightower D.: A solution .... 1969 DA Workshop.

CITED BY 3

	Hesham Keshk , Shin-ichiro Mori , Hiroshi Nakashima , Shinji Tomita, Amon: a parallel slice algorithm for wire routing, Proceedings of the 9th international conference on Supercomputing, p.200-208, July 03-07, 1995, Barcelona, Spain
	Jason Cong , Jie Fang , Kei-Yong Khoo, An implicit connection graph maze routing algorithm for ECO routing, Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design, p.163-167, November 07-11, 1999, San Jose, California, United States
	Jason Cong , Jie Fang , Kei-Yong Khoo, VIA design rule consideration in multi-layer maze routing algorithms, Proceedings of the 1999 international symposium on Physical design, p.214-220, April 12-14, 1999, Monterey, California, United States