Kirill Khoruzhii, PhD student at the Interactive Optimization and Learning (IOL) Lab, has won the **Distinguished Student Author Award at ISSAC 2026**, the International Symposium on Symbolic and Algebraic Computation.
His award-winning paper, *"Faster Algorithms for Structured Matrix Multiplication via Flip Graph Search"* (with Patrick Gelß and Sebastian Pokutta), gives explicit low-rank bilinear non-commutative schemes for multiplying structured n×n matrices with 2 ≤ n ≤ 5. The schemes are found via a search over "flip graphs" (a rank-14 skew-symmetric 3×3 scheme beats AlphaTensor), and serve as building blocks for recursive algorithms with improved asymptotic complexity. The work advances the state of the art in fast structured matrix multiplication, with direct relevance for computational algebra and beyond.
Congratulations!
