( en | de | ru )

 

Disambiguation of "Hagen, Lars W."

Author of the publication

copydeleteadd this publication to your clipboard
Quantified Suboptimality of VLSI Layout Heuristics.

, , and . DAC, page 216-221. ACM Press, (1995)

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.

Lars Hagen

Lars W Freij

Hagen W Lippe-Weißenfeld

Hagen W Lippe-Weißenfeld

Hagen W Lippe-Weißenfeld

 

Other publications of authors with the same name

New spectral methods for ratio cut partitioning and clustering., and . IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 11 (9): 1074-1085 (1992)Combining problem reduction and adaptive multistart: a new technique for superior iterative partitioning., and . IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 16 (7): 709-717 (1997)On implementation choices for iterative improvement partitioning algorithms., , and . IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 16 (10): 1199-1205 (1997)A new approach to effective circuit clustering., and . ICCAD, page 422-427. IEEE Computer Society / ACM, (1992)Quantified Suboptimality of VLSI Layout Heuristics., , and . DAC, page 216-221. ACM Press, (1995)Fast Spectral Methods for Ratio Cut Partitioning and Clustering., and . ICCAD, page 10-13. IEEE Computer Society, (1991)Net Partitions Yield Better Module Partitions., , and . DAC, page 47-52. IEEE Computer Society Press, (1992)On the intrinsic Rent parameter and spectra-based partitioning methodologies., , , and . IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 13 (1): 27-37 (1994)On the intrinsic rent parameter and spectra-based partitioning methodologies., , , and . EURO-DAC, page 202-208. IEEE Computer Society Press, (1992)Mobile agent based service subscription and customization using the UMTS virtual home environment., , and . Comput. Networks, 31 (19): 2063-2078 (1999)