Alexander S. Kulikov

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

email: alexander.s.kulikov@gmail.com

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
Evgeny Demenkov, Alexander S. Kulikov, Olga Melanich, Ivan Mihajlin. New Lower Bounds on Circuit Size of Multi-output Functions.
ToCS 2015.
pdf DOI
Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin. Lower Bounds for the Graph Homomorphism Problem.
ICALP 2015.
pdf DOI arXiv
Alexander S. Kulikov, Sergey Savinov, Evgeniy Sluzhaev. Greedy Conjecture for Strings of Length 4.
CPM 2015.
pdf DOI