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

DOI10.1007/s11081-023-09847-3MaRDI QIDQ6640166

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

Publication date: 18 November 2024

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

zbMATH Keywords

geometric programmingbinary-integer programmingstatistical static timing analysis

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
• A tutorial on geometric programming
• Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning
• A convex programming solution for gate-sizing with pipelining constraints
• Transistor sizing of custom high-performance digital circuits with parametric yield considerations
• On the stable equilibrium points of gradient systems
• CVXPY: A Python-Embedded Modeling Language for Convex Optimization
• Johann Faulhaber and Sums of Powers
• Handbook of Algorithms for Physical Design Automation
• Combinatorial Problems in Chip Design
• Digital Circuit Optimization via Geometric Programming
• The Greatest of a Finite Set of Random Variables
• Proof of the gradient conjecture of R. Thom.

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