Author of the publication

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.

Apl. Prof. Dr. -Ing. Niels Hansen University of Stuttgart

Generalized DeepONets for Viscosity Prediction Using Learned Entropy Scaling References, , , , and . Dataset, (2025)Related to: Fleck M, Klenk T, Darouich S, Spera MBM, Hansen N. A Generalized Deep Entropy Scaling Architecture Framework to Predict Viscosities. ChemRxiv. 2025; doi: This content is a preprint and has not been peer-reviewed. doi: 10.26434/chemrxiv-2025-jrjj9.
 

Other publications of authors with the same name

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