Alexander S. Kulikov

senior research fellow in Laboratory of Mathematical Logic of
St. Petersburg Department of Steklov Institute of Mathematics


I graduated from St. Petersburg State University in 2005 and received my Ph.D. from St. Petersburg Department of Steklov Mathematical Institute in 2009 under the supervision of Edward A. Hirsch. My main research interests are algorithms for NP-hard problems and circuit complexity, most of my publications are in these fields. I'm running the Computer Science club and Computer Science center that provide students of St. Petersburg with advanced computer science lectures. I teach courses and run seminars on algorithms and circuit complexity and from time to time organize computer science conferences and student schools in Russia.



Recent publications

Draft DOI Preprint
Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh. Parameterized Complexity of Superstring Problems.
Algorithmica 2016.
pdf DOI arXiv
Magnus Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov. A Better-than-3n Lower Bound for the Circuit Complexity of an Explicit Function.
FOCS 2016.
Alexander Golovnev, Edward A. Hirsch, Alexander Knop, Alexander S. Kulikov. On the Limits of Gate Elimination.
MFCS 2016.