Alexander Golovnev 个人学术档案

引用次数

	总计	2019 年至今
引用	830	631
h 指数	16	14
i10 指数	26	16

180

135

2013201420152016201720182019202020212022202320243 7 29 53 45 57 62 81 94 120 161 110

开放获取的出版物数量

查看全部

22 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Alexander S. KulikovSteklov Institute of Mathematics at St. Petersburg在 logic.pdmi.ras.ru 的电子邮件经过验证
Ivan MihajlinUCSD在 eng.ucsd.edu 的电子邮件经过验证
Chi-Ning ChouFlatiron Institute在 flatironinstitute.org 的电子邮件经过验证
Santhoshini VelusamyToyota Technological Institute at Chicago在 ttic.edu 的电子邮件经过验证
Madhu SudanGordon McKay Professor of Computer Science, Harvard University在 cs.harvard.edu 的电子邮件经过验证
Noah Stephens-DavidowitzCornell University在 cornell.edu 的电子邮件经过验证
Fedor V. FominProfessor of Computer Science, University of Bergen在 uib.no 的电子邮件经过验证
Huck BennettUniversity of Colorado Boulder在 colorado.edu 的电子邮件经过验证
Siyao GUONYU Shanghai在 nyu.edu 的电子邮件经过验证
Justin ThalerGeorgetown University在 georgetown.edu 的电子邮件经过验证
Srinath SettyPrincipal Researcher at Microsoft Research在 microsoft.com 的电子邮件经过验证
Riad S. WahbyCarnegie Mellon University在 cmu.edu 的电子邮件经过验证
Divesh AggarwalNUS在 nus.edu.sg 的电子邮件经过验证
Vinod VaikuntanathanProfessor of Computer Science, Massachusetts Institute of Technology在 csail.mit.edu 的电子邮件经过验证
Marek CyganUniversity of Warsaw在 mimuw.edu.pl 的电子邮件经过验证
Arkadiusz SocałaUniversity of Warsaw在 mimuw.edu.pl 的电子邮件经过验证
Igor ShinkarSimon Fraser University在 sfu.ca 的电子邮件经过验证
Edward A. HirschProfessor of Computer Science at Ariel University在 ariel.ac.il 的电子邮件经过验证
Thomas RistenpartProfessor of Computer Science, Cornell Tech在 cornell.edu 的电子邮件经过验证
Yevgeniy DodisProfessor, New York University在 cs.nyu.edu 的电子邮件经过验证

关注

Alexander Golovnev

Georgetown University

在 cims.nyu.edu 的电子邮件经过验证 - 首页

Computational Complexity Algorithms Circuit Complexity Cryptography


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
A formal treatment of backdoored pseudorandom generators Y Dodis, C Ganesh, A Golovnev, A Juels, T Ristenpart Eurocrypt 2015, 101-126, 2015	101	2015
Brakedown: Linear-Time and Field-Agnostic SNARKs for R1CS A Golovnev, J Lee, S Setty, J Thaler, RS Wahby CRYPTO 2023, 193-226, 2023	84*	2023
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	61*	2017
On the quantitative hardness of CVP H Bennett, A Golovnev, N Stephens-Davidowitz FOCS 2017, 13-24, 2017	41	2017
Breaking the encryption scheme of the Moscow internet voting system P Gaudry, A Golovnev FC 2020, 2020	34	2020
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	34	2019
Static data structure lower bounds imply rigidity Z Dvir, A Golovnev, O Weinstein STOC 2019, 967-978, 2019	33	2019
Optimal streaming approximations for all Boolean Max-2CSPs and Max-kSAT CN Chou, A Golovnev, S Velusamy FOCS 2020, 330-341, 2020	31	2020
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	29	2021
The minrank of random graphs A Golovnev, O Regev, O Weinstein IEEE Transactions on Information Theory (ToIT) 64 (11), 6990-6995, 2018	28	2018
3SUM with preprocessing: algorithms, lower bounds and cryptographic applications A Golovnev, S Guo, T Horel, S Park, V Vaikuntanathan STOC 2020, 2020	27*	2020
Approximating shortest superstring problem using de Bruijn graphs A Golovnev, AS Kulikov, I Mihajlin CPM 2013, 120-129, 2013	25	2013
A new algorithm for parameterized MAX-SAT I Bliznets, A Golovnev IPEC 2012, 37-48, 2012	21	2012
Linear space streaming lower bounds for approximating CSPs CN Chou, A Golovnev, M Sudan, A Velingker, S Velusamy STOC 2022, 275-288, 2022	18	2022
Weighted gate elimination: Boolean dispersers for quadratic varieties imply improved circuit lower bounds A Golovnev, AS Kulikov ITCS 2016, 405-411, 2016	17	2016
Approximability of all finite CSPs with linear sketches CN Chou, A Golovnev, M Sudan, S Velusamy FOCS 2021, 1197-1208, 2022	16	2022
Circuit depth reductions A Golovnev, AS Kulikov, RR Williams ITCS 2021, 2018	16	2018
Circuit size lower bounds and #SAT upper bounds through a general framework A Golovnev, AS Kulikov, AV Smal, S Tamaki MFCS 2016, 2016	15*	2016
On the limits of gate elimination A Golovnev, EA Hirsch, A Knop, AS Kulikov Journal of Computer and System Sciences (JCSS) 96, 107-119, 2018	14	2018
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	14	2014

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用