Alexander Kulikov
Computer Science

Alexander Kulikov

Current position
Senior research fellow in Laboratory of Mathematical Logic of St. Petersburg Department of Steklov Institute of Mathematics
Skills
Algorithms
Computer Science
Teaching
LaTeX
Programming
C++

Social

THE COURSES

  • Data structures and algorithms
  • Basics of Algorithms and Data Structures

Summary

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

Computer Science Center: coordinator and lecturer
Yandex
April 2011 – Present | St. Petersburg, Russia

Researcher
Steklov Institute of Mathematics at St. Petersburg
October 2009 – Present | St. Petersburg, Russia

Lecturer
Academic University
2008 – Present

Coordinator and Lecturer
Computer Science Club
September 2007 – Present | St. Petersburg, Russia

Researcher
Algorithmic Biology Lab
January 2011 – December 2012 | St. Petersburg, Russia

Software Engineer
Transas Technologies
September 2005 – February 2007

Senior Software Engineer
St.Petersburg Department of Steklov Institute of Mathematics
September 2004 – September 2005

Education

St.Petersburg Department of Steklov Institute of Mathematics
PhD, Computer Science
2005 – 2008

St.Petersburg State University, Department of Mathematics and Mechanics
MSc, Mathematics
2000 – 2005

Honors & Awards

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

Recent PUBLICATIONS

  • 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 2016.

FAQ
Request free information about Harbour.Space
1 minute to complete and fast response time

Thank you!
We call soon
Keep an eye out for an activation email in your inbox. Once you’ve followed the link in our email.
Done