Chun Kit Lam
where else to find them
no profile links on file
what they talk about
where they keep going back
- OOPSLA2 editions2023–2024
on a stage with
who talks about the same things
- Giovanna Kobus Conrado4 talks
- Ahmed Khaled Zaher3 talks
- Kerim Kochekov2 talks
- Max Willsey12 talks
- Amir Kafshdar Goharshady10 talks
- Jahrim Gabriele Cesario2 talks
| title | conference | date |
|---|---|---|
| Fast and Optimal Extraction for Sparse Equality Graphs | OOPSLA 2024 | 2024-10-20 |
The paper proves e-graph extraction is NP-hard and hard to approximate by reduction from set cover, then gives a fixed-parameter tractable dynamic program over… | ||
| The Bounded Pathwidth of Control-Flow Graphs | OOPSLA 2023 | 2023-10-23 |
Proves control-flow graphs of structured, goto-free programs have pathwidth at most 2·nesting depth, and gives a linear-time path decomposition construction… | ||
| nothing matches | ||