Edward A. Hirsch: Students and PhD Theses

Yaroslav Alekseev (current).

Nikita Gaevoy (current).
 Dmitry Itsykson (PhD 2009)  Lower bounds and optimality issues for proof systems.

Alexander Knop (PhD 2017)  The complexity of heuristic computations and interactive protocols.

Arist Kojevnikov (PhD 2007)  The complexity of propositional proof systems operating with inequalities.

Alexander S. Kulikov (PhD 2009)  The construction of algorithms for Boolean logic using automatization, combined complexity measures and clause memorization.

Sergey I. Nikolenko (PhD 2009)  New constructions of cryptographic primitives based on semigroups, groups, and linear algebra.

Konstantin Pervyshev (PhD 2009)  Time hierarchies for heuristic classes, nonuniform classes, and cryptographic primitives,

Alexander Smal (PhD 2022)  Communicationcomplexity based lower bounds on the formula size of Boolean functions.

Dmitry Sokolov (joint with Dmitry Itsykson, PhD 2015)  The complexity of splittingbased SAT algorithms.