Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms. - Sergey S. Fedin; Alexander S. Kulikov (IWPEC, 2004)

Automated Generation of Simplification Rules for SAT and MAXSAT. - Alexander S. Kulikov (SAT, 2005)

Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. - Arist Kojevnikov; Alexander S. Kulikov (SAT, 2006)

A new approach to proving upper bounds for MAX-2-SAT. - Arist Kojevnikov; Alexander S. Kulikov (SODA, 2006)

New Bounds for MAX-SAT by Clause Learning. - Alexander S. Kulikov; Konstantin Kutzkov (CSR, 2007)

Finding Efficient Circuits Using SAT-Solvers. - Arist Kojevnikov; Alexander S. Kulikov; Grigory Yaroslavtsev (SAT, 2009)

On covering graphs by complete bipartite subgraphs. - Stasys Jukna; Alexander S. Kulikov (Discret. Math., 2009)

Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. - Edward A. Hirsch; Arist Kojevnikov; Alexander S. Kulikov; Sergey I. Nikolenko (J. Satisf. Boolean Model. Comput., 2009)

Circuit Complexity and Multiplicative Complexity of Boolean Functions. - Arist Kojevnikov; Alexander S. Kulikov (CiE, 2010)

Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes) - Prahladh Harsha; Moses Charikar; Matthew Andrews; Sanjeev Arora; Subhash Khot; Dana Moshkovitz; Lisa Zhang; Ashkan Aazami; Dev Desai; Igor Gorodezky; Geetha Jagannathan; Alexander S. Kulikov; et al. (CoRR, 2010)

New upper bounds on the Boolean circuit complexity of symmetric functions. - Evgeny Demenkov; Arist Kojevnikov; Alexander S. Kulikov; Grigory Yaroslavtsev (Inf. Process. Lett., 2010)

On convex complexity measures. - Pavel Hrubes; Stasys Jukna; Alexander S. Kulikov; Pavel Pudlák (Theor. Comput. Sci., 2010)

An Elementary Proof of 3n-o(n) Lower Bound on the Circuit Complexity of Affine Dispersers. - Evgeny Demenkov; Alexander S. Kulikov (Electron. Colloquium Comput. Complex., 2011)

A 5n - o(n) Lower Bound on the Circuit Size over U 2 of a Linear Boolean Function. - Alexander S. Kulikov; Olga Melanich; Ivan Mihajlin (CiE, 2012)

Computing All MOD-Functions Simultaneously. - Evgeny Demenkov; Alexander S. Kulikov; Ivan Mihajlin; Hiroki Morizumi (CSR, 2012)

SPAdes: A New Genome Assembly Algorithm and Its Applications to Single-Cell Sequencing. - Anton Bankevich; Sergey Nurk; Dmitry Antipov; Alexey A. Gurevich; Mikhail Dvorkin; Alexander S. Kulikov; Valery M. Lesin; Sergey I. Nikolenko; Son K. Pham; Andrey D. Prjibelski; Alex Pyshkin; Alexander Sirotkin 001; et al. (J. Comput. Biol., 2012)

Approximating Shortest Superstring Problem Using de Bruijn Graphs. - Alexander Golovnev; Alexander S. Kulikov; Ivan Mihajlin (CPM, 2013)

Solving 3-Superstring in 3 n/3 Time. - Alexander Golovnev; Alexander S. Kulikov; Ivan Mihajlin (MFCS, 2013)

Families with Infants: A General Approach to Solve Hard Partition Problems. - Alexander Golovnev; Alexander S. Kulikov; Ivan Mihajlin (ICALP (1), 2014)

Solving SCS for bounded length strings in fewer than 2n steps. - Alexander Golovnev; Alexander S. Kulikov; Ivan Mihajlin (Inf. Process. Lett., 2014)

Greedy Conjecture for Strings of Length 4. - Alexander S. Kulikov; Sergey Savinov; Evgeniy Sluzhaev (CPM, 2015)

Lower Bounds for the Graph Homomorphism Problem. - Fedor V. Fomin; Alexander Golovnev; Alexander S. Kulikov; Ivan Mihajlin (ICALP (1), 2015)

Tight Bounds for Subgraph Isomorphism and Graph Homomorphism. - Fedor V. Fomin; Alexander Golovnev; Alexander S. Kulikov; Ivan Mihajlin (CoRR, 2015)

A better-than-3n lower bound for the circuit complexity of an explicit function. - Magnus Gausdal Find; Alexander Golovnev; Edward A. Hirsch; Alexander S. Kulikov (Electron. Colloquium Comput. Complex., 2015)

Weighted gate elimination: Boolean dispersers for quadratic varieties imply improved circuit lower bounds. - Alexander Golovnev; Alexander S. Kulikov (Electron. Colloquium Comput. Complex., 2015)

New Lower Bounds on Circuit Size of Multi-output Functions. - Evgeny Demenkov; Alexander S. Kulikov; Olga Melanich; Ivan Mihajlin (Theory Comput. Syst., 2015)

Tight Bounds for Graph Homomorphism and Subgraph Isomorphism. - Marek Cygan; Fedor V. Fomin; Alexander Golovnev; Alexander S. Kulikov; Ivan Mihajlin; Jakub Pachocki; Arkadiusz Socala (SODA, 2016)

Circuit size lower bounds and #SAT upper bounds through a general framework. - Alexander Golovnev; Alexander S. Kulikov; Alexander Smal; Suguru Tamaki (Electron. Colloquium Comput. Complex., 2016)

Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates. - Alexander S. Kulikov; Vladimir V. Podolskii (Electron. Colloquium Comput. Complex., 2016)

Families with Infants: Speeding Up Algorithms for NP-Hard Problems Using FFT. - Alexander Golovnev; Alexander S. Kulikov; Ivan Mihajlin (ACM Trans. Algorithms, 2016)

Parameterized Complexity of Superstring Problems. - Ivan Bliznets; Fedor V. Fomin; Petr A. Golovach; Nikolay Karpov; Alexander S. Kulikov; Saket Saurabh 001 (Algorithmica, 2017)

Tight Lower Bounds on Graph Embedding Problems. - Marek Cygan; Fedor V. Fomin; Alexander Golovnev; Alexander S. Kulikov; Ivan Mihajlin; Jakub Pachocki; Arkadiusz Socala (J. ACM, 2017)

Parameterized Complexity of Secluded Connectivity Problems. - Fedor V. Fomin; Petr A. Golovach; Nikolay Karpov; Alexander S. Kulikov (Theory Comput. Syst., 2017)

Lower Bounds for Unrestricted Boolean Circuits: Open Problems. - Alexander S. Kulikov (CSR, 2018)

Improving circuit size upper bounds using SAT-solvers. - Alexander S. Kulikov (DATE, 2018)

Collapsing Superstring Conjecture. - Alexander Golovnev; Alexander S. Kulikov; Alexander Logunov; Ivan Mihajlin (CoRR, 2018)

Circuit Depth Reductions. - Alexander Golovnev; Alexander S. Kulikov (Electron. Colloquium Comput. Complex., 2018)

On the limits of gate elimination. - Alexander Golovnev; Edward A. Hirsch; Alexander Knop; Alexander S. Kulikov (J. Comput. Syst. Sci., 2018)

Preface to the Special Issue on Computer Science in Russia 2016. - Alexander S. Kulikov; Gerhard J. Woeginger (Theory Comput. Syst., 2018)

Gate elimination: Circuit size lower bounds and #SAT upper bounds. - Alexander Golovnev; Alexander S. Kulikov; Alexander V. Smal; Suguru Tamaki (Theor. Comput. Sci., 2018)

Collapsing Superstring Conjecture. - Alexander Golovnev; Alexander S. Kulikov; Alexander Logunov; Ivan Mihajlin; Maksim Nikolaev (APPROX-RANDOM, 2019)

Complexity of Linear Operators. - Alexander S. Kulikov; Ivan Mikhailin; Andrey Mokhov; Vladimir V. Podolskii (Electron. Colloquium Comput. Complex., 2019)

Minimum Common String Partition: Exact Algorithms. - Marek Cygan; Alexander S. Kulikov; Ivan Mihajlin; Maksim Nikolaev; Grigory Reznikov (ESA, 2021)

Circuit Depth Reductions. - Alexander Golovnev; Alexander S. Kulikov; R. Ryan Williams (ITCS, 2021)

SAT-based Circuit Local Improvement. - Alexander S. Kulikov; Nikita Slezkin (Electron. Colloquium Comput. Complex., 2021)

CNF Encodings of Parity. - Gregory Emdin; Alexander S. Kulikov; Ivan Mihajlin; Nikita Slezkin (MFCS, 2022)

SAT-Based Circuit Local Improvement. - Alexander S. Kulikov; Danila Pechenev; Nikita Slezkin (MFCS, 2022)

Polynomial formulations as a barrier for reduction-based hardness proofs. - Alexander S. Kulikov; Ivan Mihajlin (CoRR, 2022)

Polynomial formulations as a barrier for reduction-based hardness proofs. - Tatiana Belova; Alexander Golovnev; Alexander S. Kulikov; Ivan Mihajlin; Denil Sharipov (SODA, 2023)

Improving 3N Circuit Complexity Lower Bounds. - Magnus Gausdal Find; Alexander Golovnev; Edward A. Hirsch; Alexander S. Kulikov (Comput. Complex., 2023)

Improved Space Bounds for Subset Sum. - Tatiana Belova; Nikolai Chukhin; Alexander S. Kulikov; Ivan Mihajlin (ESA, 2024)

Computations with polynomial evaluation oracle: ruling out superlinear SETH-based lower bounds. - Tatiana Belova; Alexander S. Kulikov; Ivan Mihajlin; Olga Ratseeva; Grigory Reznikov; Denil Sharipov (SODA, 2024)

If Edge Coloring is Hard under SETH, then SETH is False. - Alexander S. Kulikov; Ivan Mihajlin (SOSA, 2024)

Deriving Nonuniform Lower Bounds from Uniform Nondeterministic Lower Bounds. - Nikolai Chukhin; Alexander S. Kulikov; Ivan Mihajlin; Arina Smirnova (CoRR, 2024)

CNF Encodings of Symmetric Functions. - Gregory Emdin; Alexander S. Kulikov; Ivan Mihajlin; Nikita Slezkin (Theory Comput. Syst., 2024)

Cirbo: A New Tool for Boolean Circuit Analysis and Synthesis. - Daniil Averkov; Tatiana Belova; Gregory Emdin; Mikhail Goncharov; Viktoriia Krivogornitsyna; Alexander S. Kulikov; Fedor Kurmazov; Daniil Levtsov; Georgie Levtsov; Vsevolod Vaskin; Aleksey Vorobiev (AAAI, 2025)

Toward Better Depth Lower Bounds: Strong Composition of XOR and a Random Function. - Nikolai Chukhin; Alexander S. Kulikov; Ivan Mihajlin (STACS, 2025)

Conditional Complexity Hardness: Monotone Circuit Size, Matrix Rigidity, and Tensor Rank Under NSETH and Beyond. - Nikolai Chukhin; Alexander S. Kulikov; Ivan Mihajlin; Arina Smirnova (Electron. Colloquium Comput. Complex., 2025)

Simplifier: A New Tool for Boolean Circuit Simplification. - Daniil Averkov; Gregory Emdin; Viktoriia Krivogornitsyna; Alexander S. Kulikov; Fedor Kurmazov; Alexander Smal; Vsevolod Vaskin (CoRR, 2025)

New Challenges in Combinatorial Optimization. - Bo Chen 002; Alexander S. Kulikov; Silvano Martello (J. Comb. Optim., 2025)