Ivan Mihajlin

About Ivan Mihajlin

Ivan Mihajlin, With an exceptional h-index of 9 and a recent h-index of 7 (since 2020), a distinguished researcher at University of California, San Diego,

His recent articles reflect a diverse array of research interests and contributions to the field:

CNF Encodings of Symmetric Functions

Improved Space Bounds for Subset Sum

If Edge Coloring is Hard under SETH, then SETH is False

Computations with polynomial evaluation oracle: ruling out superlinear SETH-based lower bounds

Polynomial formulations as a barrier for reduction-based hardness proofs

Super-cubic lower bound for generalized karchmer-wigderson games

A better-than-3log (n) depth lower bound for De Morgan formulas with restrictions on top gates

Computation of hadwiger number and related contraction problems: Tight lower bounds

Ivan Mihajlin Information

University

Position

___

Citations(all)

341

Citations(since 2020)

196

Cited By

223

hIndex(all)

9

hIndex(since 2020)

7

i10Index(all)

9

i10Index(since 2020)

4

Email

University Profile Page

Google Scholar

Top articles of Ivan Mihajlin

CNF Encodings of Symmetric Functions

Theory of Computing Systems

2024/3/26

Ivan Mihajlin
Ivan Mihajlin

H-Index: 6

Improved Space Bounds for Subset Sum

arXiv preprint arXiv:2402.13170

2024/2/20

Ivan Mihajlin
Ivan Mihajlin

H-Index: 6

If Edge Coloring is Hard under SETH, then SETH is False

2024

Ivan Mihajlin
Ivan Mihajlin

H-Index: 6

Computations with polynomial evaluation oracle: ruling out superlinear SETH-based lower bounds

2024

Ivan Mihajlin
Ivan Mihajlin

H-Index: 6

Polynomial formulations as a barrier for reduction-based hardness proofs

2023

Ivan Mihajlin
Ivan Mihajlin

H-Index: 6

Super-cubic lower bound for generalized karchmer-wigderson games

2022

Ivan Mihajlin
Ivan Mihajlin

H-Index: 6

A better-than-3log (n) depth lower bound for De Morgan formulas with restrictions on top gates

2022

Ivan Mihajlin
Ivan Mihajlin

H-Index: 6

Computation of hadwiger number and related contraction problems: Tight lower bounds

ACM Transactions on Computation Theory (TOCT)

2021/3/26

Daniel Lokshtanov
Daniel Lokshtanov

H-Index: 36

Ivan Mihajlin
Ivan Mihajlin

H-Index: 6

Minimum common string partition: Exact algorithms

2021

Marek Cygan
Marek Cygan

H-Index: 25

Ivan Mihajlin
Ivan Mihajlin

H-Index: 6

Toward better depth lower bounds: The XOR-KRW conjecture

2021

Ivan Mihajlin
Ivan Mihajlin

H-Index: 6

See List of Professors in Ivan Mihajlin University(University of California, San Diego)

Co-Authors

academic-engine