Analytical minimization of half-perimeter wirelength

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	Charles J. Alpert , Tony F. Chan , Dennis J.-H. Huang , Andrew B. Kahng , Igor L. Markov , Pep Mulet , Kenneth Yan, Faster minimization of linear wirelength for global placement, Proceedings of the 1997 international symposium on Physical design, p.4-11, April 14-16, 1997, Napa Valley, California, United States [doi>10.1145/267665.267670]
	2	C. J. Alpert, A. E. Caldwell, T. Chan, D. J.-H. Huang, A. B. Kahng, I. L. Markov and M. Moroz, "Analytical Engines Are Unnecessary in Top-down Partitioning-Based Placement" VLSI Design (1999), to appear.
	3	R. Baldick, A. Kahng, A. Kennings and I. Markov, "Function Smoothing with Applications to VLSI Layout", Proc. ASP-DAC '99, pp. 225-228.
	4	Hans Eisenmann , Frank M. Johannes, Generic global placement and floorplanning, Proceedings of the 35th annual conference on Design automation, p.269-274, June 15-19, 1998, San Francisco, California, United States [doi>10.1145/277044.277119]
	5	R. Fletcher and M.J.D. Powell, "A Rapidly Convergent Descent Method for Minimization", Computer J. 6, 1963, pp. 163-168.
	6	Sung-Woo Hur , John Lillis, Relaxation and clustering in a local search framework: application to linear placement, Proceedings of the 36th ACM/IEEE conference on Design automation, p.360-366, June 21-25, 1999, New Orleans, Louisiana, United States [doi>10.1145/309847.309958]
	7	M. A. B. Jackson , E. S. Kuh, Performance-driven placement of cell based IC's, Proceedings of the 26th ACM/IEEE conference on Design automation, p.370-375, June 25-28, 1989, Las Vegas, Nevada, United States [doi>10.1145/74382.74444]
	8	M. Hanan, P. K.Wolff, and B. J. Agule, "A Study of Placement Techniques." J. Design Automation and Fault-Tolerant Computing, vol. 2, 1978, pp. 28-61.
	9	T. Koide at al, "Par-POPINS: a Timing-driven Parallel Placement Method With the Elmore Delay Model For Row Based VLSIs", Proc. ASP-DAC '97, 1997. pp. 133-40.
	10	Thomas Lengauer, Combinatorial algorithms for integrated circuit layout, John Wiley & Sons, Inc., New York, NY, 1990
	11	D. C. Liu , J. Nocedal, On the limited memory BFGS method for large scale optimization, Mathematical Programming: Series A and B, v.45 n.3, p.503-528, Dec. 1989 [doi>10.1007/BF01589116]
	12	I. I. Mahmoud, K. Asakura, T. Nishibu and T. Ohtsuki, "Experimental Appraisal of Linear and Quadratic Objective Functions Effect on Force Directed Method for Analog Placement", IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences 4(E77-A), 1994, pp. 710-725.
	13	J. Nocedal, "Large Scale Unconstrained Optimization", The State of the Art in Numerical Analysis, Ed. A Watson and I. Duff, Oxford University Press, 1996.
	14	James M. Ortega , Werner C. Rheinboldt, Iterative solution of nonlinear equations in several variables, Society for Industrial and Applied Mathematics, Philadelphia, PA, 2000
	15	B. M. Riess and G. G. Ettelt, "Speed: Fast and Efficient Timing Driven Placement", Proc. ISCAS '95, pp. 377-380.
	16	Majid Sarrafzadeh , David Knol , Gustavo Tellez, Unification of budgeting and placement, Proceedings of the 34th annual conference on Design automation, p.758-761, June 09-13, 1997, Anaheim, California, United States [doi>10.1145/266021.266364]
	17	Georg Sigl , Konrad Doll , Frank M. Johannes, Analytical placement: A linear or a quadratic objective function?, Proceedings of the 28th conference on ACM/IEEE design automation, p.427-432, June 17-22, 1991, San Francisco, California, United States [doi>10.1145/127601.127707]
	18	A. Srinivasan, K. Chaudhary and E. S. Kuh, "RITUAL: A Performance Driven Placement for Small-Cell ICs", Proc. ICCAD '91, pp. 48-51.
	19	Takahashi, K.; Nakajima, K.; Terai, M.; Sato, K., "Min-cut Placement With Global Objective Functions For Large Scale Sea-of-gates Arrays.", IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 14, no. 4, April 1995, pp. 434-446.
	20	R. S. Tsay, E. Kuh, "A Unified Approach to Partitioning and Placement", IEEE Transactions on Circuits and Systems, Vol.38, No.5, May 1991. pp., 521-633.
	21	Ren-Song Tsay , Ernest S. Kuh , Chi-Ping Hsu, Proud: a fast sea-of-gates placement algorithm, Proceedings of the 25th ACM/IEEE conference on Design automation, p.318-323, June 12-15, 1988, Atlantic City, New Jersey, United States
	22	Y.-W. Tsay, H.-P. Su, Y.-L. Lin, "An Improved Objective For Cell Placement", Proc. ASP-DAC '97, Japan, 1997, pp. 281- 284.
	23	Jens Vygen, Algorithms for large-scale flat placement, Proceedings of the 34th annual conference on Design automation, p.746-751, June 09-13, 1997, Anaheim, California, United States [doi>10.1145/266021.266360]
	24	J. Vygen, Personal Communication, November, 1999.
	25	B. X. Weis and D. A. Mlynski, "A New Relative Placement Procedure Based on MSST and Linear Programming. Proc. ISCAS '87, pp. 564-567.