All PhD theses and some of the MSc theses are available through ECCC portal.

- PhD. students:

S.Cavagnetto (Propositional proof complexity and rewriting, 2008),

M.Garlik (Model constructions for bounded arithmetic, 2015),

A.Gaysin (Proof complexity of CSP, in progress),

J.Hanika (Search problems and bounded arithmetic, 2004),

E.Jerabek (Weak pigeonhole principle, and randomized computation, 2005),

O.Jezil (in progress),

S.Muller (On the power of weak extensions of V^0, 2013),

M.Narusevych (in progress),

J.Pich, (Complexity theory in feasible mathematics, 2014).

- MSc. students:

T.Auer (Complexity of propositional proofs in resolution, 2001),

D.Bouska (Limits of classes of finite structures in model theory, 2019),

S.Carnoky (Search problems and search for collisions in hash functions, 2011),

K.Dvorackova (Is P equal to NP over the reals with order?, 2004),

J.Henzl (Weak formal systems, 2004),

K.Hostakova (The BSS model and cryptography, 2016),

O.Jezil (Pseudofinite structures and limits, 2022),

T.Jirotka (NP search problems, 2011),

J.Kolar (Witnessing existential statements - in Czech, 2021),

E.Krejcova (Algebraic proof systems, 2009),

J.Marikova ( Geometric properties of definable sets, 2003),

O.Mikle-Barat (Strong proof systems, 2007),

M.Narusevych (Models of bounded arithmetic, 2022)

P.Patak (Definability in mathematical structures, 2010)

J.Pich (Hard tautologies, 2011)

F.Polach (Propositional logic and algebra, 2008),

P.Sanda (Implicit propositional proofs, 2006),

R.Sevcikova (NP search problems and reductions among them, 2012),

V.Wagner (Logic and cryptography, 2015).