<html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns:m="http://schemas.microsoft.com/office/2004/12/omml" xmlns="http://www.w3.org/TR/REC-html40"><head><meta http-equiv=Content-Type content="text/html; charset=utf-8"><meta name=Generator content="Microsoft Word 15 (filtered medium)"><style><!--
/* Font Definitions */
@font-face
{font-family:"Cambria Math";
panose-1:2 4 5 3 5 4 6 3 2 4;}
@font-face
{font-family:Calibri;
panose-1:2 15 5 2 2 2 4 3 2 4;}
/* Style Definitions */
p.MsoNormal, li.MsoNormal, div.MsoNormal
{margin:0cm;
margin-bottom:.0001pt;
font-size:11.0pt;
font-family:"Calibri",sans-serif;
mso-fareast-language:EN-US;}
a:link, span.MsoHyperlink
{mso-style-priority:99;
color:#0563C1;
text-decoration:underline;}
a:visited, span.MsoHyperlinkFollowed
{mso-style-priority:99;
color:#954F72;
text-decoration:underline;}
p.msonormal0, li.msonormal0, div.msonormal0
{mso-style-name:msonormal;
mso-margin-top-alt:auto;
margin-right:0cm;
mso-margin-bottom-alt:auto;
margin-left:0cm;
font-size:11.0pt;
font-family:"Calibri",sans-serif;}
span.EmailStyle18
{mso-style-type:personal;
font-family:"Calibri",sans-serif;
color:windowtext;}
span.EmailStyle19
{mso-style-type:personal-reply;
font-family:"Calibri",sans-serif;
color:windowtext;}
.MsoChpDefault
{mso-style-type:export-only;
font-size:10.0pt;}
@page WordSection1
{size:612.0pt 792.0pt;
margin:70.85pt 70.85pt 2.0cm 70.85pt;}
div.WordSection1
{page:WordSection1;}
--></style><!--[if gte mso 9]><xml>
<o:shapedefaults v:ext="edit" spidmax="1026" />
</xml><![endif]--><!--[if gte mso 9]><xml>
<o:shapelayout v:ext="edit">
<o:idmap v:ext="edit" data="1" />
</o:shapelayout></xml><![endif]--></head><body link="#0563C1" vlink="#954F72"><div class=WordSection1><p class=MsoNormal style='margin-left:36.0pt;text-indent:36.0pt'><span lang=EN-GB style='font-size:12.0pt'>The Vienna Center for Logic and Algorithms of TU Wien (VCLA) <o:p></o:p></span></p><p class=MsoNormal style='margin-left:72.0pt'><span lang=EN-GB style='font-size:12.0pt'>has the pleasure to announce <o:p></o:p></span></p><p class=MsoNormal style='margin-left:72.0pt'><span lang=EN-GB style='font-size:12.0pt'>the recipients of the VCLA International Student Awards for Outstanding Master and Undergraduate Theses in Logic and Computer Science.<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'><o:p> </o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>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:<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'><o:p> </o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>***OUTSTANDING MASTER THESIS AWARD***<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'><o:p> </o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>Karolina Okrasa (Poland Warsaw University of Technology) <o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>Thesis: Complexity of variants of graph homomorphism problem in selected graph classes <o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>Under the supervision of Paweł Rzążewski<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'><a href="http://www.vcla.at/2020/07/fifth-edition-of-the-vcla-international-student-awards-2020/">http://www.vcla.at/2020/07/fifth-edition-of-the-vcla-international-student-awards-2020/</a> <o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'><o:p> </o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>***OUTSTANDING UNDERGRADUATE RESEARCH AWARD***<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'><o:p> </o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>Antonin Callard (France ENS Paris-Saclay) <o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>Thesis: Topological analysis of represented spaces and computable maps, cb0 spaces and non-countably-based spaces<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>Under the supervision of Mathieu Hoyrup<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'><a href="http://www.vcla.at/2020/07/fifth-edition-of-the-vcla-international-student-awards-2020/">http://www.vcla.at/2020/07/fifth-edition-of-the-vcla-international-student-awards-2020/</a> <o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'><o:p> </o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>=============<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>AWARDS<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>=============<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>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: <o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>• Outstanding Master Thesis Award: 1200 EUR<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>• Outstanding Undergraduate Research (Bachelor) Award: 800 EUR<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>• The awardees will be invited to present their work at an award ceremony (TBA due to COVID -19)<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'><o:p> </o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>===================<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>(SELF-)NOMINATIONS <o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>===================<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>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: <a href="http://www.vcla.at/vcla-awards">http://www.vcla.at/vcla-awards</a> <o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'><o:p> </o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>===================<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>FORMER AWARDEES<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>===================<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Martín Muñoz (Pontificia Universidad Católica de Chile): Descriptive Complexity for Counting Complexity Classes<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Alexej Rotar (TU München): The Satisfiability Problem for Fragments of PCTL <o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Tomáš Lamser (Masaryk University): Algorithmic Analysis of Patrolling Games<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Jeremy Liang An Kong (Imperial College London): MCMAS-Dynamic: Symbolic Model Checking Linear Dynamic Logic<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Felix Dörre (Karlsruhe Institute of Technology): Verification of Random Number Generators<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Valeria Vignudelli (University of Bologna): The Discriminating Power of Higher-Order Languages: A Process Algebraic Approach<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Maximilian Schleich (Oxford University): Learning Regression Models over Factorised Joins<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Pablo Muñoz (University of Chile): New Complexity Bounds for Evaluating CRPQs with Path Comparisons<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Kuldeep S. Meel (Rice University): Sampling Techniques for Boolean Satisfiability<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Luke Schaeffer (University of Waterloo): Deciding Properties of Automatic Sequences<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Sophie Spirkl (University of Bonn): Boolean Circuit Optimization<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'><o:p> </o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>===========================<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>VCLA AWARD COMMITTEE 2020<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>===========================<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Shqiponja Ahmetaj<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Ezio Bartocci<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Ekaterina Fokina<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Robert Ganian, co-chair<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Benjamin Kiesl<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Martin Lackner<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Bjoern Lellmann<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Anna Lukina<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Laura Nenzi<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Johannes Oetsch<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Magdalena Ortiz, chair<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Revantha Ramanayake, co-chair<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Zeynep G. Saribatur<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Mantas Simkus<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Sebastian Skritek<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Friedrich Slivovsky<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Max Tschaikowski<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='font-size:12.0pt'>*Johannes P. Wallner</span><span lang=EN-GB><o:p></o:p></span></p></div></body></html>