Statistical static timing analysis via modern optimization lens. I: Histogram-based approach

DOI10.1007/S11081-023-09847-3MaRDI QIDQ6640166zbMATH OpenFDO

Authors Adam Bosák, Dmytro Mishagli, Jakub Mareček

Publication date 18 November 2024

Published in Optimization and Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11081-023-09847-3

zbMATH Keywords

binary-integer programminggeometric programmingstatistical static timing analysis

Mathematics Subject Classification ID

Sequences and sets (11Bxx) Basic methods for problems in optics and electromagnetic theory (78Mxx) Mathematical programming (90Cxx)

Cites work

• A convex programming solution for gate-sizing with pipelining constraints
• A tutorial on geometric programming
• Combinatorial optimization in VLSI design
• Combinatorial Problems in Chip Design
• Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning
• CVXPY: a Python-embedded modeling language for convex optimization
• Digital Circuit Optimization via Geometric Programming
• Handbook of Algorithms for Physical Design Automation
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• Johann Faulhaber and Sums of Powers
• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
• On the stable equilibrium points of gradient systems
• Proof of the gradient conjecture of R. Thom.
• The Greatest of a Finite Set of Random Variables
• Transistor sizing of custom high-performance digital circuits with parametric yield considerations

This page was built for publication: Statistical static timing analysis via modern optimization lens. I: Histogram-based approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6640166)