Skip to content

Alexander Golovnev

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

30

Venues

11

Active years

2013–2026

Best venue rank

A*

Where they publish

Papers

30 indexed papers, newest first.

YearVenueTitleAuthors
2026ICALPImproved Time-Space Tradeoffs for 3SUM-Indexing.Itai Dinur, Alexander Golovnev
2026SODAOnline Orthogonal Vectors Revisited.Karthik Gajulapalli, Alexander Golovnev, Samuel King, Sidhant Saraogi
2024SODAQuantum Worst-Case to Average-Case Reductions for All Linear Problems.Vahid R. Asadi, Alexander Golovnev, Tom Gur, Igor Shinkar, Sathyawageeswar Subramanian
2023CRYPTORevisiting Time-Space Tradeoffs for Function Inversion.Alexander Golovnev, Siyao Guo, Spencer Peters, Noah Stephens-Davidowitz
2023CRYPTOBrakedown: Linear-Time and Field-Agnostic SNARKs for R1CS.Alexander Golovnev, Jonathan Lee, Srinath T. V. Setty, Justin Thaler, Riad S. Wahby
2023SODAPolynomial formulations as a barrier for reduction-based hardness proofs.Tatiana Belova, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Denil Sharipov
2023STOCLattice Problems beyond Polynomial Time.Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan
2022STOCWorst-case to average-case reductions via additive combinatorics.Vahid R. Asadi, Alexander Golovnev, Tom Gur, Igor Shinkar
2022STOCLinear space streaming lower bounds for approximating CSPs.Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Ameya Velingker, Santhoshini Velusamy
2021FOCSApproximability of all finite CSPs with linear sketches.Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy
2021SODAFine-grained hardness of CVP(P) - Everything that we can prove (and nothing else).Divesh Aggarwal, Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz
2020FCBreaking the Encryption Scheme of the Moscow Internet Voting System.Pierrick Gaudry, Alexander Golovnev
2020FOCSOptimal Streaming Approximations for all Boolean Max-2CSPs and Max-ksat.Chi-Ning Chou, Alexander Golovnev, Santhoshini Velusamy
2020FOCSPolynomial Data Structure Lower Bounds in the Group Model.Alexander Golovnev, Gleb Posobin, Oded Regev, Omri Weinstein
2020STOCData structures meet cryptography: 3SUM with preprocessing.Alexander Golovnev, Siyao Guo, Thibaut Horel, Sunoo Park, Vinod Vaikuntanathan
2019ICALPACAlexander Golovnev, Rahul Ilango, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Avishay Tal
2019ICMLThe information-theoretic value of unlabeled data in semi-supervised learning.Alexander Golovnev, Dvid Pl, Balzs Szrnyi
2019STOCStatic data structure lower bounds imply rigidity.Zeev Dvir, Alexander Golovnev, Omri Weinstein
2017FOCSOn the Quantitative Hardness of CVP.Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz
2016FOCSA Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function.Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov
2016MFCSOn the Limits of Gate Elimination.Alexander Golovnev, Edward A. Hirsch, Alexander Knop, Alexander S. Kulikov
2016MFCSCircuit Size Lower Bounds and #SAT Upper Bounds Through a General Framework.Alexander Golovnev, Alexander S. Kulikov, Alexander V. Smal, Suguru Tamaki
2016SODATight Bounds for Graph Homomorphism and Subgraph Isomorphism.Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala
2015EuroCryptA Formal Treatment of Backdoored Pseudorandom Generators.Yevgeniy Dodis, Chaya Ganesh, Alexander Golovnev, Ari Juels, Thomas Ristenpart
2015ICALPLower Bounds for the Graph Homomorphism Problem.Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin
2015ICALPCondensed Unpredictability.Maciej Skorski, Alexander Golovnev, Krzysztof Pietrzak
2015ITWA note on lower bounds for non-interactive message authentication using weak keys.Divesh Aggarwal, Alexander Golovnev
2014ICALPFamilies with Infants: A General Approach to Solve Hard Partition Problems.Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin
2013CPMApproximating Shortest Superstring Problem Using de Bruijn Graphs.Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin
2013MFCSSolving 3-Superstring in 3 n/3 Time.Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin