×

zbMATH — the first resource for mathematics

Ben-Sasson, Eli

Compute Distance To:
Author ID: ben-sasson.eli Recent zbMATH articles by "Ben-Sasson, Eli"
Published as: Ben-Sasson, Eli
Homepage: http://eli.net.technion.ac.il/
External Links: MGP · ResearchGate · dblp
Documents Indexed: 69 Publications since 1999

Publications by Year

Citations contained in zbMATH Open

60 Publications have been cited 551 times in 279 Documents Cited by Year
Short proofs are narrow – resolution made simple. Zbl 1089.03507
Ben-Sasson, Eli; Wigderson, Avi
87
2001
Robust PCPs of proximity, shorter PCPs, and applications to coding. Zbl 1118.68071
Ben-Sasson, Eli; Goldreich, Oded; Harsha, Prahladh; Sudan, Madhu; Vadhan, Salil
42
2006
Space complexity in propositional calculus. Zbl 1004.03047
Alekhnovich, Michael; Ben-Sasson, Eli; Razborov, Alexander A.; Wigderson, Avi
36
2002
Some 3CNF properties are hard to test. Zbl 1086.68045
Ben-Sasson, Eli; Harsha, Prahladh; Raskhodnikova, Sofya
30
2005
Pseudorandom generators in propositional proof complexity. Zbl 1096.03070
Alekhnovich, Michael; Ben-Sasson, Eli; Razborov, Alexander A.; Wigderson, Avi
26
2004
Short PCPs with polylog query complexity. Zbl 1172.68025
Ben-Sasson, Eli; Sudan, Madhu
21
2009
Near optimal seperation of tree-like and general resolution. Zbl 1063.03043
Ben-Sasson, Eli; Impagliazzo, Russell; Wigderson, Avi
19
2004
Snarks for C: verifying program executions succinctly and in zero knowledge. Zbl 1317.68050
Ben-Sasson, Eli; Chiesa, Alessandro; Genkin, Daniel; Tromer, Eran; Virza, Madars
17
2013
Space complexity of random formulae in resolution. Zbl 1048.03046
Ben-Sasson, Eli; Galesi, Nicola
16
2003
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. Zbl 1192.94089
Ben-Sasson, Eli; Sudan, Madhu; Vadhan, Salil; Wigderson, Avi
16
2003
Short proofs are narrow – resolution made simple. Zbl 1346.68173
Ben-Sasson, Eli; Wigderson, Avi
13
1999
Short PCPs with projection queries. Zbl 1410.68135
Ben-Sasson, Eli; Viola, Emanuele
12
2014
Subspace polynomials and cyclic subspace codes. Zbl 1359.94757
Ben-Sasson, Eli; Etzion, Tuvi; Gabizon, Ariel; Raviv, Netanel
11
2016
Scalable zero knowledge via cycles of elliptic curves. Zbl 1334.68077
Ben-Sasson, Eli; Chiesa, Alessandro; Tromer, Eran; Virza, Madars
11
2014
Robust locally testable codes and products of codes. Zbl 1103.90080
Ben-Sasson, Eli; Sudan, Madhu
11
2006
Random CNF’s are hard for the polynomial calculus. Zbl 1216.03064
Ben-Sasson, Eli; Impagliazzo, Russell
10
2010
Simple PCPs with poly-log rate and query complexity. Zbl 1192.68287
Ben-Sasson, Eli; Sudan, Madhu
9
2005
Size-space tradeoffs for resolution. Zbl 1191.68617
Ben-Sasson, Eli
9
2009
Near-linear unconditionally-secure multiparty computation with a dishonest minority. Zbl 1296.94082
Ben-Sasson, Eli; Fehr, Serge; Ostrovsky, Rafail
9
2012
Locally testable codes require redundant testers. Zbl 1209.68265
Ben-Sasson, Eli; Guruswami, Venkatesan; Kaufman, Tali; Sudan, Madhu; Viderman, Michael
8
2010
Affine dispersers from subspace polynomials. Zbl 1253.68253
Ben-Sasson, Eli; Kopparty, Swastik
8
2012
On the concrete efficiency of probabilistically-checkable proofs. Zbl 1293.94054
Ben-Sasson, Eli; Chiesa, Alessandro; Genkin, Daniel; Tromer, Eran
7
2013
Linear upper bounds for random walk on small density random 3-CNFs. Zbl 1124.68041
Alekhnovich, Mikhail; Ben-Sasson, Eli
7
2006
Tensor products of weakly smooth codes are robust. Zbl 1213.68252
Ben-Sasson, Eli; Viderman, Michael
7
2009
Fast reductions from RAMs to delegatable succinct constraint satisfaction problems (extended abstract). Zbl 1361.68088
Ben-Sasson, Eli; Chiesa, Alessandro; Genkin, Daniel; Tromer, Eran
6
2013
Bounds on \(2\)-query codeword testing. Zbl 1279.94142
Ben-Sasson, Eli; Goldreich, Oded; Sudan, Madhu
6
2003
Some 3CNF properties are hard to test. Zbl 1192.68347
Ben-Sasson, Eli; Harsha, Prahladh; Raskhodnikova, Sofya
6
2003
Composition of semi-LTCs by two-wise tensor products. Zbl 1255.94088
Ben-Sasson, Eli; Viderman, Michael
5
2009
Interactive oracle proofs. Zbl 1397.94048
Ben-Sasson, Eli; Chiesa, Alessandro; Spooner, Nicholas
5
2016
From affine to two-source extractors via approximate duality. Zbl 1288.94030
Zewi, Noga; Ben-Sasson, Eli
5
2011
Robust PSPs of proximity, shorter PSPs and applications to coding. Zbl 1192.68286
Ben-Sasson, Eli; Goldreich, Oded; Harsha, Prahladh; Sudan, Madhu; Vadhan, Salil
5
2004
Quasi-linear size zero knowledge from linear-algebraic PCPs. Zbl 1375.94101
Ben-Sasson, Eli; Chiesa, Alessandro; Gabizon, Ariel; Virza, Madars
5
2016
Limits on the rate of locally testable affine-invariant codes. Zbl 1343.68288
Ben-Sasson, Eli; Sudan, Madhu
5
2011
Subspace polynomials and limits to list decoding of Reed-Solomon codes. Zbl 1366.94690
Ben-Sasson, Eli; Kopparty, Swastik; Radhakrishnan, Jaikumar
4
2010
Affine dispersers from subspace polynomials. Zbl 1304.68135
Ben-Sasson, Eli; Kopparty, Swastik
4
2009
Constant rate PCPs for circuit-SAT with sublinear query complexity. Zbl 1410.68140
Ben-Sasson, Eli; Kaplan, Yohay; Kopparty, Swastik; Meir, Or; Stichtenoth, Henning
4
2016
Size space tradeoffs for resolution. Zbl 1192.03040
Ben-Sasson, Eli
4
2002
On sums of locally testable affine invariant properties. Zbl 1343.68287
Ben-Sasson, Eli; Grigorescu, Elena; Maatouk, Ghid; Shpilka, Amir; Sudan, Madhu
4
2011
Sound 3-query PCPPs are long. Zbl 1322.68094
Ben-Sasson, Eli; Harsha, Prahladh; Lachish, Oded; Matsliah, Arie
3
2009
Space complexity in propositional calculus. Zbl 1296.03032
Alekhnovich, Michael; Ben-Sasson, Eli; Razborov, Alexander A.; Wigderson, Avi
3
2000
Extractors for polynomial sources over fields of constant order and small characteristic. Zbl 1357.68148
Ben-Sasson, Eli; Gabizon, Ariel
3
2013
Low rate is insufficient for local testability. Zbl 1305.94094
Ben-Sasson, Eli; Viderman, Michael
3
2010
Computational integrity with a public random string from quasi-linear PCPs. Zbl 1415.94409
Ben-Sasson, Eli; Bentov, Iddo; Chiesa, Alessandro; Gabizon, Ariel; Genkin, Daniel; Hamilis, Matan; Pergament, Evgenya; Riabzev, Michael; Silberstein, Mark; Tromer, Eran; Virza, Madars
2
2017
Hard examples for the bounded depth Frege proof system. Zbl 1043.03043
Ben-Sasson, Eli
2
2002
An additive combinatorics approach relating rank to communication complexity. Zbl 1321.68271
Ben-Sasson, Eli; Lovett, Shachar; Ron-Zewi, Noga
2
2014
Lower bounds for bounded depth Frege proofs via Pudlák-Buss games. Zbl 1352.03065
Ben-Sasson, Eli; Harsha, Prahladh
2
2010
Composition of semi-LTCs by two-wise tensor products. Zbl 1336.94084
Ben-Sasson, Eli; Viderman, Michael
2
2015
Scalable zero knowledge via cycles of elliptic curves. Zbl 1383.68035
Ben-Sasson, Eli; Chiesa, Alessandro; Tromer, Eran; Virza, Madars
2
2017
Robust locally testable codes and products of codes. Zbl 1105.68346
Ben-Sasson, Eli; Sudan, Madhu
2
2004
Sound 3-query PCPPs are long. Zbl 1153.68440
Ben-Sasson, Eli; Harsha, Prahladh; Lachish, Oded; Matsliah, Arie
2
2008
Limitation on the rate of families of locally testable codes. Zbl 1308.68056
Ben-Sasson, Eli
2
2010
Extractors for polynomials sources over constant-size fields of small characteristic. Zbl 1357.68147
Ben-Sasson, Eli; Gabizon, Ariel
2
2012
Towards lower bounds on locally testable codes via density arguments. Zbl 1302.94064
Ben-Sasson, Eli; Viderman, Michael
2
2012
Zero knowledge protocols from succinct constraint detection. Zbl 1416.68020
Ben-Sasson, Eli; Chiesa, Alessandro; Forbes, Michael A.; Gabizon, Ariel; Riabzev, Michael; Spooner, Nicholas
1
2017
A new family of locally correctable codes based on degree-lifted algebraic geometry codes. Zbl 1293.94124
Ben-Sasson, Eli; Gabizon, Ariel; Kaplan, Yohay; Kopparty, Swastik; Saraf, Shubangi
1
2013
Interactive oracle proofs with constant rate and query complexity. Zbl 1441.68084
Ben-Sasson, Eli; Chiesa, Alessandro; Gabizon, Ariel; Riabzev, Michael; Spooner, Nicholas
1
2017
From affine to two-source extractors via approximate duality. Zbl 1330.68219
Ben-Sasson, Eli; Ron-Zewi, Noga
1
2015
Sampling-based proofs of almost-periodicity results and algorithmic applications. Zbl 1376.11005
Ben-Sasson, Eli; Ron-Zewi, Noga; Tulsiani, Madhur; Wolf, Julia
1
2014
Hard examples for bounded depth frege. Zbl 1192.03041
Ben-Sasson, Eli
1
2002
Lower bounds for width-restricted clause learning on small width formulas. Zbl 1306.68152
Ben-Sasson, Eli; Johannsen, Jan
1
2010
Computational integrity with a public random string from quasi-linear PCPs. Zbl 1415.94409
Ben-Sasson, Eli; Bentov, Iddo; Chiesa, Alessandro; Gabizon, Ariel; Genkin, Daniel; Hamilis, Matan; Pergament, Evgenya; Riabzev, Michael; Silberstein, Mark; Tromer, Eran; Virza, Madars
2
2017
Scalable zero knowledge via cycles of elliptic curves. Zbl 1383.68035
Ben-Sasson, Eli; Chiesa, Alessandro; Tromer, Eran; Virza, Madars
2
2017
Zero knowledge protocols from succinct constraint detection. Zbl 1416.68020
Ben-Sasson, Eli; Chiesa, Alessandro; Forbes, Michael A.; Gabizon, Ariel; Riabzev, Michael; Spooner, Nicholas
1
2017
Interactive oracle proofs with constant rate and query complexity. Zbl 1441.68084
Ben-Sasson, Eli; Chiesa, Alessandro; Gabizon, Ariel; Riabzev, Michael; Spooner, Nicholas
1
2017
Subspace polynomials and cyclic subspace codes. Zbl 1359.94757
Ben-Sasson, Eli; Etzion, Tuvi; Gabizon, Ariel; Raviv, Netanel
11
2016
Interactive oracle proofs. Zbl 1397.94048
Ben-Sasson, Eli; Chiesa, Alessandro; Spooner, Nicholas
5
2016
Quasi-linear size zero knowledge from linear-algebraic PCPs. Zbl 1375.94101
Ben-Sasson, Eli; Chiesa, Alessandro; Gabizon, Ariel; Virza, Madars
5
2016
Constant rate PCPs for circuit-SAT with sublinear query complexity. Zbl 1410.68140
Ben-Sasson, Eli; Kaplan, Yohay; Kopparty, Swastik; Meir, Or; Stichtenoth, Henning
4
2016
Composition of semi-LTCs by two-wise tensor products. Zbl 1336.94084
Ben-Sasson, Eli; Viderman, Michael
2
2015
From affine to two-source extractors via approximate duality. Zbl 1330.68219
Ben-Sasson, Eli; Ron-Zewi, Noga
1
2015
Short PCPs with projection queries. Zbl 1410.68135
Ben-Sasson, Eli; Viola, Emanuele
12
2014
Scalable zero knowledge via cycles of elliptic curves. Zbl 1334.68077
Ben-Sasson, Eli; Chiesa, Alessandro; Tromer, Eran; Virza, Madars
11
2014
An additive combinatorics approach relating rank to communication complexity. Zbl 1321.68271
Ben-Sasson, Eli; Lovett, Shachar; Ron-Zewi, Noga
2
2014
Sampling-based proofs of almost-periodicity results and algorithmic applications. Zbl 1376.11005
Ben-Sasson, Eli; Ron-Zewi, Noga; Tulsiani, Madhur; Wolf, Julia
1
2014
Snarks for C: verifying program executions succinctly and in zero knowledge. Zbl 1317.68050
Ben-Sasson, Eli; Chiesa, Alessandro; Genkin, Daniel; Tromer, Eran; Virza, Madars
17
2013
On the concrete efficiency of probabilistically-checkable proofs. Zbl 1293.94054
Ben-Sasson, Eli; Chiesa, Alessandro; Genkin, Daniel; Tromer, Eran
7
2013
Fast reductions from RAMs to delegatable succinct constraint satisfaction problems (extended abstract). Zbl 1361.68088
Ben-Sasson, Eli; Chiesa, Alessandro; Genkin, Daniel; Tromer, Eran
6
2013
Extractors for polynomial sources over fields of constant order and small characteristic. Zbl 1357.68148
Ben-Sasson, Eli; Gabizon, Ariel
3
2013
A new family of locally correctable codes based on degree-lifted algebraic geometry codes. Zbl 1293.94124
Ben-Sasson, Eli; Gabizon, Ariel; Kaplan, Yohay; Kopparty, Swastik; Saraf, Shubangi
1
2013
Near-linear unconditionally-secure multiparty computation with a dishonest minority. Zbl 1296.94082
Ben-Sasson, Eli; Fehr, Serge; Ostrovsky, Rafail
9
2012
Affine dispersers from subspace polynomials. Zbl 1253.68253
Ben-Sasson, Eli; Kopparty, Swastik
8
2012
Extractors for polynomials sources over constant-size fields of small characteristic. Zbl 1357.68147
Ben-Sasson, Eli; Gabizon, Ariel
2
2012
Towards lower bounds on locally testable codes via density arguments. Zbl 1302.94064
Ben-Sasson, Eli; Viderman, Michael
2
2012
From affine to two-source extractors via approximate duality. Zbl 1288.94030
Zewi, Noga; Ben-Sasson, Eli
5
2011
Limits on the rate of locally testable affine-invariant codes. Zbl 1343.68288
Ben-Sasson, Eli; Sudan, Madhu
5
2011
On sums of locally testable affine invariant properties. Zbl 1343.68287
Ben-Sasson, Eli; Grigorescu, Elena; Maatouk, Ghid; Shpilka, Amir; Sudan, Madhu
4
2011
Random CNF’s are hard for the polynomial calculus. Zbl 1216.03064
Ben-Sasson, Eli; Impagliazzo, Russell
10
2010
Locally testable codes require redundant testers. Zbl 1209.68265
Ben-Sasson, Eli; Guruswami, Venkatesan; Kaufman, Tali; Sudan, Madhu; Viderman, Michael
8
2010
Subspace polynomials and limits to list decoding of Reed-Solomon codes. Zbl 1366.94690
Ben-Sasson, Eli; Kopparty, Swastik; Radhakrishnan, Jaikumar
4
2010
Low rate is insufficient for local testability. Zbl 1305.94094
Ben-Sasson, Eli; Viderman, Michael
3
2010
Lower bounds for bounded depth Frege proofs via Pudlák-Buss games. Zbl 1352.03065
Ben-Sasson, Eli; Harsha, Prahladh
2
2010
Limitation on the rate of families of locally testable codes. Zbl 1308.68056
Ben-Sasson, Eli
2
2010
Lower bounds for width-restricted clause learning on small width formulas. Zbl 1306.68152
Ben-Sasson, Eli; Johannsen, Jan
1
2010
Short PCPs with polylog query complexity. Zbl 1172.68025
Ben-Sasson, Eli; Sudan, Madhu
21
2009
Size-space tradeoffs for resolution. Zbl 1191.68617
Ben-Sasson, Eli
9
2009
Tensor products of weakly smooth codes are robust. Zbl 1213.68252
Ben-Sasson, Eli; Viderman, Michael
7
2009
Composition of semi-LTCs by two-wise tensor products. Zbl 1255.94088
Ben-Sasson, Eli; Viderman, Michael
5
2009
Affine dispersers from subspace polynomials. Zbl 1304.68135
Ben-Sasson, Eli; Kopparty, Swastik
4
2009
Sound 3-query PCPPs are long. Zbl 1322.68094
Ben-Sasson, Eli; Harsha, Prahladh; Lachish, Oded; Matsliah, Arie
3
2009
Sound 3-query PCPPs are long. Zbl 1153.68440
Ben-Sasson, Eli; Harsha, Prahladh; Lachish, Oded; Matsliah, Arie
2
2008
Robust PCPs of proximity, shorter PCPs, and applications to coding. Zbl 1118.68071
Ben-Sasson, Eli; Goldreich, Oded; Harsha, Prahladh; Sudan, Madhu; Vadhan, Salil
42
2006
Robust locally testable codes and products of codes. Zbl 1103.90080
Ben-Sasson, Eli; Sudan, Madhu
11
2006
Linear upper bounds for random walk on small density random 3-CNFs. Zbl 1124.68041
Alekhnovich, Mikhail; Ben-Sasson, Eli
7
2006
Some 3CNF properties are hard to test. Zbl 1086.68045
Ben-Sasson, Eli; Harsha, Prahladh; Raskhodnikova, Sofya
30
2005
Simple PCPs with poly-log rate and query complexity. Zbl 1192.68287
Ben-Sasson, Eli; Sudan, Madhu
9
2005
Pseudorandom generators in propositional proof complexity. Zbl 1096.03070
Alekhnovich, Michael; Ben-Sasson, Eli; Razborov, Alexander A.; Wigderson, Avi
26
2004
Near optimal seperation of tree-like and general resolution. Zbl 1063.03043
Ben-Sasson, Eli; Impagliazzo, Russell; Wigderson, Avi
19
2004
Robust PSPs of proximity, shorter PSPs and applications to coding. Zbl 1192.68286
Ben-Sasson, Eli; Goldreich, Oded; Harsha, Prahladh; Sudan, Madhu; Vadhan, Salil
5
2004
Robust locally testable codes and products of codes. Zbl 1105.68346
Ben-Sasson, Eli; Sudan, Madhu
2
2004
Space complexity of random formulae in resolution. Zbl 1048.03046
Ben-Sasson, Eli; Galesi, Nicola
16
2003
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. Zbl 1192.94089
Ben-Sasson, Eli; Sudan, Madhu; Vadhan, Salil; Wigderson, Avi
16
2003
Bounds on \(2\)-query codeword testing. Zbl 1279.94142
Ben-Sasson, Eli; Goldreich, Oded; Sudan, Madhu
6
2003
Some 3CNF properties are hard to test. Zbl 1192.68347
Ben-Sasson, Eli; Harsha, Prahladh; Raskhodnikova, Sofya
6
2003
Space complexity in propositional calculus. Zbl 1004.03047
Alekhnovich, Michael; Ben-Sasson, Eli; Razborov, Alexander A.; Wigderson, Avi
36
2002
Size space tradeoffs for resolution. Zbl 1192.03040
Ben-Sasson, Eli
4
2002
Hard examples for the bounded depth Frege proof system. Zbl 1043.03043
Ben-Sasson, Eli
2
2002
Hard examples for bounded depth frege. Zbl 1192.03041
Ben-Sasson, Eli
1
2002
Short proofs are narrow – resolution made simple. Zbl 1089.03507
Ben-Sasson, Eli; Wigderson, Avi
87
2001
Space complexity in propositional calculus. Zbl 1296.03032
Alekhnovich, Michael; Ben-Sasson, Eli; Razborov, Alexander A.; Wigderson, Avi
3
2000
Short proofs are narrow – resolution made simple. Zbl 1346.68173
Ben-Sasson, Eli; Wigderson, Avi
13
1999
all top 5

Cited by 400 Authors

16 Ben-Sasson, Eli
12 Beyersdorff, Olaf
12 Lauria, Massimo
11 Goldreich, Oded
9 Chiesa, Alessandro
9 Galesi, Nicola
9 Nordström, Jakob
9 Thapen, Neil
8 Atserias, Albert
8 Gur, Tom
8 Sudan, Madhu
7 Itsykson, Dmitry M.
7 Razborov, Aleksandr Aleksandrovich
7 Rothblum, Ron D.
6 Meir, Or
6 Pitassi, Toniann
5 Alekhnovich, Michael
5 Bonacina, Ilario
5 Dinur, Irit
5 Ron-Zewi, Noga
5 Tzameret, Iddo
5 Wigderson, Avi
4 Beame, Paul W.
4 Esteban, Juan Luis
4 Grigorescu, Elena
4 Ishai, Yuval
4 Kaufman, Tali
4 Müller, Moritz
4 Torán, Jacobo
4 Tromer, Eran
4 Viderman, Michael
4 Yoshida, Yuichi
3 Blinkhorn, Joshua
3 Bonet, Maria Luisa
3 Filmus, Yuval
3 Gabizon, Ariel
3 Hinde, Luke
3 Hirsch, Edward A.
3 Impagliazzo, Russell
3 Krajíček, Jan
3 Lovett, Shachar
3 Newman, Ilan I.
3 Pudlák, Pavel
3 Shinkar, Igor
3 Tamaki, Suguru
3 Vinyals, Marc
3 Viola, Emanuele
3 Virza, Madars
3 Williams, Richard Ryan
3 Xu, Ke
2 Abboud, Amir
2 Alechina, Natasha
2 Applebaum, Benny
2 Bhattacharyya, Arnab
2 Buss, Sam
2 Buss, Samuel R.
2 Chew, Leroy
2 Choudhary, Ashish
2 Damgård, Ivan Bjerre
2 Dantchev, Stefan Stoyanov
2 de Rezende, Susanna F.
2 Drucker, Andrew
2 Dvir, Zeev
2 Genkin, Daniel
2 Golovnev, Alexander
2 Göös, Mika
2 Johannsen, Jan
2 Krivelevich, Michael
2 Kulikov, Alexander S.
2 Logan, Brian
2 Martin, Barnaby D.
2 Miles, Eric
2 Nielsen, Jesper Buus
2 Patra, Arpita
2 Pich, Ján
2 Polychroniadou, Antigoni
2 Raskhodnikova, Sofya
2 Raz, Ran
2 Robere, Robert
2 Ron, Dana
2 Rozenberg, Eyal
2 Rubinfeld, Ronitt
2 Rubinstein, Aviad
2 Scafuro, Alessandra
2 Shaltiel, Ronen
2 Shparlinski, Igor E.
2 Smal, Alexander V.
2 Sokolev, Dmitry
2 Talebanfard, Navid
2 Tell, Roei
2 Urquhart, Alasdair
2 Vaikuntanathan, Vinod
2 Veeningen, Meilof
2 Wootters, Mary
2 Zhou, Yuren
1 Abdolmaleki, Behzad
1 Achlioptas, Dimitris
1 Aharonov, Dorit
1 Albore, Alexandre
1 Albrecht, Martin R.
...and 300 more Authors
all top 5

Cited in 56 Serials

31 Computational Complexity
19 SIAM Journal on Computing
15 Information Processing Letters
13 Theoretical Computer Science
10 Information and Computation
9 Journal of Computer and System Sciences
9 Random Structures & Algorithms
7 Designs, Codes and Cryptography
6 Artificial Intelligence
6 Annals of Pure and Applied Logic
6 Algorithmica
6 Theory of Computing Systems
5 Discrete Applied Mathematics
5 Journal of Cryptology
5 Theory of Computing
3 Finite Fields and their Applications
3 ACM Transactions on Computational Logic
3 Logical Methods in Computer Science
2 Discrete Mathematics
2 The Journal of Symbolic Logic
2 Combinatorica
2 Journal of Automated Reasoning
2 SIAM Journal on Discrete Mathematics
2 Bulletin of the American Mathematical Society. New Series
2 Archive for Mathematical Logic
2 Journal of Mathematical Sciences (New York)
2 Mathematical Logic Quarterly (MLQ)
2 Annals of Mathematics and Artificial Intelligence
2 Journal of the ACM
2 Cryptography and Communications
1 Journal d’Analyse Mathématique
1 Journal of Combinatorial Theory. Series A
1 Proceedings of the American Mathematical Society
1 Studia Logica
1 Synthese
1 Acta Mathematicae Applicatae Sinica. English Series
1 Journal of Symbolic Computation
1 Discrete & Computational Geometry
1 Science in China. Series A
1 MSCS. Mathematical Structures in Computer Science
1 International Journal of Foundations of Computer Science
1 Journal of Global Optimization
1 Cybernetics and Systems Analysis
1 The Bulletin of Symbolic Logic
1 Journal of Combinatorial Optimization
1 Chicago Journal of Theoretical Computer Science
1 Journal of Graph Algorithms and Applications
1 Annals of Combinatorics
1 Annals of Mathematics. Second Series
1 RAIRO. Theoretical Informatics and Applications
1 Journal of Mathematical Logic
1 Sādhanā
1 JSIAM Letters
1 ACM Transactions on Computation Theory
1 SIAM Journal on Applied Algebra and Geometry
1 Prikladnaya Diskretnaya Matematika

Citations by Year