Research
 Primary research area: computational complexity with a focus on the complexity of the Boolean satisfiability
problem. Selected publications.
Teaching
 Undergraduate and graduate courses on theory of computation, the design and analysis of algorithms, discrete mathematics, databases, information
retrieval. Spring 2014.
Education and Experience
 Ph.D. in Mathematics from
Steklov Institute of
Mathematics, Russia.
 M.S. in Mathematics from
St. Petersburg State University, Russia.
I joined Department of
Computer Science of
Roosevelt University in
2001. My previous experience includes work in IT industry and
academic positions in:
Laboratory of
Mathematical Logic,
Steklov Institute of
Mathematics, St. Petersburg, Russia, 19932001;
Computing Science
Department,
Uppsala University, Sweden,
19961999;
School of
Computer Science,
The University of
Manchester, England, 19992001.
