When Algorithmic Exploration Becomes Cheap: A Case Study of Agentic Research in EDA
cs.AR, cs.AI
Submitted: 2026-10-07
Updated: 2026-10-07
Sources
- Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs
- Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis
- AlphaEvolve: A coding agent for scientific and algorithmic discovery
- Mathematical exploration and discovery at scale
- First Proof Second Batch
- ChipNeMo: Domain-Adapted LLMs for Chip Design
- Can LLMs Generate Novel Research Ideas? A Large-Scale Human Study with 100+ NLP Researchers
- OpenABC-D: A Large-Scale Dataset For Machine Learning Guided Integrated Circuit Synthesis
- VerilogEval: Evaluating Large Language Models for Verilog Code Generation
- Agent Skills Can Be Harmful: An Empirical Study of Skill-Induced Failures in LLM Agents
- Rethinking the Value of Agent-Generated Tests for LLM-Based Software Engineering Agents
Related papers
- WitCert: Sound Runtime Risk Observability and Gating for KV-Cache Quantization
- Golden Ruler: A Numeric Format Catalog with Bit-Exact Conformance Vectors for FP8, BF16, MXFP4, and Microscaling Formats
- RFChipAgent: Multi-Agentic AI Flow for Analog/RF Chip Design
- PoisonCap: Efficient Hierarchical Temporal Safety for CHERI
- Provisioning to Runtime Optimization of a 100 MW-Scale AI Cluster
- Bit-Accurate Modeling of GPU Matrix Multiply-Accumulate Units: Demystifying Numerical Discrepancy and Accuracy