×
Compute Distance To:
Author ID: lovett.shachar Recent zbMATH articles by "Lovett, Shachar"
Published as: Lovett, Shachar
Homepage: https://cseweb.ucsd.edu/~slovett/home.html
External Links: MGP · dblp

Publications by Year

Citations contained in zbMATH Open

73 Publications have been cited 365 times in 301 Documents Cited by Year
On cryptography with auxiliary input. Zbl 1304.94046
Dodis, Yevgeniy; Kalai, Yael Tauman; Lovett, Shachar
37
2009
Non-malleable codes from additive combinatorics (extended abstract). Zbl 1315.94142
Aggarwal, Divesh; Dodis, Yevgeniy; Lovett, Shachar
20
2014
Rectangles are nonnegative juntas. Zbl 1353.68130
Göös, Mika; Lovett, Shachar; Meka, Raghu; Watson, Thomas; Zuckerman, David
19
2016
Constructive discrepancy minimization by walking on the edges. Zbl 1330.68343
Lovett, Shachar; Meka, Raghu
19
2015
Subspace evasive sets. Zbl 1286.94109
Dvir, Zeev; Lovett, Shachar
14
2012
Nontrivial \(t\)-designs over finite fields exist for all \(t\). Zbl 1297.05046
Fazeli, Arman; Lovett, Shachar; Vardy, Alexander
13
2014
Structure of protocols for XOR functions. Zbl 1386.68062
Hatami, Hamed; Hosseini, Kaave; Lovett, Shachar
11
2018
Every locally characterized affine-invariant property is testable. Zbl 1293.11016
Bhattacharyya, Arnab; Fischer, Eldar; Hatami, Hamed; Hatami, Pooya; Lovett, Shachar
11
2013
Probabilistic existence of regular combinatorial structures. Zbl 1369.05024
Kuperberg, Greg; Lovett, Shachar; Peled, Ron
9
2017
Unconditional pseudorandom generators for low degree polynomials. Zbl 1213.68274
Lovett, Shachar
8
2009
The analytic rank of tensors and its applications. Zbl 1431.15017
Lovett, Shachar
8
2019
En route to the log-rank conjecture: new reductions and equivalent formulations. Zbl 1412.68064
Gavinsky, Dmitry; Lovett, Shachar
7
2014
Improved bounds for the sunflower lemma. Zbl 07298275
Alweiss, Ryan; Lovett, Shachar; Wu, Kewen; Zhang, Jiapeng
7
2020
Rectangles are nonnegative juntas. Zbl 1321.68313
Göös, Mika; Lovett, Shachar; Meka, Raghu; Watson, Thomas; Zuckerman, David
7
2015
Algebraic attacks against random local functions and their countermeasures. Zbl 1377.94027
Applebaum, Benny; Lovett, Shachar
7
2016
Probabilistic existence of rigid combinatorial structures. Zbl 1286.60027
Kuperberg, Greg; Lovett, Shachar; Peled, Ron
6
2012
Communication is bounded by root of rank. Zbl 1315.68155
Lovett, Shachar
6
2014
Weight distribution and List-decoding size of Reed-Muller codes. Zbl 1365.94517
Kaufman, Tali; Lovett, Shachar; Porat, Ely
6
2012
Algebraic attacks against random local functions and their countermeasures. Zbl 1417.94039
Applebaum, Benny; Lovett, Shachar
6
2018
New extension of the Weil bound for character sums with applications to coding. Zbl 1292.94177
Kaufman, Tali; Lovett, Shachar
6
2011
Near-optimal linear decision trees for k-SUM and related problems. Zbl 1428.68129
Kane, Daniel M.; Lovett, Shachar; Moran, Shay
5
2018
Correlation bounds for poly-size \(\mathrm{AC}^0\) circuits with \(n^{1 - o(1)}\) symmetric gates. Zbl 1343.68098
Lovett, Shachar; Srinivasan, Srikanth
5
2011
Equivalence of polynomial conjectures in additive combinatorics. Zbl 1274.11158
Lovett, Shachar
5
2012
Inverse conjecture for the Gowers norm is false. Zbl 1282.11009
Lovett, Shachar; Meshulam, Roy; Samorodnitsky, Alex
5
2011
General systems of linear forms: equidistribution and true complexity. Zbl 1336.11014
Hatami, Hamed; Hatami, Pooya; Lovett, Shachar
5
2016
Communication is bounded by root of rank. Zbl 1426.68132
Lovett, Shachar
5
2016
Pseudorandom bit generators that fool modular sums. Zbl 1255.68294
Lovett, Shachar; Reingold, Omer; Trevisan, Luca; Vadhan, Salil
5
2009
The Gram-Schmidt walk: a cure for the Banaszczyk blues. Zbl 1427.68328
Bansal, Nikhil; Dadush, Daniel; Garg, Shashwat; Lovett, Shachar
4
2018
Higher-order Fourier analysis of \(\mathbb F_p^n\) and the complexity of systems of linear forms. Zbl 1291.11026
Hatami, Hamed; Lovett, Shachar
4
2011
Inverse conjecture for the Gowers norm is false. Zbl 1225.11158
Lovett, Shachar; Meshulam, Roy; Samorodniotsky, Alex
4
2008
Bounded-depth circuits cannot sample good codes. Zbl 1282.68125
Lovett, Shachar; Viola, Emanuele
4
2012
Almost \(k\)-wise vs. \(k\)-wise independent permutations, and uniformity for general group actions. Zbl 1297.68183
Alon, Noga; Lovett, Shachar
4
2013
Pseudorandom generators from polarizing random walks. Zbl 1441.68149
Chattopadhyay, Eshan; Hatami, Pooya; Hosseini, Kaave; Lovett, Shachar
4
2018
New bounds for matching vector families. Zbl 1314.05204
Bhowmick, Abhishek; Dvir, Zeev; Lovett, Shachar
4
2014
Variety evasive sets. Zbl 1308.68166
Dvir, Zeev; Kollár, János; Lovett, Shachar
4
2014
The independence number of the Birkhoff polytope graph, and applications to maximally recoverable codes. Zbl 1419.05217
Kane, Daniel; Lovett, Shachar; Rao, Sankeerth
3
2019
The complexity of Boolean functions in different characteristics. Zbl 1213.68309
Gopalan, Parikshit; Lovett, Shachar; Shpilka, Amir
3
2010
A space lower bound for dynamic approximate membership data structures. Zbl 1285.68043
Lovett, Shachar; Porat, Ely
3
2013
Random low-degree polynomials are hard to approximate. Zbl 1280.68090
Ben-Eliezer, Ido; Hod, Rani; Lovett, Shachar
3
2012
Hardness amplification for non-commutative arithmetic circuits. Zbl 1441.68039
Carmosino, Marco L.; Impagliazzo, Russell; Lovett, Shachar; Mihajlin, Ivan
3
2018
An additive combinatorics approach relating rank to communication complexity. Zbl 1321.68271
Ben-Sasson, Eli; Lovett, Shachar; Ron-Zewi, Noga
3
2014
A tail bound for read-\(k\) families of functions. Zbl 1338.60082
Gavinsky, Dmitry; Lovett, Shachar; Saks, Michael; Srinivasan, Srikanth
3
2015
The Freiman-Ruzsa theorem over finite fields. Zbl 1302.11007
Even-Zohar, Chaim; Lovett, Shachar
3
2014
Non-malleable codes from additive combinatorics. Zbl 1401.94233
Aggarwal, Divesh; Dodis, Yevgeniy; Lovett, Shachar
3
2018
New bounds for matching vector families. Zbl 1293.90003
Bhowmick, Abhishek; Dvir, Zeev; Lovett, Shachar
3
2013
Near-optimal linear decision trees for \(k\)-SUM and related problems. Zbl 1427.68060
Kane, Daniel M.; Lovett, Shachar; Moran, Shay
2
2019
The list decoding radius for Reed-Muller codes over small fields. Zbl 1395.94357
Bhowmick, Abhishek; Lovett, Shachar
2
2018
Almost Euclidean sections of the \(N\)-dimensional cross-polytope using \(O(N)\) random bits. Zbl 1161.46010
Lovett, Shachar; Sodin, Sasha
2
2008
A bilinear Bogolyubov-Ruzsa lemma with polylogarithmic bounds. Zbl 1479.11031
Hosseini, Kaave; Lovett, Shachar
2
2019
DNF sparsification beyond sunflowers. Zbl 1433.68176
Lovett, Shachar; Zhang, Jiapeng
2
2019
Higher-order Fourier analysis and applications. Zbl 1453.68002
Hatami, Hamed; Hatami, Pooya; Lovett, Shachar
2
2019
The list decoding radius of Reed-Muller codes over small fields. Zbl 1321.94120
Bhowmick, Abhishek; Lovett, Shachar
2
2015
Large supports are required for well-supported Nash equilibria. Zbl 1376.91017
Anbalagan, Yogesh; Huang, Hao; Lovett, Shachar; Norin, Sergey; Vetta, Adrian; Wu, Hehui
2
2015
Probabilistic existence of large sets of designs. Zbl 1403.05022
Lovett, Shachar; Rao, Sankeerth; Vardy, Alexander
2
2018
Almost \(k\)-wise vs. \(k\)-wise independent permutations, and uniformity for general group actions. Zbl 1297.68182
Alon, Noga; Lovett, Shachar
2
2012
Pseudorandom generators for \(\mathrm{CC}^0[p]\) and the Fourier spectrum of low-degree polynomials over finite fields. Zbl 1290.68049
Lovett, Shachar; Mukhopadhyay, Partha; Shpilka, Amir
2
2013
Testing low complexity affine-invariant properties. Zbl 1423.11204
Bhattacharyya, Arnab; Fischer, Eldar; Lovett, Shachar
2
2013
Recent advances on the log-rank conjecture in communication complexity. Zbl 1409.68118
Lovett, Shachar
2
2014
Computing polynomials with few multiplications. Zbl 1247.68113
Lovett, Shachar
1
2011
Towards a constructive version of Banaszczyk’s vector balancing theorem. Zbl 1398.52007
Dadush, Daniel; Garg, Shashwat; Lovett, Shachar; Nikolov, Aleksandar
1
2016
On the Beck-Fiala conjecture for random set systems. Zbl 1398.05210
Ezra, Esther; Lovett, Shachar
1
2016
The Gram-Schmidt walk: a cure for the Banaszczyk blues. Zbl 07166715
Bansal, Nikhil; Dadush, Daniel; Garg, Shashwat; Lovett, Shachar
1
2019
Improved noisy population recovery, and reverse Bonami-Beckner inequality for sparse functions. Zbl 1321.68317
Lovett, Shachar; Zhang, Jiapeng
1
2015
Group representations that resist random sampling. Zbl 1325.05151
Lovett, Shachar; Moore, Cristopher; Russell, Alexander
1
2015
Probabilistic existence of large sets of designs. Zbl 1447.05044
Lovett, Shachar; Rao, Sankeerth; Vardy, Alexander
1
2020
Correlation testing for affine invariant properties on \(\mathbb{F}_p^n\) in the high error regime. Zbl 1358.68316
Hatami, Hamed; Lovett, Shachar
1
2014
Correlation testing for affine invariant properties on \(\mathbb F_p^n\) in the high error regime. Zbl 1288.68094
Hatami, Hamed; Lovett, Shachar
1
2011
An improved lower bound for arithmetic regularity. Zbl 1371.11026
Hosseini, Kaave; Lovett, Shachar; Moshkovitz, Guy; Shapira, Asaf
1
2016
A counterexample to a strong variant of the polynomial Freiman-Ruzsa conjecture in Euclidean space. Zbl 1404.11010
Lovett, Shachar; Regev, Oded
1
2017
On the impossibility of entropy reversal, and its application to zero-knowledge proofs. Zbl 1410.94095
Lovett, Shachar; Zhang, Jiapeng
1
2017
Nonclassical polynomials as a barrier to polynomial lower bounds. Zbl 1387.68120
Bhowmick, Abhishek; Lovett, Shachar
1
2015
The robust sensitivity of Boolean functions. Zbl 1403.68083
Lovett, Shachar; Tal, Avishay; Zhang, Jiapeng
1
2018
Sunflowers and quasi-sunflowers from randomness extractors. Zbl 07378663
Li, Xin; Lovett, Shachar; Zhang, Jiapeng
1
2018
Improved bounds for the sunflower lemma. Zbl 07298275
Alweiss, Ryan; Lovett, Shachar; Wu, Kewen; Zhang, Jiapeng
7
2020
Probabilistic existence of large sets of designs. Zbl 1447.05044
Lovett, Shachar; Rao, Sankeerth; Vardy, Alexander
1
2020
The analytic rank of tensors and its applications. Zbl 1431.15017
Lovett, Shachar
8
2019
The independence number of the Birkhoff polytope graph, and applications to maximally recoverable codes. Zbl 1419.05217
Kane, Daniel; Lovett, Shachar; Rao, Sankeerth
3
2019
Near-optimal linear decision trees for \(k\)-SUM and related problems. Zbl 1427.68060
Kane, Daniel M.; Lovett, Shachar; Moran, Shay
2
2019
A bilinear Bogolyubov-Ruzsa lemma with polylogarithmic bounds. Zbl 1479.11031
Hosseini, Kaave; Lovett, Shachar
2
2019
DNF sparsification beyond sunflowers. Zbl 1433.68176
Lovett, Shachar; Zhang, Jiapeng
2
2019
Higher-order Fourier analysis and applications. Zbl 1453.68002
Hatami, Hamed; Hatami, Pooya; Lovett, Shachar
2
2019
The Gram-Schmidt walk: a cure for the Banaszczyk blues. Zbl 07166715
Bansal, Nikhil; Dadush, Daniel; Garg, Shashwat; Lovett, Shachar
1
2019
Structure of protocols for XOR functions. Zbl 1386.68062
Hatami, Hamed; Hosseini, Kaave; Lovett, Shachar
11
2018
Algebraic attacks against random local functions and their countermeasures. Zbl 1417.94039
Applebaum, Benny; Lovett, Shachar
6
2018
Near-optimal linear decision trees for k-SUM and related problems. Zbl 1428.68129
Kane, Daniel M.; Lovett, Shachar; Moran, Shay
5
2018
The Gram-Schmidt walk: a cure for the Banaszczyk blues. Zbl 1427.68328
Bansal, Nikhil; Dadush, Daniel; Garg, Shashwat; Lovett, Shachar
4
2018
Pseudorandom generators from polarizing random walks. Zbl 1441.68149
Chattopadhyay, Eshan; Hatami, Pooya; Hosseini, Kaave; Lovett, Shachar
4
2018
Hardness amplification for non-commutative arithmetic circuits. Zbl 1441.68039
Carmosino, Marco L.; Impagliazzo, Russell; Lovett, Shachar; Mihajlin, Ivan
3
2018
Non-malleable codes from additive combinatorics. Zbl 1401.94233
Aggarwal, Divesh; Dodis, Yevgeniy; Lovett, Shachar
3
2018
The list decoding radius for Reed-Muller codes over small fields. Zbl 1395.94357
Bhowmick, Abhishek; Lovett, Shachar
2
2018
Probabilistic existence of large sets of designs. Zbl 1403.05022
Lovett, Shachar; Rao, Sankeerth; Vardy, Alexander
2
2018
The robust sensitivity of Boolean functions. Zbl 1403.68083
Lovett, Shachar; Tal, Avishay; Zhang, Jiapeng
1
2018
Sunflowers and quasi-sunflowers from randomness extractors. Zbl 07378663
Li, Xin; Lovett, Shachar; Zhang, Jiapeng
1
2018
Probabilistic existence of regular combinatorial structures. Zbl 1369.05024
Kuperberg, Greg; Lovett, Shachar; Peled, Ron
9
2017
A counterexample to a strong variant of the polynomial Freiman-Ruzsa conjecture in Euclidean space. Zbl 1404.11010
Lovett, Shachar; Regev, Oded
1
2017
On the impossibility of entropy reversal, and its application to zero-knowledge proofs. Zbl 1410.94095
Lovett, Shachar; Zhang, Jiapeng
1
2017
Rectangles are nonnegative juntas. Zbl 1353.68130
Göös, Mika; Lovett, Shachar; Meka, Raghu; Watson, Thomas; Zuckerman, David
19
2016
Algebraic attacks against random local functions and their countermeasures. Zbl 1377.94027
Applebaum, Benny; Lovett, Shachar
7
2016
General systems of linear forms: equidistribution and true complexity. Zbl 1336.11014
Hatami, Hamed; Hatami, Pooya; Lovett, Shachar
5
2016
Communication is bounded by root of rank. Zbl 1426.68132
Lovett, Shachar
5
2016
Towards a constructive version of Banaszczyk’s vector balancing theorem. Zbl 1398.52007
Dadush, Daniel; Garg, Shashwat; Lovett, Shachar; Nikolov, Aleksandar
1
2016
On the Beck-Fiala conjecture for random set systems. Zbl 1398.05210
Ezra, Esther; Lovett, Shachar
1
2016
An improved lower bound for arithmetic regularity. Zbl 1371.11026
Hosseini, Kaave; Lovett, Shachar; Moshkovitz, Guy; Shapira, Asaf
1
2016
Constructive discrepancy minimization by walking on the edges. Zbl 1330.68343
Lovett, Shachar; Meka, Raghu
19
2015
Rectangles are nonnegative juntas. Zbl 1321.68313
Göös, Mika; Lovett, Shachar; Meka, Raghu; Watson, Thomas; Zuckerman, David
7
2015
A tail bound for read-\(k\) families of functions. Zbl 1338.60082
Gavinsky, Dmitry; Lovett, Shachar; Saks, Michael; Srinivasan, Srikanth
3
2015
The list decoding radius of Reed-Muller codes over small fields. Zbl 1321.94120
Bhowmick, Abhishek; Lovett, Shachar
2
2015
Large supports are required for well-supported Nash equilibria. Zbl 1376.91017
Anbalagan, Yogesh; Huang, Hao; Lovett, Shachar; Norin, Sergey; Vetta, Adrian; Wu, Hehui
2
2015
Improved noisy population recovery, and reverse Bonami-Beckner inequality for sparse functions. Zbl 1321.68317
Lovett, Shachar; Zhang, Jiapeng
1
2015
Group representations that resist random sampling. Zbl 1325.05151
Lovett, Shachar; Moore, Cristopher; Russell, Alexander
1
2015
Nonclassical polynomials as a barrier to polynomial lower bounds. Zbl 1387.68120
Bhowmick, Abhishek; Lovett, Shachar
1
2015
Non-malleable codes from additive combinatorics (extended abstract). Zbl 1315.94142
Aggarwal, Divesh; Dodis, Yevgeniy; Lovett, Shachar
20
2014
Nontrivial \(t\)-designs over finite fields exist for all \(t\). Zbl 1297.05046
Fazeli, Arman; Lovett, Shachar; Vardy, Alexander
13
2014
En route to the log-rank conjecture: new reductions and equivalent formulations. Zbl 1412.68064
Gavinsky, Dmitry; Lovett, Shachar
7
2014
Communication is bounded by root of rank. Zbl 1315.68155
Lovett, Shachar
6
2014
New bounds for matching vector families. Zbl 1314.05204
Bhowmick, Abhishek; Dvir, Zeev; Lovett, Shachar
4
2014
Variety evasive sets. Zbl 1308.68166
Dvir, Zeev; Kollár, János; Lovett, Shachar
4
2014
An additive combinatorics approach relating rank to communication complexity. Zbl 1321.68271
Ben-Sasson, Eli; Lovett, Shachar; Ron-Zewi, Noga
3
2014
The Freiman-Ruzsa theorem over finite fields. Zbl 1302.11007
Even-Zohar, Chaim; Lovett, Shachar
3
2014
Recent advances on the log-rank conjecture in communication complexity. Zbl 1409.68118
Lovett, Shachar
2
2014
Correlation testing for affine invariant properties on \(\mathbb{F}_p^n\) in the high error regime. Zbl 1358.68316
Hatami, Hamed; Lovett, Shachar
1
2014
Every locally characterized affine-invariant property is testable. Zbl 1293.11016
Bhattacharyya, Arnab; Fischer, Eldar; Hatami, Hamed; Hatami, Pooya; Lovett, Shachar
11
2013
Almost \(k\)-wise vs. \(k\)-wise independent permutations, and uniformity for general group actions. Zbl 1297.68183
Alon, Noga; Lovett, Shachar
4
2013
A space lower bound for dynamic approximate membership data structures. Zbl 1285.68043
Lovett, Shachar; Porat, Ely
3
2013
New bounds for matching vector families. Zbl 1293.90003
Bhowmick, Abhishek; Dvir, Zeev; Lovett, Shachar
3
2013
Pseudorandom generators for \(\mathrm{CC}^0[p]\) and the Fourier spectrum of low-degree polynomials over finite fields. Zbl 1290.68049
Lovett, Shachar; Mukhopadhyay, Partha; Shpilka, Amir
2
2013
Testing low complexity affine-invariant properties. Zbl 1423.11204
Bhattacharyya, Arnab; Fischer, Eldar; Lovett, Shachar
2
2013
Subspace evasive sets. Zbl 1286.94109
Dvir, Zeev; Lovett, Shachar
14
2012
Probabilistic existence of rigid combinatorial structures. Zbl 1286.60027
Kuperberg, Greg; Lovett, Shachar; Peled, Ron
6
2012
Weight distribution and List-decoding size of Reed-Muller codes. Zbl 1365.94517
Kaufman, Tali; Lovett, Shachar; Porat, Ely
6
2012
Equivalence of polynomial conjectures in additive combinatorics. Zbl 1274.11158
Lovett, Shachar
5
2012
Bounded-depth circuits cannot sample good codes. Zbl 1282.68125
Lovett, Shachar; Viola, Emanuele
4
2012
Random low-degree polynomials are hard to approximate. Zbl 1280.68090
Ben-Eliezer, Ido; Hod, Rani; Lovett, Shachar
3
2012
Almost \(k\)-wise vs. \(k\)-wise independent permutations, and uniformity for general group actions. Zbl 1297.68182
Alon, Noga; Lovett, Shachar
2
2012
New extension of the Weil bound for character sums with applications to coding. Zbl 1292.94177
Kaufman, Tali; Lovett, Shachar
6
2011
Correlation bounds for poly-size \(\mathrm{AC}^0\) circuits with \(n^{1 - o(1)}\) symmetric gates. Zbl 1343.68098
Lovett, Shachar; Srinivasan, Srikanth
5
2011
Inverse conjecture for the Gowers norm is false. Zbl 1282.11009
Lovett, Shachar; Meshulam, Roy; Samorodnitsky, Alex
5
2011
Higher-order Fourier analysis of \(\mathbb F_p^n\) and the complexity of systems of linear forms. Zbl 1291.11026
Hatami, Hamed; Lovett, Shachar
4
2011
Computing polynomials with few multiplications. Zbl 1247.68113
Lovett, Shachar
1
2011
Correlation testing for affine invariant properties on \(\mathbb F_p^n\) in the high error regime. Zbl 1288.68094
Hatami, Hamed; Lovett, Shachar
1
2011
The complexity of Boolean functions in different characteristics. Zbl 1213.68309
Gopalan, Parikshit; Lovett, Shachar; Shpilka, Amir
3
2010
On cryptography with auxiliary input. Zbl 1304.94046
Dodis, Yevgeniy; Kalai, Yael Tauman; Lovett, Shachar
37
2009
Unconditional pseudorandom generators for low degree polynomials. Zbl 1213.68274
Lovett, Shachar
8
2009
Pseudorandom bit generators that fool modular sums. Zbl 1255.68294
Lovett, Shachar; Reingold, Omer; Trevisan, Luca; Vadhan, Salil
5
2009
Inverse conjecture for the Gowers norm is false. Zbl 1225.11158
Lovett, Shachar; Meshulam, Roy; Samorodniotsky, Alex
4
2008
Almost Euclidean sections of the \(N\)-dimensional cross-polytope using \(O(N)\) random bits. Zbl 1161.46010
Lovett, Shachar; Sodin, Sasha
2
2008
all top 5

Cited by 500 Authors

21 Lovett, Shachar
9 Venturi, Daniele
8 Göös, Mika
8 Pitassi, Toniann
6 Ben-Sasson, Eli
6 Dachman-Soled, Dana
6 Guruswami, Venkatesan
6 Nielsen, Jesper Buus
5 Hatami, Pooya
5 Ron-Zewi, Noga
5 Wootters, Mary
5 Ziegler, Tamar
4 Chattopadhyay, Arkadev
4 Dodis, Yevgeniy
4 Etzion, Tuvi
4 Ezra, Esther E.
4 Faonio, Antonio
4 Faust, Sebastian
4 Grigorescu, Elena
4 Hatami, Hamed
4 Kopparty, Swastik
4 Kulkarni, Mukul
4 Meka, Raghu
4 Shahverdi, Aria
4 Tell, Roei
4 Viola, Emanuele
3 Bansal, Nikhil
3 Bellare, Mihir
3 Braun, Michael
3 Coretti, Sandro
3 Gowers, William Timothy
3 Greenhill, Catherine S.
3 Hemenway, Brett
3 Hosseini, Kaave
3 Jain, Rahul
3 Kanukurthi, Bhavana
3 Kazhdan, David A.
3 Kiermaier, Michael
3 Komargodski, Ilan
3 Lee, Chin Ho
3 Méaux, Pierrick
3 Meir, Or
3 Milićević, Luka
3 Sanders, Tom
3 Santhanam, Rahul
3 Shinkar, Igor
3 Shpilka, Amir
3 Sudan, Madhu
3 Susilo, Willy
3 Tal, Avishay
3 Vaikuntanathan, Vinod
3 Wolf, Julia
3 Zhang, Jiapeng
2 Aggarwal, Divesh
2 Alon, Noga M.
2 Applebaum, Benny
2 Balogh, József
2 Bazzi, Louay M. J.
2 Ben-Aroya, Avraham
2 Ben-David, Shalev
2 Bhattacharyya, Arnab
2 Blinovsky, Vladimir
2 Boyle, Elette
2 Canetti, Ran
2 Chandran, Nishanth
2 Chattopadhyay, Eshan
2 Chen, Rongmao
2 Cheraghchi, Mahdi
2 Damgård, Ivan Bjerre
2 Doron, Dean
2 Filmus, Yuval
2 Ge, Gennian
2 Goldwasser, Shafi
2 Gong, Huijing
2 Guo, Fuchun
2 Hod, Rani
2 Ishai, Yuval
2 Kabanets, Valentine
2 Kane, Daniel M.
2 Keevash, Peter
2 Kerenidis, Iordanis
2 Koroth, Sajin
2 Kothari, Robin
2 Laplante, Sophie
2 Laue, Reinhard
2 Li, Qian
2 Limaye, Nutan
2 Liu, Feng-Hao
2 Liu, Tianren
2 Loff, Bruno
2 Lu, Zhenjian
2 Luo, Sammy
2 Manurangsi, Pasin
2 Mu, Yi
2 Mukherjee, Pratyay
2 Mukhopadhyay, Sagnik
2 Nagarajan, Viswanath
2 Obbattu, Sai Lakshmi Bhavana
2 Obremski, Maciej
2 Oliveira, Igor Carboni
...and 400 more Authors
all top 5

Cited in 62 Serials

31 SIAM Journal on Computing
21 Computational Complexity
11 Theoretical Computer Science
11 Journal of Cryptology
8 Designs, Codes and Cryptography
8 The Electronic Journal of Combinatorics
6 Geometric and Functional Analysis. GAFA
5 European Journal of Combinatorics
5 Discrete & Computational Geometry
5 Discrete Analysis
4 Information Processing Letters
4 Journal of Combinatorial Theory. Series A
4 Journal of Combinatorial Theory. Series B
4 Algorithmica
4 SIAM Journal on Discrete Mathematics
4 Combinatorics, Probability and Computing
3 Discrete Mathematics
3 Israel Journal of Mathematics
3 Advances in Mathematics
3 Transactions of the American Mathematical Society
3 Combinatorica
3 Random Structures & Algorithms
3 Chicago Journal of Theoretical Computer Science
3 Journal of Mathematical Cryptology
3 Theory of Computing
2 Journal of Computer and System Sciences
2 Proceedings of the American Mathematical Society
2 Proceedings of the Edinburgh Mathematical Society. Series II
2 Information and Computation
2 Linear Algebra and its Applications
2 Indagationes Mathematicae. New Series
2 Journal of Algebraic Combinatorics
2 Selecta Mathematica. New Series
2 Theory of Computing Systems
2 Journal of the ACM
2 Annals of Mathematics. Second Series
2 Cryptography and Communications
1 Discrete Applied Mathematics
1 Mathematical Notes
1 Problems of Information Transmission
1 Information Sciences
1 Operations Research Letters
1 Graphs and Combinatorics
1 Journal of Complexity
1 Machine Learning
1 Bulletin of the American Mathematical Society. New Series
1 The Australasian Journal of Combinatorics
1 Journal de Théorie des Nombres de Bordeaux
1 Finite Fields and their Applications
1 Journal of Combinatorial Designs
1 European Mathematical Society Newsletter
1 Positivity
1 Soft Computing
1 Annals of Combinatorics
1 Journal of Machine Learning Research (JMLR)
1 Mediterranean Journal of Mathematics
1 Proceedings of the Steklov Institute of Mathematics
1 Online Journal of Analytic Combinatorics
1 Advances in Mathematics of Communications
1 Forum of Mathematics, Pi
1 Computer Science Review
1 Journal of Algebra, Combinatorics, Discrete Structures and Applications

Citations by Year