Tian Shu
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 1 in the filters
on a stage with
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| Parameterized Algorithms and Complexity for Function Merging with Branch Reordering | PLDI 2026 | 2026-06-15 |
Shows that allowing function merging with branch reordering makes the optimization NP-hard, then gives parameterized algorithms: a constructive FPT algorithm… | ||
| nothing matches | ||