default search action
Ivan Mihajlin
Person information
- affiliation: University of California, San Diego, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Gregory Emdin, Alexander S. Kulikov, Ivan Mihajlin, Nikita Slezkin:
CNF Encodings of Symmetric Functions. Theory Comput. Syst. 68(5): 1291-1311 (2024) - [c21]Tatiana Belova, Nikolai Chukhin, Alexander S. Kulikov, Ivan Mihajlin:
Improved Space Bounds for Subset Sum. ESA 2024: 21:1-21:17 - [c20]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 - [c19]Alexander S. Kulikov, Ivan Mihajlin:
If Edge Coloring is Hard under SETH, then SETH is False. SOSA 2024: 115-120 - [i18]Tatiana Belova
Improved Space Bounds for Subset Sum. CoRR abs/2402.13170 (2024) - [i17]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
- [c18]Tatiana Belova
Polynomial formulations as a barrier for reduction-based hardness proofs. SODA 2023: 3245-3281 - [i16]Tatiana Belova
Computations with polynomial evaluation oracle: ruling out superlinear SETH-based lower bounds. CoRR abs/2307.11444 (2023) - 2022
- [c17]Ivan Mihajlin, Anastasia Sofronova:
A Better-Than-3log(n) Depth Lower Bound for De Morgan Formulas with Restrictions on Top Gates. CCC 2022: 13:1-13:15 - [c16]Artur Ignatiev, Ivan Mihajlin, Alexander Smal:
Super-Cubic Lower Bound for Generalized Karchmer-Wigderson Games. ISAAC 2022: 66:1-66:18 - [c15]Gregory Emdin, Alexander S. Kulikov
CNF Encodings of Parity. MFCS 2022: 47:1-47:12 - [i15]Gregory Emdin, Alexander S. Kulikov, Ivan Mihajlin, Nikita Slezkin:
CNF Encodings of Parity. CoRR abs/2203.01082 (2022) - [i14]Alexander S. Kulikov, Ivan Mihajlin:
Polynomial formulations as a barrier for reduction-based hardness proofs. CoRR abs/2205.07709 (2022) - [i13]Artur Ignatiev, Ivan Mihajlin, Alexander Smal:
Super-cubic lower bound for generalized Karchmer-Wigderson games. Electron. Colloquium Comput. Complex. TR22 (2022) - [i12]Ivan Mihajlin, Anastasia Sofronova:
A better-than-3logn depth lower bound for De Morgan formulas with restrictions on top gates. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j5]Fedor V. Fomin
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. ACM Trans. Comput. Theory 13(2): 10:1-10:25 (2021) - [c14]Ivan Mihajlin, Alexander Smal
Toward Better Depth Lower Bounds: The XOR-KRW Conjecture. CCC 2021: 38:1-38:24 - [c13]Marek Cygan, Alexander S. Kulikov, Ivan Mihajlin, Maksim Nikolaev
Minimum Common String Partition: Exact Algorithms. ESA 2021: 35:1-35:16 - 2020
- [c12]Fedor V. Fomin
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. ICALP 2020: 49:1-49:18 - [i11]Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi:
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. CoRR abs/2004.11621 (2020) - [i10]Ivan Mihajlin, Alexander Smal:
Toward better depth lower bounds: the XOR-KRW conjecture. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c11]Alexander Golovnev, Alexander S. Kulikov, Alexander Logunov, Ivan Mihajlin, Maksim Nikolaev
Collapsing Superstring Conjecture. APPROX-RANDOM 2019: 26:1-26:23 - 2018
- [c10]Marco L. Carmosino, Russell Impagliazzo
Hardness Amplification for Non-Commutative Arithmetic Circuits. CCC 2018: 12:1-12:16 - [c9]Kenneth Hoover, Russell Impagliazzo
Half-Duplex Communication Complexity. ISAAC 2018: 10:1-10:12 - [i9]Alexander Golovnev, Alexander S. Kulikov, Alexander Logunov, Ivan Mihajlin:
Collapsing Superstring Conjecture. CoRR abs/1809.08669 (2018) - [i8]Marco Carmosino, Russell Impagliazzo, Shachar Lovett, Ivan Mihajlin:
Hardness Amplification for Non-Commutative Arithmetic Circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - [i7]Kenneth Hoover, Russell Impagliazzo, Ivan Mihajlin, Alexander Smal:
Half-duplex communication complexity. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j4]Marek Cygan
Tight Lower Bounds on Graph Embedding Problems. J. ACM 64(3): 18:1-18:22 (2017) - 2016
- [j3]Alexander Golovnev, Alexander S. Kulikov
Families with Infants: Speeding Up Algorithms for NP-Hard Problems Using FFT. ACM Trans. Algorithms 12(3): 35:1-35:17 (2016) - [c8]Marco L. Carmosino, Jiawei Gao, Russell Impagliazzo
Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility. ITCS 2016: 261-270 - [c7]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 - [i6]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) - 2015
- [j2]Evgeny Demenkov, Alexander S. Kulikov
New Lower Bounds on Circuit Size of Multi-output Functions. Theory Comput. Syst. 56(4): 630-642 (2015) - [c6]Fedor V. Fomin
Lower Bounds for the Graph Homomorphism Problem. ICALP (1) 2015: 481-493 - [i5]Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Lower Bounds for the Graph Homomorphism Problem. CoRR abs/1502.05447 (2015) - [i4]Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Tight Bounds for Subgraph Isomorphism and Graph Homomorphism. CoRR abs/1507.03738 (2015) - [i3]Marco Carmosino, Jiawei Gao, Russell Impagliazzo, Ivan Mihajlin, Ramamohan Paturi, Stefan Schneider:
Nondeterministic extensions of the Strong Exponential Time Hypothesis and consequences for non-reducibility. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j1]Alexander Golovnev, Alexander S. Kulikov
Solving SCS for bounded length strings in fewer than 2n steps. Inf. Process. Lett. 114(8): 421-425 (2014) - [c5]Alexander Golovnev, Alexander S. Kulikov
Families with Infants: A General Approach to Solve Hard Partition Problems. ICALP (1) 2014: 551-562 - [i2]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
- [c4]Alexander Golovnev, Alexander S. Kulikov
Approximating Shortest Superstring Problem Using de Bruijn Graphs. CPM 2013: 120-129 - [c3]Alexander Golovnev, Alexander S. Kulikov
Solving 3-Superstring in 3 n/3 Time. MFCS 2013: 480-491 - [i1]Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Families with infants: a general approach to solve hard partition problems. CoRR abs/1311.2456 (2013) - 2012
- [c2]Alexander S. Kulikov
A 5n - o(n) Lower Bound on the Circuit Size over U 2 of a Linear Boolean Function. CiE 2012: 432-439 - [c1]Evgeny Demenkov, Alexander S. Kulikov
Computing All MOD-Functions Simultaneously. CSR 2012: 81-88
Coauthor Index
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:41 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: