Best Paper Award at STOC 2019
The program committee of the ACM Symposium on Theory of Computing conference (STOC) – where every year, about 100 most important discoveries in theory of computer science are presented – has awarded the best paper award for article "The Reachability Problem for Petri Nets is Not Elementary"], whose authors among others are Wojciech Czerwiński and Sławomir Lasota.
![Obrazek — Best Paper Award at STOC 2019](/media/uploads/info-images/news-image-pl-best-paper-award-at-stoc-2019.png)
2019-03-18