Samuel Coward
where else to find them
what they talk about
where they keep going back
- EGRAPHS3 editions2024–2026
on a stage with
all 13 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| From Rewriting to Fixpoints: Solving Recursive Equations with E-Graphs | EGRAPHS 2026 | 2026-06-15 |
Extends e-graphs to represent recursive variables by adding secondary definitional edges that link a variable to its definition without merging, builds a… | ||
| eqsat: An Equality Saturation Dialect for Non-destructive Rewriting | EGRAPHS 2025 | 2025-06-16 |
An MLIR-based e-graph representation called eqsat dialect encodes e-classes and e-nodes as MLIR ops and uses MLIR graph regions to express cycles so equality… | ||
| Algorithm-Aware Hardware Optimization using E-Graph Rewriting: how should we marry(…) | EGRAPHS 2024 | 2024-06-24 |
SEER orchestrates e-graph rewriting with LLVM MIR passes and an Act-based Intel Rover hardware optimizer, translating between MIR and a custom crand IR… | ||
| Powered by Less: Low Power Circuit Synthesis | EGRAPHS 2024 | 2024-06-24 |
An automated RTL-to-RTL framework named Rover uses e-graph rewriting to combine arithmetic rewrites with clock/data gating and transparent-register insertion… | ||
| Novel Numerical Hardware Design Methodology - From machine readable spec to optimized RTL | PLARCH 2023 | 2023-06-17 |
A machine-readable pipeline uses FPCore plus MPFR to simulate thousands of numeric-format variants in under two hours and generates a FPCore-to-bit-accurate… | ||
| nothing matches | ||