Presburger Award 2010

The Presburger Award Committee, consisting of S. Leonardi, A. Tarlecki, and W. Thomas (chair) has unanimously decided to propose Mikolaj Bojanczyk (Warsaw) as first recipient of the EATCS Presburger Award for young scientists.

Mikolaj Bojanczyk, 32 years old, has contributed numerous deep results to automata theory and to logic and algebra in computer science. Among them is the theorem stating that tree walking automata are strictly weaker than general tree automata, the definition of new decidable logics based on quantifiers for boundedness, and the development of a novel algebraic framework for the study of properties of unranked trees. His work thus led to the solution of long-standing open problems and introduced methods that open new directions in theoretical computer science (also relevant to neighbour disciplines such as data base theory). The committee recommends Mikolaj Bojanczyk as an exceptional young scientist who not only fully deserves the Presburger Award but is also an ideal first recipient. The committee also would like to mention that more than one excellent nomination was made, a fact which lets us hope that the Presburger Award will receive several nominations of truly exceptional level from all areas of theoretical computer science in the coming years.


More information your social media marketing partner
European Association for Theoretical Computer Science - Maintained and hosted by RU1 / CTI.