Подписаться
Alexander Golovnev
Alexander Golovnev
Georgetown University
Подтвержден адрес электронной почты в домене cims.nyu.edu - Главная страница
Название
Процитировано
Процитировано
Год
A formal treatment of backdoored pseudorandom generators
Y Dodis, C Ganesh, A Golovnev, A Juels, T Ristenpart
Eurocrypt 2015, 101-126, 2015
772015
Tight bounds for graph homomorphism and subgraph isomorphism
M Cygan, FV Fomin, A Golovnev, AS Kulikov, I Mihajlin, J Pachocki, ...
Journal of the ACM (JACM) 64 (3), 1--22, 2017
44*2017
AC^ 0 [p] Lower Bounds Against MCSP via the Coin Problem
A Golovnev, R Ilango, R Impagliazzo, V Kabanets, A Kolokolova, A Tal
ICALP 2019, 2019
262019
Static data structure lower bounds imply rigidity
Z Dvir, A Golovnev, O Weinstein
STOC 2019, 967-978, 2019
262019
On the quantitative hardness of CVP
H Bennett, A Golovnev, N Stephens-Davidowitz
FOCS 2017, 13-24, 2017
252017
Breaking the encryption scheme of the Moscow internet voting system
P Gaudry, A Golovnev
FC 2020, 2020
242020
The minrank of random graphs
A Golovnev, O Regev, O Weinstein
IEEE Transactions on Information Theory (ToIT) 64 (11), 6990-6995, 2018
232018
Approximating shortest superstring problem using de Bruijn graphs
A Golovnev, AS Kulikov, I Mihajlin
CPM 2013, 120-129, 2013
212013
A new algorithm for parameterized MAX-SAT
I Bliznets, A Golovnev
IPEC 2012, 37-48, 2012
202012
Optimal streaming approximations for all Boolean Max-2CSPs and Max-kSAT
CN Chou, A Golovnev, S Velusamy
FOCS 2020, 330-341, 2020
162020
3SUM with preprocessing: algorithms, lower bounds and cryptographic applications
A Golovnev, S Guo, T Horel, S Park, V Vaikuntanathan
STOC 2020, 2020
15*2020
Circuit size lower bounds and #SAT upper bounds through a general framework
A Golovnev, AS Kulikov, AV Smal, S Tamaki
MFCS 2016, 2016
13*2016
New exact algorithms for the 2-constraint satisfaction problem
A Golovnev, K Kutzkov
Theoretical Computer Science (TCS) 526, 18-27, 2014
132014
Fine-grained hardness of CVP (P)—Everything that we can prove (and nothing else)
D Aggarwal, H Bennett, A Golovnev, N Stephens-Davidowitz
SODA 2021, 1816-1835, 2021
122021
Solving SCS for bounded length strings in fewer than 2n steps
A Golovnev, AS Kulikov, I Mihajlin
Information Processing Letters (IPL) 114 (8), 421-425, 2014
122014
Weighted gate elimination: Boolean dispersers for quadratic varieties imply improved circuit lower bounds
A Golovnev, AS Kulikov
ITCS 2016, 405-411, 2016
112016
Lower bounds for the graph homomorphism problem
FV Fomin, A Golovnev, AS Kulikov, I Mihajlin
ICALP 2015, 481-493, 2015
102015
Condensed unpredictability
M Skorski, A Golovnev, K Pietrzak
ICALP 2015, 1046-1057, 2015
92015
Solving 3-superstring in 3 n/3 time
A Golovnev, AS Kulikov, I Mihajlin
MFCS 2013, 480-491, 2013
92013
Approximability of all Boolean CSPs in the dynamic streaming setting
CN Chou, A Golovnev, M Sudan, S Velusamy
arXiv preprint arXiv:2102.12351, 2021
82021
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20