Ivan Mihajlin
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
17
Venues
9
Active years
2012–2026
Best venue rank
A*
Where they publish
Papers
17 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 |
| 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 | ISAAC | Super-Cubic Lower Bound for Generalized Karchmer-Wigderson Games. | Artur Ignatiev, Ivan Mihajlin, Alexander Smal |
| 2022 | MFCS | CNF Encodings of Parity. | Gregory Emdin, Alexander S. Kulikov, Ivan Mihajlin, Nikita Slezkin |
| 2021 | ESA | Minimum Common String Partition: Exact Algorithms. | Marek Cygan, Alexander S. Kulikov, Ivan Mihajlin, Maksim Nikolaev, Grigory Reznikov |
| 2020 | ICALP | Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. | Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi |
| 2018 | ISAAC | Half-Duplex Communication Complexity. | Kenneth Hoover, Russell Impagliazzo, Ivan Mihajlin, Alexander V. Smal |
| 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 | 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 |