Computer Science

Alexander Kulikov

Senior Research Fellow, St. Petersburg Department of Steklov Institute of Mathematics

Faculty Profile

Alexander graduated from St. Petersburg State University in 2005 and received Ph.D. from St. Petersburg Department of Steklov Mathematical Institute in 2009 under the supervision of Edward A. Hirsch. His main research interests are algorithms for NP-hard problems and circuit complexity, most of his publications are in these fields.

Alexander is running the Computer Science club and Computer Science center that provide students of St. Petersburg with advanced computer science lectures. He teaches courses and run seminars on algorithms and circuit complexity and from time to time organize computer science conferences and student schools in Russia.

Alexander is on the authors and teachers for Coursera specialization on Data Structures and Algorithms

Experience

April 2011 – Present
Computer Science Center: coordinator and lecturer
Yandex
October 2009 – Present
Researcher
Steklov Institute of Mathematics at St. Petersburg
2008 – Present
Lecturer
Academic University
September 2007 – Present
Coordinator and Lecturer
Computer Science Club
January 2011 – December 2012
Researcher
Algorithmic Biology Lab
September 2005 – February 2007
Software Engineer
Transas Technologies
September 2004 – September 2005
Senior Software Engineer
St.Petersburg Department of Steklov Institute of Mathematics

Education

2005 – 2008
PhD, Computer Science
St.Petersburg Department of Steklov Institute of Mathematics
2000 – 2005
MSc, Mathematics
St.Petersburg State University, Department of Mathematics and Mechanics

Honors & Awards

Euler Award, The Government of St. Petersburg, May 2012
Scopus Award Russia, Elsevier, April 2015

Publications

2016
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, Alexander S. Kulikov, Ivan Mihajlin. Families with Infants: Speeding Up Algorithms for NP-Hard Problems Using FFT
ACM Transactions on Algorithms
2016
Alexander Golovnev, Alexander S. Kulikov. Weighted Gate Elimination: Boolean Dispersers for Quadratic Varieties Imply Improved Circuit Lower Bounds
ITCS

Courses by Alexander

Maths as a Second Language

Basics of Algorithms and Data Structures

28 Nov - 16 Dec 2016

Barcelona

the university of the future

We believe the future is bright if you make it so.

Explore Harbour.Space

Faq