21 citations · 21 across the 3 of their papers we have counts for
6 papers
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…
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…
FAPO: Fanout-Aware Post-Mapping Optimization for LUT-Based FPGAs
Xiaoyu Hao, Keren Zhu
Reducing logic depth during FPGA technology mapping can leave fanout bottlenecks in the resulting LUT network. LUT replication redistributes these loads but consumes area and incre…
Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis
Keren Zhu
Logic synthesis has evolved from compact two-level minimization to large multilevel flows with many interacting optimization operators. Recent work has invested substantial effort…
Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs
Keren Zhu
Large language models may make precise but dormant algorithmic problems practical to revisit, and may expose new paths toward fundamental ones. We demonstrate this possibility thro…
The Dawn of AI-Native EDA: Opportunities and Challenges of Large Circuit Models
Lei Chen, Yiqi Chen, Zhufei Chu +36
Within the Electronic Design Automation (EDA) domain, AI-driven solutions have emerged as formidable tools, yet they typically augment rather than redefine existing methodologies.…