• Publications
  • Influence
New spectral methods for ratio cut partitioning and clustering
  • L. Hagen, A. Kahng
  • Mathematics, Computer Science
  • IEEE Trans. Comput. Aided Des. Integr. Circuits…
  • 11 November 1991
TLDR
It is shown that the second smallest eigenvalue of a matrix derived from the netlist gives a provably good approximation of the optimal ratio cut partition cost. Expand
ORION 2.0: A fast and accurate NoC power and area model for early-stage design space exploration
TLDR
The development of ORION 2.0, an extensive enhancement of the original ORION models which includes completely new subcomponent power models, area models, as well as improved and updated technology models, confirms the need for accurate early-stage NoC power estimation. Expand
Accuracy-configurable adder for approximate arithmetic designs
TLDR
This paper proposes an accuracy-configurable approximate adder for which the accuracy of results is configurable during runtime, and can be used in accuracy- configurable applications, and improves the achievable tradeoff between performance/power and quality. Expand
Zero skew clock routing with minimum wirelength
The deferred-merge embedding (DME) algorithm, which embeds any given connection topology to create a clock tree with zero skew while minimizing total wirelength, is presented. The algorithm alwaysExpand
A new adaptive multi-start technique for combinatorial global optimizations
TLDR
This work motivates a new adaptive multi-start paradigm for heuristic global optimization, wherein starting points for greedy descent are adaptively derived from the best previously found local minima. Expand
Cooperative Mobile Robotics: Antecedents and Directions
TLDR
A critical survey of existing works in cooperative robotics is given and open problems in this field are discussed, emphasizing the various theoretical issues that arise in the study of cooperative robotics. Expand
Can recursive bisection alone produce routable, placements?
TLDR
The state-of-the-art after two decades of research in recursive bisection placement is summarized and a new placer is implemented, called Capo, to empirically study the achievable limits of the approach and validates fixed-die placement results by violation-free detailed auto-routability. Expand
Cooperative mobile robotics: antecedents and directions
TLDR
A critical survey of existing works in collective robotics is given and open problems in this field are discussed, emphasizing the various theoretical issues that arise in the study of cooperative robotics. Expand
Recent directions in netlist partitioning: a survey
TLDR
This survey describes research directions in netlist partitioning during the past two decades in terms of both problem formulations and solution approaches, and discusses methods which combine clustering with existing algorithms (e.g., two-phase partitioning). Expand
Bounded-skew clock and Steiner routing
TLDR
This work studies the minimum-cost bounded-skew routing tree problem under the pathlength (linear) and Elmore delay models and proposes a new Greedy-BST/DME algorithm which combines the merging region computation with topology generation. Expand
...
1
2
3
4
5
...