Dipl.-Ing. Katalin Fazekas

This page is no longer maintained, the current webpage can be found at http://kfazekas.github.io.

From November 2015 until my defense in July 2020, I was a Ph.D. student of Computer Science at JKU, supervised by Prof. Armin Biere, participating in the Austrian doctoral program Logical Methods in Computer Science (LogiCS) funded by FWF. My master thesis was about proofs in the context of SMT solving, and I continue to work on SAT, SMT, QBF and related problems.

Publications

A list of my publications can be found here: Publications

Some of my talk slides:

Incremental Inprocessing in SAT Solving, SAT 2019, Lisbon, Portugal
Ranking Robustness under Sub-Sampling for the SAT Competition 2018, SAT 2019, Lisbon, Portugal
Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories, 9th International Joint Conference on Automated Reasoning (IJCAR), 2018, Oxford
Skolem Function Continuation for Quantified Boolean Formulas, 11th International Conference on Tests & Proofs (TAP), Marburg, Germany
A Duality-Aware Calculus for Quantified Boolean Formulas, 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) 2016, Timisoara, Romania

Office

Science Park 3 (SCP3), 2nd Floor
Room S3 0257

Contact

katalin.fazekas@jku.at
https://fmv.jku.at/fazekas

Address

Institute for Formal Models and Verification
Johannes Kepler University
Altenbergerstr. 69
4040 Linz
Austria