[OOPSLA'25] Fast Client-Driven CFL-Reachability via Regularization-Based Graph Simplification
About this video
Advanced · Editorial review · 85% confidenceWhole-channel inclusion: ACM SIGPLAN is an honest teaching channel (title sample + 3 transcripts read: All three samples lack transcripts, so the channel verdict relies on the prior title-sample assessment indicating near-entirely academic conference talks and tutorials.); this title passed a strict title check (sonnet) after a labelling pass.
A 14-minute video from ACM SIGPLAN: “[OOPSLA'25] Fast Client-Driven CFL-Reachability via Regularization-Based Graph Simplification”.
Video by ACM SIGPLAN, played through YouTube's embedded player.