Alexander Golovnev

St. Petersburg University of the Russian Academy of Sciences, St. Petersburg, Russia

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

None

Papers31 papers

Sort

By YearBy Citation

The information-theoretic value of unlabeled data in semi-supervised learning

Alexander Golovnev,Dávid Pál, Balázs Szörényi

International Conference on Machine Learning, (2019): 2328-2336

Cited by2EIBibtex

String Matching - Communication, Circuits, and Learning

Alexander Golovnev,Mika Göös,Daniel Reichman,Igor Shinkar

APPROX-RANDOM, (2019)

EIBibtex

On the computational complexity of the probabilistic label tree algorithms

Róbert Busa-Fekete,Krzysztof Dembczynski,Alexander Golovnev, Kalina Jasinska, Mikhail Kuznetsov, Maxim Sviridenko, Chao Xu

arXiv: Learning, (2019)

EIBibtex

Fine-grained hardness of CVP(P)--- Everything that we can prove (and nothing else)

Aggarwal Divesh,Bennett Huck,Golovnev Alexander,Stephens-Davidowitz Noah

Bibtex

AC0[p] Lower Bounds against MCSP via the Coin Problem

Alexander Golovnev, Rahul Ilango,Russell Impagliazzo,Valentine Kabanets,Antonina Kolokolova,Avishay Tal

Electronic Colloquium on Computational Complexity (ECCC), (2019): 18

EIBibtex

Collapsing Superstring Conjecture

Alexander Golovnev,Alexander S. Kulikov, Alexander Logunov,Ivan Mihajlin

APPROX-RANDOM, (2019)

EIBibtex

Non-Uniform and Learning Algorithms for String Matching Problems

Alexander Golovnev,Daniel Reichman,Igor Shinkar

arXiv: Computational Complexity, (2018)

Bibtex

Circuit Depth Reductions

Alexander Golovnev,Alexander S. Kulikov

Electronic Colloquium on Computational Complexity (ECCC), (2018)

EIBibtex

Static Data Structure Lower Bounds Imply Rigidity

Zeev Dvir,Alexander Golovnev,Omri Weinstein

Electronic Colloquium on Computational Complexity (ECCC), (2018)

Cited by13EIBibtex

Gate elimination: Circuit size lower bounds and #SAT upper bounds

Alexander Golovnev,Alexander S. Kulikov,Alexander V. Smal,Suguru Tamaki

Theor. Comput. Sci., (2018): 46-63

Cited by1EIBibtex

On the Limits of Gate Elimination

Alexander Golovnev,Edward A. Hirsch,Alexander Knop,Alexander S. Kulikov

J. Comput. Syst. Sci., (2018): 107-119

Cited by5EIBibtex

On the Quantitative Hardness of CVP

Huck Bennett,Alexander Golovnev,Noah Stephens-Davidowitz

FOCS, (2017): 13-24

Cited by15EIBibtex

The Minrank of Random Graphs

Alexander Golovnev,Oded Regev,Omri Weinstein

IEEE Transactions on Information Theory, no. 11 (2017): 6990-6995

Cited by13EIWOSBibtex

Gate Elimination: Circuit Size Lower Bounds and #SAT Upper Bounds ☆

Alexander Golovnev,Alexander Golovnev,Alexander S. Kulikov,Alexander V. Smal,Suguru Tamaki

Theoretical Computer Science, (2017): 46-63

Bibtex

Tight Lower Bounds on Graph Embedding Problems

Marek Cygan,Fedor V. Fomin,Alexander Golovnev,Alexander S. Kulikov,Ivan Mihajlin,Jakub W. Pachocki,Arkadiusz Socala

Journal of the ACM (JACM), no. 3 (2017)

Cited by14EIBibtex

Detecting Patterns Can Be Hard: Circuit Lower Bounds for the String Matching Problem

Alexander Golovnev,Daniel Reichman,Igor Shinkar

arXiv: Computational Complexity, (2017)

EIBibtex

Weighted Gate Elimination: Boolean Dispersers for Quadratic Varieties Imply Improved Circuit Lower Bounds

Alexander Golovnev,Alexander S. Kulikov

Electronic Colloquium on Computational Complexity (ECCC), (2016): 405-411

Cited by8EIBibtex

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

FOCS, pp.89-98, (2016)

Cited by5EIBibtex

Circuit size lower bounds and #SAT upper bounds through a general framework

Alexander Golovnev,Alexander S. Kulikov,Alexander Smal,Suguru Tamaki

Electronic Colloquium on Computational Complexity (ECCC), (2016)

Cited by9EIBibtex

Families with infants: speeding up algorithms for NP-hard problems using FFT

Alexander Golovnev,Alexander S. Kulikov,Ivan Mihajlin

ACM Transactions on Algorithms (TALG), no. 3 (2016)

Cited by1EIBibtex

View All

Base Info Papers Patents Projects