[Proof Complexity] Awardees of the VCLA International Student Awards for Outstanding Master and Undergraduate Theses in Logic and Computer Science - 2020

Mihaela Rozman mihaela.rozman at tuwien.ac.at
Wed Jul 15 14:58:04 CEST 2020

The Vienna Center for Logic and Algorithms of TU Wien (VCLA) 

has the pleasure to announce 

the recipients of the VCLA International Student Awards for Outstanding Master and Undergraduate Theses in Logic and Computer Science.


The highly successful fifth edition of the VCLA International Student Awards was concluded in July 2020. The awardees of the 2020 edition of the VCLA International Student Awards are:




Karolina Okrasa (Poland Warsaw University of Technology) 

Thesis: Complexity of variants of graph homomorphism problem in selected graph classes 

Under the supervision of Paweł Rzążewski





Antonin Callard (France ENS Paris-Saclay) 

Thesis: Topological analysis of represented spaces and computable maps, cb0 spaces and non-countably-based spaces

Under the supervision of Mathieu Hoyrup






The annually awarded VCLA Awards are dedicated to the memory of Helmut Veith, the brilliant computer scientist who tragically passed away in March 2016, and aim to carry on his commitment to promoting young talent and promising researchers in these areas. The awardees receive: 

• Outstanding Master Thesis Award:  1200 EUR

• Outstanding Undergraduate Research (Bachelor) Award:  800 EUR

• The awardees will be invited to present their work at an award ceremony (TBA due to COVID -19)





The nominated theses had to be awarded between 15 November 2018 and 31 December 2019. The 2021 call will be issued in January 2021, for theses awarded between 15 November 2019 and 31 December 2020: http://www.vcla.at/vcla-awards  





*Martín Muñoz (Pontificia Universidad Católica de Chile): Descriptive Complexity for Counting Complexity Classes

*Alexej Rotar (TU München): The Satisfiability Problem for Fragments of PCTL 

*Tomáš Lamser (Masaryk University): Algorithmic Analysis of Patrolling Games

*Jeremy Liang An Kong (Imperial College London): MCMAS-Dynamic: Symbolic Model Checking Linear Dynamic Logic

*Felix Dörre (Karlsruhe Institute of Technology): Verification of Random Number Generators

*Valeria Vignudelli (University of Bologna): The Discriminating Power of Higher-Order Languages: A Process Algebraic Approach

*Maximilian Schleich (Oxford University): Learning Regression Models over Factorised Joins

*Pablo Muñoz (University of Chile): New Complexity Bounds for Evaluating CRPQs with Path Comparisons

*Kuldeep S. Meel (Rice University): Sampling Techniques for Boolean Satisfiability

*Luke Schaeffer (University of Waterloo): Deciding Properties of Automatic Sequences

*Sophie Spirkl (University of Bonn): Boolean Circuit Optimization





*Shqiponja Ahmetaj

*Ezio Bartocci

*Ekaterina Fokina

*Robert Ganian, co-chair

*Benjamin Kiesl

*Martin Lackner

*Bjoern Lellmann

*Anna Lukina

*Laura Nenzi

*Johannes Oetsch

*Magdalena Ortiz, chair

*Revantha Ramanayake, co-chair

*Zeynep G. Saribatur

*Mantas Simkus

*Sebastian Skritek

*Friedrich Slivovsky

*Max Tschaikowski

*Johannes P. Wallner

More information about the Proof-Complexity mailing list