Hi, I'm Tomáš Peitl, a computer scientist and postdoc at TU Wien, Austria. Before, 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, supervised by Professor Stefan Szeider.

My research interests revolve 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:

• SAT Modulo Symmetries (SMS) for graph generation modulo isomorphisms;
• our QBF solver Qute;
• my PhD thesis;
• or a list of my publications or DBLP.

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

Some of my other spaces:

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.