

University of Warsaw
The program committee of the ACM Symposium on Theory of Computing (STOC) conference, which presents about 100 most important discoveries in a given year in theoretical computer science, awarded the award for the best work of the article “The Reachability Problem for Petri Nets is Not Elementary”, which co-authors are Wojciech Czerwiński and Sławomir Lasota (Institute of Computer Science, MIM UW).