Alexander S. Kulikov
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
33
Venues
13
Active years
2005–2026
Best venue rank
A*
Where they publish
Papers
33 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | STACS | Conditional Complexity Hardness: Monotone Circuit Size, Matrix Rigidity, and Tensor Rank. | Nikolai Chukhin, Alexander S. Kulikov, Ivan Mihajlin, Arina Smirnova |
| 2026 | STACS | Smaller Circuits for Bit Addition. | Mikhail Goncharov, Alexander S. Kulikov, Georgie Levtsov |
| 2025 | AAAI | 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 |
| 2025 | STACS | Toward Better Depth Lower Bounds: Strong Composition of XOR and a Random Function. | Nikolai Chukhin, Alexander S. Kulikov, Ivan Mihajlin |
| 2024 | ESA | Improved Space Bounds for Subset Sum. | Tatiana Belova, Nikolai Chukhin, Alexander S. Kulikov, Ivan Mihajlin |
| 2024 | SODA | 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 |
| 2023 | SODA | Polynomial formulations as a barrier for reduction-based hardness proofs. | Tatiana Belova, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Denil Sharipov |
| 2022 | MFCS | CNF Encodings of Parity. | Gregory Emdin, Alexander S. Kulikov, Ivan Mihajlin, Nikita Slezkin |
| 2022 | MFCS | SAT-Based Circuit Local Improvement. | Alexander S. Kulikov, Danila Pechenev, Nikita Slezkin |
| 2021 | ESA | Minimum Common String Partition: Exact Algorithms. | Marek Cygan, Alexander S. Kulikov, Ivan Mihajlin, Maksim Nikolaev, Grigory Reznikov |
| 2019 | ISAAC | Complexity of Linear Operators. | Alexander S. Kulikov, Ivan Mikhailin, Andrey Mokhov, Vladimir V. Podolskii |
| 2018 | CSR | Lower Bounds for Unrestricted Boolean Circuits: Open Problems. | Alexander S. Kulikov |
| 2018 | DATE | Improving circuit size upper bounds using SAT-solvers. | Alexander S. Kulikov |
| 2017 | STACS | Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates. | Alexander S. Kulikov, Vladimir V. Podolskii |
| 2016 | FOCS | 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 |
| 2016 | MFCS | On the Limits of Gate Elimination. | Alexander Golovnev, Edward A. Hirsch, Alexander Knop, Alexander S. Kulikov |
| 2016 | MFCS | Circuit Size Lower Bounds and #SAT Upper Bounds Through a General Framework. | Alexander Golovnev, Alexander S. Kulikov, Alexander V. Smal, Suguru Tamaki |
| 2016 | SODA | Tight Bounds for Graph Homomorphism and Subgraph Isomorphism. | Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala |
| 2015 | CPM | Parameterized Complexity of Superstring Problems. | Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh |
| 2015 | CPM | Greedy Conjecture for Strings of Length 4. | Alexander S. Kulikov, Sergey Savinov, Evgeniy Sluzhaev |
| 2015 | ICALP | Lower Bounds for the Graph Homomorphism Problem. | Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin |
| 2014 | ICALP | Families with Infants: A General Approach to Solve Hard Partition Problems. | Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin |
| 2013 | CPM | Approximating Shortest Superstring Problem Using de Bruijn Graphs. | Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin |
| 2013 | MFCS | Solving 3-Superstring in 3 n/3 Time. | Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin |
| 2012 | CiE | 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 |
| 2012 | CSR | Computing All MOD-Functions Simultaneously. | Evgeny Demenkov, Alexander S. Kulikov, Ivan Mihajlin, Hiroki Morizumi |
| 2011 | MFCS | An Elementary Proof of a 3n - o(n) Lower Bound on the Circuit Complexity of Affine Dispersers. | Evgeny Demenkov, Alexander S. Kulikov |
| 2010 | CiE | Circuit Complexity and Multiplicative Complexity of Boolean Functions. | Arist Kojevnikov, Alexander S. Kulikov |
| 2009 | SAT | Finding Efficient Circuits Using SAT-Solvers. | Arist Kojevnikov, Alexander S. Kulikov, Grigory Yaroslavtsev |
| 2007 | CSR | New Bounds for MAX-SAT by Clause Learning. | Alexander S. Kulikov, Konstantin Kutzkov |
| 2006 | SODA | A new approach to proving upper bounds for MAX-2-SAT. | Arist Kojevnikov, Alexander S. Kulikov |
| 2006 | SAT | Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. | Arist Kojevnikov, Alexander S. Kulikov |
| 2005 | SAT | Automated Generation of Simplification Rules for SAT and MAXSAT. | Alexander S. Kulikov |