Hi, I'm Tomáš Peitl, a computer scientist, currently a postdoc at TU Wien, Austria. Until Oct 2021, I was a postdoc at Friedrich Schiller University in Jena, Germany. I received my PhD (Dr.techn.) with honours (Promotio sub auspiciis Praesidentis rei publicae) from TU Wien, Austria under the supervision of Professor Stefan Szeider.

My research interests are centered around Boolean Satisfiability (SAT), in particular its quantified versions (QBF, DQBF), and include theory, proof complexity, algorithms, solver development, and applications, in particular to combinatorial search.

You might be looking for:

• my PhD thesis,
• our QBF solver Qute,
• my publications: see my DBLP and TU Wien pages (links below).

Other tools that I find useful:

• QBF solvers: DepQBF, (R)AReQS,(C)Qesto, Qfun, CAQE, QuAbS, Cadet
• DQBF solvers: DQBDD, Pedant, HQS
• SAT solvers: Kissat, CaDiCaL, CryptoMiniSAT, Glucose
• Discrete modelling and optimization: PySAT, PySMT and MiniZinc

Click on these if you're looking for my publications, etc.

I have the obvious email address associated with this domain (PGP key).

As an exercise to try out MathJax, I wrote this.

A chessboard is here.