Showing cs.ARShow all
2 papers · 1 filter
cs.AR2026
When Algorithmic Exploration Becomes Cheap: A Case Study of Agentic Research in EDA
Keren Zhu, Yu Deng, Xiaoyu Hao +6
As EDA researchers, we conducted eight deliberate trials of agentic algorithm exploration, selecting several topics outside our areas of depth. One faculty member and seven student…
cs.AR2026
Beyond No-Good Benders Cuts: Exact Realizability for Discretely Tunable Clock Trees
Boxiang Song, Keren Zhu
Useful-skew schedules can satisfy timing constraints yet remain unrealizable by a fixed clock tree with discrete tuning choices. We formulate this mismatch as exact membership in a…