PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Han, Kwangsoo"

Author of the publication

copydeleteadd this publication to your clipboard
Benchmarking of Mask Fracturing Heuristics.

, , , , and . IEEE Trans. on CAD of Integrated Circuits and Systems, 36 (1): 170-183 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Han Song University of Stuttgart

Liao Han University of Stuttgart

Qi Han

Jeffrey Hanna University of Stuttgart

Udo-Ernst Haner University of Stuttgart

 

Other publications of authors with the same name

OCV-aware top-level clock tree optimization., , , , and . ACM Great Lakes Symposium on VLSI, page 33-38. ACM, (2014)Performance- and energy-aware optimization of BEOL interconnect stack geometry in advanced technology nodes., , , and . ISQED, page 104-110. IEEE, (2017)Evaluation of BEOL design rule impacts using an optimal ILP-based detailed router., , and . DAC, page 68:1-68:6. ACM, (2015)A global-local optimization framework for simultaneous multi-mode multi-corner clock skew variation reduction., , , , and . DAC, page 26:1-26:6. ACM, (2015)Clock clustering and IO optimization for 3D integration., , , and . SLIP, page 1-8. IEEE, (2015)Benchmarking of mask fracturing heuristics., , , , , and . ICCAD, page 246-253. IEEE, (2014)Delay uncertainty and signal criticality driven routing channel optimization for advanced DRAM products., , , and . ASP-DAC, page 697-704. IEEE, (2016)Vertical M1 Routing-Aware Detailed Placement for Congestion and Wirelength Reduction in Sub-10nm Nodes., , , , , and . DAC, page 51:1-51:6. ACM, (2017)A study of optimal cost-skew tradeoff and remaining suboptimality in interconnect tree constructions., , , and . SLIP@DAC, page 2:1-2:8. ACM, (2018)Prim-Dijkstra Revisited: Achieving Superior Timing-driven Routing Trees., , , , , , and . ISPD, page 10-17. ACM, (2018)