Invited Speakers

Marijn J.H. Heule, University of Texas at Austin, US

Bio: Marijn Heule is a Research Assistant Professor at the University of Texas at Austin and received his PhD at Delft University of Technology (2008). His contributions to SAT solving have enabled him and others to solve hard problems in formal verification and mathematics. He has developed award-winning SAT solvers and his preprocessing and proof producing techniques are used in many state-of-the-art solvers.

Rahul Santhanam, University of Oxford, UK

Bio: Rahul Santhanam is Professor of Computing Science at Oxford. He completed his PhD at the University of Chicago in 2005. After postdocs at Simon Fraser University and the University of Toronto, he was first Lecturer and then Reader in the School of Informatics at the University of Edinburgh. He moved to his present post in 2016. His main research interests are in computational complexity, proof complexity and exact algorithms for Satisfiability and other NP-complete problems.

Christoph Scholl, Albert-Ludwigs-University Freiburg, DE

Bio: Christoph Scholl received the Dipl.-Inform. and the Dr.-Ing. degrees in Computer Science from University of Saarland, Germany, in 1993 and 1997, respectively. In 2002 he received the venia legendi from University of Freiburg, Germany. In 2002/2003 he was an associate professor for computer engineering at the University of Heidelberg and in 2003 he joined the University of Freiburg as a professor in the Department of Computer Science. His research interests include logic synthesis, real-time operating systems, and the verification both of digital circuits and systems and of timed and hybrid systems. In this context a main focus of his work lies on the development of efficient symbolic data structures and algorithms as well as new solver techniques.