Charles J. Alpert

TL;DR: It is shown that a good quadratic placement, followed by local wirelength-driven spreading can produce excellent results on large-scale industrial ASIC designs and RQL is the best scaled wirelength among all available academic placers.

TL;DR: A highly efficient algorithm based on dynamic programming is proposed to optimally solve slew buffering with discrete buffer locations and a new algorithm using the maximum matching technique is developed to handle the difficult cases in which no assumption is made on buffer input slew.

TL;DR: The PERI (probability distribution function extension for ramp inputs) technique is proposed, that extends delay metrics for step inputs to the more general and realistic non-step (such as a ramp) inputs.

TL;DR: This paper shows how to apply a generalization of an algorithm due to Weiszfeld to placement with a linear wirelength objective and that the main GORDIAN-L loop is actually a special case of this algorithm, and proposes applying a regularization parameter to the generalized WeisZfeld algorithm to control the tradeoff between convergence and solution accuracy.

TL;DR: A new tree construction is proposed for performance-driven global routing which directly trades off between Prim's minimum spanning tree algorithm and Dijkstra's shortest path tree algorithm, achieving routing trees which satisfy a given routing tree radius bound while using less wire than previous methods.