default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander S. Kulikov
Person information
- affiliation: JetBrains Research Inc.
- affiliation: Steklov Mathematical Institute, St. Petersburg, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j17]Gregory Emdin, Alexander S. Kulikov, Ivan Mihajlin, Nikita Slezkin:
CNF Encodings of Symmetric Functions. Theory Comput. Syst. 68(5): 1291-1311 (2024)- [c35]Tatiana Belova, Nikolai Chukhin, Alexander S. Kulikov, Ivan Mihajlin:
Improved Space Bounds for Subset Sum. ESA 2024: 21:1-21:17 - [c34]Tatiana Belova
, Alexander S. Kulikov, Ivan Mihajlin, Olga Ratseeva, Grigory Reznikov, Denil Sharipov:
Computations with polynomial evaluation oracle: ruling out superlinear SETH-based lower bounds. SODA 2024: 1834-1853 - [c33]Alexander S. Kulikov, Ivan Mihajlin:
If Edge Coloring is Hard under SETH, then SETH is False. SOSA 2024: 115-120 - [i28]Tatiana Belova, Nikolai Chukhin, Alexander S. Kulikov, Ivan Mihajlin:
Improved Space Bounds for Subset Sum. CoRR abs/2402.13170 (2024) - [i27]Nikolai Chukhin, Alexander S. Kulikov, Ivan Mikhajlin:
Toward Better Depth Lower Bounds: Strong Composition of XOR and a Random Function. CoRR abs/2410.10189 (2024) - 2023
- [j16]Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov:
Improving 3N Circuit Complexity Lower Bounds. Comput. Complex. 32(2): 13 (2023) - [c32]Tatiana Belova, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Denil Sharipov:
Polynomial formulations as a barrier for reduction-based hardness proofs. SODA 2023: 3245-3281 - [i26]Tatiana Belova, Alexander S. Kulikov, Ivan Mihajlin, Olga Ratseeva, Grigory Reznikov, Denil Sharipov:
Computations with polynomial evaluation oracle: ruling out superlinear SETH-based lower bounds. CoRR abs/2307.11444 (2023) - 2022
- [c31]Gregory Emdin, Alexander S. Kulikov, Ivan Mihajlin, Nikita Slezkin:
CNF Encodings of Parity. MFCS 2022: 47:1-47:12 - [c30]Alexander S. Kulikov, Danila Pechenev, Nikita Slezkin:
SAT-Based Circuit Local Improvement. MFCS 2022: 67:1-67:15 - [e5]Alexander S. Kulikov, Sofya Raskhodnikova:
Computer Science - Theory and Applications - 17th International Computer Science Symposium in Russia, CSR 2022, Virtual Event, June 29 - July 1, 2022, Proceedings. Lecture Notes in Computer Science 13296, Springer 2022, ISBN 978-3-031-09573-3 [contents] - [i25]Gregory Emdin, Alexander S. Kulikov, Ivan Mihajlin, Nikita Slezkin:
CNF Encodings of Parity. CoRR abs/2203.01082 (2022) - [i24]Alexander S. Kulikov, Ivan Mihajlin:
Polynomial formulations as a barrier for reduction-based hardness proofs. CoRR abs/2205.07709 (2022) - 2021
- [c29]Marek Cygan, Alexander S. Kulikov, Ivan Mihajlin, Maksim Nikolaev, Grigory Reznikov:
Minimum Common String Partition: Exact Algorithms. ESA 2021: 35:1-35:16 - [c28]Alexander Golovnev, Alexander S. Kulikov, R. Ryan Williams:
Circuit Depth Reductions. ITCS 2021: 24:1-24:20 - [i23]Alexander S. Kulikov, Nikita Slezkin:
SAT-based Circuit Local Improvement. CoRR abs/2102.12579 (2021) - [i22]Alexander S. Kulikov, Nikita Slezkin:
SAT-based Circuit Local Improvement. Electron. Colloquium Comput. Complex. TR21 (2021)
2010 – 2019
- 2019
- [j15]Alexander S. Kulikov, Vladimir V. Podolskii:
Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates. Theory Comput. Syst. 63(5): 956-986 (2019) - [c27]Alexander Golovnev, Alexander S. Kulikov, Alexander Logunov, Ivan Mihajlin, Maksim Nikolaev:
Collapsing Superstring Conjecture. APPROX-RANDOM 2019: 26:1-26:23 - [c26]Alexander S. Kulikov, Ivan Mikhailin, Andrey Mokhov, Vladimir V. Podolskii:
Complexity of Linear Operators. ISAAC 2019: 17:1-17:12 - [i21]Alexander S. Kulikov, Ivan Mikhailin, Andrey Mokhov, Vladimir V. Podolskii:
Complexity of Linear Operators. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j14]Alexander Golovnev, Edward A. Hirsch, Alexander Knop, Alexander S. Kulikov:
On the limits of gate elimination. J. Comput. Syst. Sci. 96: 107-119 (2018) - [j13]Alexander S. Kulikov, Gerhard J. Woeginger:
Preface to the Special Issue on Computer Science in Russia 2016. Theory Comput. Syst. 62(3): 465-466 (2018) - [j12]Alexander Golovnev, Alexander S. Kulikov, Alexander V. Smal, Suguru Tamaki:
Gate elimination: Circuit size lower bounds and #SAT upper bounds. Theor. Comput. Sci. 719: 46-63 (2018) - [c25]Alexander S. Kulikov:
Lower Bounds for Unrestricted Boolean Circuits: Open Problems. CSR 2018: 15-22 - [c24]Alexander S. Kulikov:
Improving circuit size upper bounds using SAT-solvers. DATE 2018: 305-308 - [i20]Alexander Golovnev, Alexander S. Kulikov, Alexander Logunov, Ivan Mihajlin:
Collapsing Superstring Conjecture. CoRR abs/1809.08669 (2018) - [i19]Alexander Golovnev, Alexander S. Kulikov:
Circuit Depth Reductions. CoRR abs/1811.04828 (2018) - [i18]Alexander S. Kulikov, Ivan Mikhailin, Andrey Mokhov, Vladimir V. Podolskii:
Complexity of Linear Operators. CoRR abs/1812.11772 (2018) - [i17]Alexander Golovnev, Alexander S. Kulikov:
Circuit Depth Reductions. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j11]Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh:
Parameterized Complexity of Superstring Problems. Algorithmica 79(3): 798-813 (2017) - [j10]Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala:
Tight Lower Bounds on Graph Embedding Problems. J. ACM 64(3): 18:1-18:22 (2017) - [j9]Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov:
Parameterized Complexity of Secluded Connectivity Problems. Theory Comput. Syst. 61(3): 795-819 (2017) - [c23]Alexander S. Kulikov, Vladimir V. Podolskii:
Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates. STACS 2017: 49:1-49:14 - 2016
- [j8]Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Families with Infants: Speeding Up Algorithms for NP-Hard Problems Using FFT. ACM Trans. Algorithms 12(3): 35:1-35:17 (2016) - [c22]Magnus Gausdal 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: 89-98 - [c21]Alexander Golovnev, Alexander S. Kulikov:
Weighted Gate Elimination: Boolean Dispersers for Quadratic Varieties Imply Improved Circuit Lower Bounds. ITCS 2016: 405-411 - [c20]Alexander Golovnev, Alexander S. Kulikov, Alexander V. Smal, Suguru Tamaki:
Circuit Size Lower Bounds and #SAT Upper Bounds Through a General Framework. MFCS 2016: 45:1-45:16 - [c19]Alexander Golovnev, Edward A. Hirsch, Alexander Knop, Alexander S. Kulikov:
On the Limits of Gate Elimination. MFCS 2016: 46:1-46:13 - [c18]Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala:
Tight Bounds for Graph Homomorphism and Subgraph Isomorphism. SODA 2016: 1643-1649 - [e4]Alexander S. Kulikov, Gerhard J. Woeginger:
Computer Science - Theory and Applications - 11th International Computer Science Symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9-13, 2016, Proceedings. Lecture Notes in Computer Science 9691, Springer 2016, ISBN 978-3-319-34170-5 [contents] - [e3]Andrew V. Goldberg, Alexander S. Kulikov:
Experimental Algorithms - 15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016, Proceedings. Lecture Notes in Computer Science 9685, Springer 2016, ISBN 978-3-319-38850-2 [contents] - [i16]Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala:
Tight Lower Bounds on Graph Embedding Problems. CoRR abs/1602.05016 (2016) - [i15]Alexander S. Kulikov, Vladimir V. Podolskii:
Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates. CoRR abs/1610.02686 (2016) - [i14]Alexander Golovnev, Edward A. Hirsch, Alexander Knop, Alexander S. Kulikov:
On the Limits of Gate Elimination. Electron. Colloquium Comput. Complex. TR16 (2016) - [i13]Alexander Golovnev, Alexander S. Kulikov, Alexander Smal, Suguru Tamaki:
Circuit size lower bounds and #SAT upper bounds through a general framework. Electron. Colloquium Comput. Complex. TR16 (2016) - [i12]Alexander S. Kulikov, Vladimir V. Podolskii:
Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j7]Evgeny Demenkov, Alexander S. Kulikov, Olga Melanich, Ivan Mihajlin:
New Lower Bounds on Circuit Size of Multi-output Functions. Theory Comput. Syst. 56(4): 630-642 (2015) - [c17]Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh:
Parameterized Complexity of Superstring Problems. CPM 2015: 89-99 - [c16]Alexander S. Kulikov, Sergey Savinov, Evgeniy Sluzhaev:
Greedy Conjecture for Strings of Length 4. CPM 2015: 307-315 - [c15]Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov:
Parameterized Complexity of Secluded Connectivity Problems. FSTTCS 2015: 408-419 - [c14]Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Lower Bounds for the Graph Homomorphism Problem. ICALP (1) 2015: 481-493 - [i11]Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh:
Parameterized Complexity of Superstring Problems. CoRR abs/1502.01461 (2015) - [i10]Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov:
Parameterized Complexity of Secluded Connectivity Problems. CoRR abs/1502.03989 (2015) - [i9]Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Lower Bounds for the Graph Homomorphism Problem. CoRR abs/1502.05447 (2015) - [i8]Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Tight Bounds for Subgraph Isomorphism and Graph Homomorphism. CoRR abs/1507.03738 (2015) - [i7]Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov:
A better-than-3n lower bound for the circuit complexity of an explicit function. Electron. Colloquium Comput. Complex. TR15 (2015) - [i6]Alexander Golovnev, Alexander S. Kulikov:
Weighted gate elimination: Boolean dispersers for quadratic varieties imply improved circuit lower bounds. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j6]Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Solving SCS for bounded length strings in fewer than 2n steps. Inf. Process. Lett. 114(8): 421-425 (2014) - [c13]Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Families with Infants: A General Approach to Solve Hard Partition Problems. ICALP (1) 2014: 551-562 - [e2]Alexander S. Kulikov, Sergei O. Kuznetsov, Pavel A. Pevzner:
Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings. Lecture Notes in Computer Science 8486, Springer 2014, ISBN 978-3-319-07565-5 [contents] - [i5]Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Families with infants: speeding up algorithms for NP-hard problems using FFT. CoRR abs/1410.2209 (2014) - 2013
- [c12]Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Approximating Shortest Superstring Problem Using de Bruijn Graphs. CPM 2013: 120-129 - [c11]Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Solving 3-Superstring in 3 n/3 Time. MFCS 2013: 480-491 - [i4]Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Families with infants: a general approach to solve hard partition problems. CoRR abs/1311.2456 (2013) - 2012
- [j5]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, Nikolay Vyahhi, Glenn Tesler, Max A. Alekseyev, Pavel A. Pevzner:
SPAdes: A New Genome Assembly Algorithm and Its Applications to Single-Cell Sequencing. J. Comput. Biol. 19(5): 455-477 (2012) - [c10]Alexander S. Kulikov, Olga Melanich, Ivan Mihajlin:
A 5n - o(n) Lower Bound on the Circuit Size over U 2 of a Linear Boolean Function. CiE 2012: 432-439 - [c9]Evgeny Demenkov, Alexander S. Kulikov, Ivan Mihajlin, Hiroki Morizumi:
Computing All MOD-Functions Simultaneously. CSR 2012: 81-88 - 2011
- [c8]Evgeny Demenkov, Alexander S. Kulikov:
An Elementary Proof of a 3n - o(n) Lower Bound on the Circuit Complexity of Affine Dispersers. MFCS 2011: 256-265 - [e1]Alexander S. Kulikov, Nikolay K. Vereshchagin:
Computer Science - Theory and Applications - 6th International Computer Science Symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14-18, 2011. Proceedings. Lecture Notes in Computer Science 6651, Springer 2011, ISBN 978-3-642-20711-2 [contents] - [i3]Evgeny Demenkov, Alexander S. Kulikov:
An Elementary Proof of 3n-o(n) Lower Bound on the Circuit Complexity of Affine Dispersers. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j4]Evgeny Demenkov, Arist Kojevnikov, Alexander S. Kulikov, Grigory Yaroslavtsev:
New upper bounds on the Boolean circuit complexity of symmetric functions. Inf. Process. Lett. 110(7): 264-267 (2010) - [j3]Pavel Hrubes, Stasys Jukna, Alexander S. Kulikov, Pavel Pudlák:
On convex complexity measures. Theor. Comput. Sci. 411(16-18): 1842-1854 (2010) - [c7]Arist Kojevnikov, Alexander S. Kulikov:
Circuit Complexity and Multiplicative Complexity of Boolean Functions. CiE 2010: 239-245 - [i2]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, Darakhshan J. Mir, Alantha Newman, Aleksandar Nikolov, David Pritchard, Gwen Spencer:
Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes). CoRR abs/1002.3864 (2010)
2000 – 2009
- 2009
- [j2]Stasys Jukna, Alexander S. Kulikov:
On covering graphs by complete bipartite subgraphs. Discret. Math. 309(10): 3399-3403 (2009) - [j1]Edward A. Hirsch, Arist Kojevnikov, Alexander S. Kulikov, Sergey I. Nikolenko:
Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. J. Satisf. Boolean Model. Comput. 6(1-3): 53-69 (2009) - [c6]Arist Kojevnikov, Alexander S. Kulikov, Grigory Yaroslavtsev:
Finding Efficient Circuits Using SAT-Solvers. SAT 2009: 32-44 - [i1]Pavel Hrubes, Stasys Jukna, Alexander S. Kulikov, Pavel Pudlák:
On convex complexity measures. Electron. Colloquium Comput. Complex. TR09 (2009) - 2007
- [c5]Alexander S. Kulikov, Konstantin Kutzkov:
New Bounds for MAX-SAT by Clause Learning. CSR 2007: 194-204 - 2006
- [c4]Arist Kojevnikov, Alexander S. Kulikov:
Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. SAT 2006: 11-21 - [c3]Arist Kojevnikov, Alexander S. Kulikov:
A new approach to proving upper bounds for MAX-2-SAT. SODA 2006: 11-17 - 2005
- [c2]Alexander S. Kulikov:
Automated Generation of Simplification Rules for SAT and MAXSAT. SAT 2005: 430-436 - 2004
- [c1]Sergey S. Fedin, Alexander S. Kulikov:
Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms. IWPEC 2004: 248-259
Coauthor Index
Ivan Mihajlin
aka: Ivan Mikhajlin
aka: Ivan Mikhajlin
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-26 21:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
