Alexander S. Kulikov is a research fellow at St. Petersburg Department of Steklov Mathematical Institute of the Russian Academy of Sciences and a visiting professor at University of California, San Diego. His scientific interests include algorithms for NP-hard problems and circuit complexity. In St. Petersburg, he runs Computer Science Club and Computer Science Center.


Number Theory and Cryptography

Learning Algorithms through Programming: Toolbox

Delivery Problem

Combinatorics and Probability

Algorithmic Toolbox

Advanced Algorithms and Complexity

Algorithms on Graphs

Introduction to Graph Theory

Data Structures

Algorithms on Strings

What is a Proof?

Genome Assembly Programming Challenge