Warm congratulations to Guy Arbel, a Ph.D. student in the Faculty of Computer Science, on receiving the Distinguished Paper Award at LICS 2026, one of the world's leading and most prestigious conferences in logic in computer science.
Guy's paper, "A Complexity Bound for Determinisation of Min-Plus Weighted Automata," addresses the complexity of the determinisation problem for weighted automata, a fundamental computational model. The decidability of this problem remained open for more than 30 years, until Guy's earlier groundbreaking work proved that the problem is decidable.
In this new work, Guy and his advisors, Prof. Shaull Almagor and Dr. Sarai Sheinvald, extended this breakthrough by establishing a complexity bound for the problem. Beyond this important result, Guy developed novel techniques for working with weighted automata that are expected to benefit researchers in the field.
Congratulations on this outstanding achievement!
Read the full paper: https://arxiv.org/pdf/2602.01221
Conference website: https://lics.siglog.org/lics26/
[Back to the news index]