Edit Profile (opens in new tab) Groth, Jens Co-Author Distance Author ID: groth.jens Published as: Groth, Jens External Links: ORCID Documents Indexed: 62 Publications since 2002 1 Contribution as Editor Co-Authors: 38 Co-Authors with 44 Joint Publications 1,186 Co-Co-Authors all top 5 Co-Authors 19 single-authored 10 Bootle, Jonathan 8 Abe, Masayuki 8 Cerulli, Andrea 8 Ohkubo, Miyako 7 Sahai, Amit 6 Chaidos, Pyrros 5 Ghadafi, Essam M. 5 Ostrovsky, Rafail 4 Kohlweiss, Markulf 3 Haralambiev, Kristiyan 3 Maller, Mary 3 Tibouchi, Mehdi 2 Bayer, Stephanie 2 Fuchsbauer, Georg 2 Ishai, Yuval 2 Jakobsen, Sune Kristian 2 Lu, Steve 2 Petit, Christophe 1 Baum, Carsten 1 Camenisch, Jan L. 1 Chandran, Nishanth 1 Chiesa, Alessandro 1 Damgård, Ivan Bjerre 1 Danezis, George 1 del Pino, Rafael 1 Escala, Alex 1 Fournet, Cédric 1 Gentry, Craig 1 Kiayias, Aggelos 1 Lipmaa, Helger 1 Lyubashevsky, Vadim 1 Meiklejohn, Sarah 1 Miers, Ian 1 Peikert, Chris 1 Shoup, Victor 1 Smith, Adam D. 1 Tango, Takeya 1 Wikström, Douglas Serials 6 Journal of Cryptology 1 SIAM Journal on Computing 1 Journal of the ACM 1 Lecture Notes in Computer Science Fields 63 Information and communication theory, circuits (94-XX) 12 Computer science (68-XX) 1 General and overarching topics; collections (00-XX) 1 Game theory, economics, finance, and other social and behavioral sciences (91-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 59 Publications have been cited 2,151 times in 954 Documents Cited by ▼ Year ▼ Efficient non-interactive proof systems for bilinear groups. Zbl 1149.94320 Groth, Jens; Sahai, Amit 248 2008 On the size of pairing-based non-interactive arguments. Zbl 1369.94539 Groth, Jens 157 2016 Short pairing-based non-interactive zero-knowledge arguments. Zbl 1253.94049 Groth, Jens 134 2010 Perfect non-interactive zero knowledge for NP. Zbl 1129.94025 Groth, Jens; Ostrovsky, Rafail; Sahai, Amit 117 2006 Simulation-sound NIZK proofs for a practical language and constant size group signatures. Zbl 1172.94615 Groth, Jens 112 2006 Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. Zbl 1369.94520 Bootle, Jonathan; Cerulli, Andrea; Chaidos, Pyrros; Groth, Jens; Petit, Christophe 108 2016 Structure-preserving signatures and commitments to group elements. Zbl 1280.94102 Abe, Masayuki; Fuchsbauer, Georg; Groth, Jens; Haralambiev, Kristiyan; Ohkubo, Miyako 85 2010 New techniques for noninteractive zero-knowledge. Zbl 1281.68102 Groth, Jens; Ostrovsky, Rafail; Sahai, Amit 81 2012 Non-interactive ZAPs and new techniques for NIZK. Zbl 1129.94024 Groth, Jens; Ostrovsky, Rafail; Sahai, Amit 69 2006 Fully anonymous group signatures without random oracles. Zbl 1153.94386 Groth, Jens 53 2007 One-out-of-many proofs: or how to leak a secret and spend a coin. Zbl 1371.94639 Groth, Jens; Kohlweiss, Markulf 51 2015 Square span programs with applications to succinct NIZK arguments. Zbl 1306.94042 Danezis, George; Fournet, Cédric; Groth, Jens; Kohlweiss, Markulf 50 2014 Efficient noninteractive proof systems for bilinear groups. Zbl 1259.94048 Groth, Jens; Sahai, Amit 50 2012 Updatable and universal common reference strings with applications to zk-SNARKs. Zbl 1457.94137 Groth, Jens; Kohlweiss, Markulf; Maller, Mary; Meiklejohn, Sarah; Miers, Ian 48 2018 Optimal structure-preserving signatures in asymmetric bilinear groups. Zbl 1290.94038 Abe, Masayuki; Groth, Jens; Haralambiev, Kristiyan; Ohkubo, Miyako 43 2011 Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks. Zbl 1410.94077 Groth, Jens; Maller, Mary 38 2017 Efficient zero-knowledge argument for correctness of a shuffle. Zbl 1297.94045 Bayer, Stephanie; Groth, Jens 38 2012 Short accountable ring signatures based on DDH. Zbl 1499.94054 Bootle, Jonathan; Cerulli, Andrea; Chaidos, Pyrros; Ghadafi, Essam; Groth, Jens; Petit, Christophe 35 2015 Foundations of fully dynamic group signatures. Zbl 1346.94141 Bootle, Jonathan; Cerulli, Andrea; Chaidos, Pyrros; Ghadafi, Essam; Groth, Jens 34 2016 Fine-tuning Groth-Sahai proofs. Zbl 1335.94047 Escala, Alex; Groth, Jens 32 2014 Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits. Zbl 1436.94040 Baum, Carsten; Bootle, Jonathan; Cerulli, Andrea; del Pino, Rafael; Groth, Jens; Lyubashevsky, Vadim 32 2018 Non-interactive and reusable non-malleable commitment schemes. Zbl 1192.94116 Damgard, Ivan; Groth, Jens 32 2003 Linear-time zero-knowledge proofs for arithmetic circuit satisfiability. Zbl 1417.94046 Bootle, Jonathan; Cerulli, Andrea; Ghadafi, Essam; Groth, Jens; Hajiabadi, Mohammad; Jakobsen, Sune K. 29 2017 Ring signatures of sub-linear size without random oracles. Zbl 1171.94364 Chandran, Nishanth; Groth, Jens; Sahai, Amit 28 2007 Separating short structure-preserving signatures from non-interactive assumptions. Zbl 1227.94070 Abe, Masayuki; Groth, Jens; Ohkubo, Miyako 25 2011 Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs. Zbl 1332.94066 Gentry, Craig; Groth, Jens; Ishai, Yuval; Peikert, Chris; Sahai, Amit; Smith, Adam 24 2015 Linear algebra with sub-linear zero-knowledge arguments. Zbl 1252.94068 Groth, Jens 24 2009 Cryptography in the multi-string model. Zbl 1215.94048 Groth, Jens; Ostrovsky, Rafail 23 2007 Structure-preserving signatures and commitments to group elements. Zbl 1355.94042 Abe, Masayuki; Fuchsbauer, Georg; Groth, Jens; Haralambiev, Kristiyan; Ohkubo, Miyako 23 2016 Rerandomizable and replayable adaptive chosen ciphertext attack secure cryptosystems. Zbl 1197.94188 Groth, Jens 21 2004 Non-interactive zero-knowledge arguments for voting. Zbl 1126.68397 Groth, Jens 20 2005 A non-interactive shuffle with pairing based verifiability. Zbl 1153.94387 Groth, Jens; Lu, Steve 19 2007 Unified, minimal and selectively randomizable structure-preserving signatures. Zbl 1326.94067 Abe, Masayuki; Groth, Jens; Ohkubo, Miyako; Tibouchi, Mehdi 19 2014 Efficient zero-knowledge arguments from two-tiered homomorphic commitments. Zbl 1227.94047 Groth, Jens 18 2011 Group signatures: better efficiency and new theoretical aspects. Zbl 1116.94310 Camenisch, Jan; Groth, Jens 17 2005 Sub-linear zero-knowledge argument for correctness of a shuffle. Zbl 1149.94319 Groth, Jens; Ishai, Yuval 15 2008 Linear-time arguments with sublinear verification from tensor codes. Zbl 1493.68156 Bootle, Jonathan; Chiesa, Alessandro; Groth, Jens 15 2020 A verifiable secret shuffle of homomorphic encryptions. Zbl 1033.94527 Groth, Jens 14 2002 Efficient fully structure-preserving signatures for large messages. Zbl 1396.94079 Groth, Jens 14 2015 Making Sigma-protocols non-interactive without random oracles. Zbl 1345.94051 Chaidos, Pyrros; Groth, Jens 14 2015 Short non-interactive zero-knowledge proofs. Zbl 1253.94050 Groth, Jens 14 2010 Zero-knowledge argument for polynomial evaluation with application to blacklists. Zbl 1300.94040 Bayer, Stephanie; Groth, Jens 14 2013 Evaluating security of voting schemes in the universal composability framework. Zbl 1103.68515 Groth, Jens 12 2004 A verifiable secret shuffle of homomorphic encryptions. Zbl 1201.94086 Groth, Jens 12 2010 Structure-preserving signatures from type II pairings. Zbl 1345.94029 Abe, Masayuki; Groth, Jens; Ohkubo, Miyako; Tibouchi, Mehdi 11 2014 Efficient maximal privacy in boardroom voting and anonymous broadcast. Zbl 1105.94305 Groth, Jens 10 2004 Cryptography in subgroups of \(\mathbb Z^*_n\). Zbl 1079.94548 Groth, Jens 10 2005 Arya: nearly linear-time zero-knowledge proofs for correct program execution. Zbl 1446.94108 Bootle, Jonathan; Cerulli, Andrea; Groth, Jens; Jakobsen, Sune; Maller, Mary 9 2018 Verifiable shuffle of large size ciphertexts. Zbl 1161.94401 Groth, Jens; Lu, Steve 8 2007 Converting cryptographic schemes from symmetric to asymmetric bilinear groups. Zbl 1343.94036 Abe, Masayuki; Groth, Jens; Ohkubo, Miyako; Tango, Takeya 8 2014 Efficient batch zero-knowledge arguments for low degree polynomials. Zbl 1420.94040 Bootle, Jonathan; Groth, Jens 7 2018 Cryptography in the multi-string model. Zbl 1302.94050 Groth, Jens; Ostrovsky, Rafail 6 2014 Towards a classification of non-interactive computational assumptions in cyclic groups. Zbl 1380.94092 Ghadafi, Essam; Groth, Jens 6 2017 Multi-query computationally-private information retrieval with constant communication rate. Zbl 1279.94080 Groth, Jens; Kiayias, Aggelos; Lipmaa, Helger 6 2010 Foundations of fully dynamic group signatures. Zbl 1453.94063 Bootle, Jonathan; Cerulli, Andrea; Chaidos, Pyrros; Ghadafi, Essam; Groth, Jens 4 2020 On the security of ECDSA with additive key derivation and presignatures. Zbl 1496.94046 Groth, Jens; Shoup, Victor 2 2022 An adaptively secure mix-net without erasures. Zbl 1133.94351 Wikström, Douglas; Groth, Jens 1 2006 Cryptography and coding. 15th IMA international conference, IMACC 2015, Oxford, UK, December 15–17, 2015. Proceedings. Zbl 1326.94007 1 2015 Efficient fully structure-preserving signatures and shrinking commitments. Zbl 1466.94018 Abe, Masayuki; Groth, Jens; Kohlweiss, Markulf; Ohkubo, Miyako; Tibouchi, Mehdi 1 2019 On the security of ECDSA with additive key derivation and presignatures. Zbl 1496.94046 Groth, Jens; Shoup, Victor 2 2022 Linear-time arguments with sublinear verification from tensor codes. Zbl 1493.68156 Bootle, Jonathan; Chiesa, Alessandro; Groth, Jens 15 2020 Foundations of fully dynamic group signatures. Zbl 1453.94063 Bootle, Jonathan; Cerulli, Andrea; Chaidos, Pyrros; Ghadafi, Essam; Groth, Jens 4 2020 Efficient fully structure-preserving signatures and shrinking commitments. Zbl 1466.94018 Abe, Masayuki; Groth, Jens; Kohlweiss, Markulf; Ohkubo, Miyako; Tibouchi, Mehdi 1 2019 Updatable and universal common reference strings with applications to zk-SNARKs. Zbl 1457.94137 Groth, Jens; Kohlweiss, Markulf; Maller, Mary; Meiklejohn, Sarah; Miers, Ian 48 2018 Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits. Zbl 1436.94040 Baum, Carsten; Bootle, Jonathan; Cerulli, Andrea; del Pino, Rafael; Groth, Jens; Lyubashevsky, Vadim 32 2018 Arya: nearly linear-time zero-knowledge proofs for correct program execution. Zbl 1446.94108 Bootle, Jonathan; Cerulli, Andrea; Groth, Jens; Jakobsen, Sune; Maller, Mary 9 2018 Efficient batch zero-knowledge arguments for low degree polynomials. Zbl 1420.94040 Bootle, Jonathan; Groth, Jens 7 2018 Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks. Zbl 1410.94077 Groth, Jens; Maller, Mary 38 2017 Linear-time zero-knowledge proofs for arithmetic circuit satisfiability. Zbl 1417.94046 Bootle, Jonathan; Cerulli, Andrea; Ghadafi, Essam; Groth, Jens; Hajiabadi, Mohammad; Jakobsen, Sune K. 29 2017 Towards a classification of non-interactive computational assumptions in cyclic groups. Zbl 1380.94092 Ghadafi, Essam; Groth, Jens 6 2017 On the size of pairing-based non-interactive arguments. Zbl 1369.94539 Groth, Jens 157 2016 Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. Zbl 1369.94520 Bootle, Jonathan; Cerulli, Andrea; Chaidos, Pyrros; Groth, Jens; Petit, Christophe 108 2016 Foundations of fully dynamic group signatures. Zbl 1346.94141 Bootle, Jonathan; Cerulli, Andrea; Chaidos, Pyrros; Ghadafi, Essam; Groth, Jens 34 2016 Structure-preserving signatures and commitments to group elements. Zbl 1355.94042 Abe, Masayuki; Fuchsbauer, Georg; Groth, Jens; Haralambiev, Kristiyan; Ohkubo, Miyako 23 2016 One-out-of-many proofs: or how to leak a secret and spend a coin. Zbl 1371.94639 Groth, Jens; Kohlweiss, Markulf 51 2015 Short accountable ring signatures based on DDH. Zbl 1499.94054 Bootle, Jonathan; Cerulli, Andrea; Chaidos, Pyrros; Ghadafi, Essam; Groth, Jens; Petit, Christophe 35 2015 Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs. Zbl 1332.94066 Gentry, Craig; Groth, Jens; Ishai, Yuval; Peikert, Chris; Sahai, Amit; Smith, Adam 24 2015 Efficient fully structure-preserving signatures for large messages. Zbl 1396.94079 Groth, Jens 14 2015 Making Sigma-protocols non-interactive without random oracles. Zbl 1345.94051 Chaidos, Pyrros; Groth, Jens 14 2015 Cryptography and coding. 15th IMA international conference, IMACC 2015, Oxford, UK, December 15–17, 2015. Proceedings. Zbl 1326.94007 1 2015 Square span programs with applications to succinct NIZK arguments. Zbl 1306.94042 Danezis, George; Fournet, Cédric; Groth, Jens; Kohlweiss, Markulf 50 2014 Fine-tuning Groth-Sahai proofs. Zbl 1335.94047 Escala, Alex; Groth, Jens 32 2014 Unified, minimal and selectively randomizable structure-preserving signatures. Zbl 1326.94067 Abe, Masayuki; Groth, Jens; Ohkubo, Miyako; Tibouchi, Mehdi 19 2014 Structure-preserving signatures from type II pairings. Zbl 1345.94029 Abe, Masayuki; Groth, Jens; Ohkubo, Miyako; Tibouchi, Mehdi 11 2014 Converting cryptographic schemes from symmetric to asymmetric bilinear groups. Zbl 1343.94036 Abe, Masayuki; Groth, Jens; Ohkubo, Miyako; Tango, Takeya 8 2014 Cryptography in the multi-string model. Zbl 1302.94050 Groth, Jens; Ostrovsky, Rafail 6 2014 Zero-knowledge argument for polynomial evaluation with application to blacklists. Zbl 1300.94040 Bayer, Stephanie; Groth, Jens 14 2013 New techniques for noninteractive zero-knowledge. Zbl 1281.68102 Groth, Jens; Ostrovsky, Rafail; Sahai, Amit 81 2012 Efficient noninteractive proof systems for bilinear groups. Zbl 1259.94048 Groth, Jens; Sahai, Amit 50 2012 Efficient zero-knowledge argument for correctness of a shuffle. Zbl 1297.94045 Bayer, Stephanie; Groth, Jens 38 2012 Optimal structure-preserving signatures in asymmetric bilinear groups. Zbl 1290.94038 Abe, Masayuki; Groth, Jens; Haralambiev, Kristiyan; Ohkubo, Miyako 43 2011 Separating short structure-preserving signatures from non-interactive assumptions. Zbl 1227.94070 Abe, Masayuki; Groth, Jens; Ohkubo, Miyako 25 2011 Efficient zero-knowledge arguments from two-tiered homomorphic commitments. Zbl 1227.94047 Groth, Jens 18 2011 Short pairing-based non-interactive zero-knowledge arguments. Zbl 1253.94049 Groth, Jens 134 2010 Structure-preserving signatures and commitments to group elements. Zbl 1280.94102 Abe, Masayuki; Fuchsbauer, Georg; Groth, Jens; Haralambiev, Kristiyan; Ohkubo, Miyako 85 2010 Short non-interactive zero-knowledge proofs. Zbl 1253.94050 Groth, Jens 14 2010 A verifiable secret shuffle of homomorphic encryptions. Zbl 1201.94086 Groth, Jens 12 2010 Multi-query computationally-private information retrieval with constant communication rate. Zbl 1279.94080 Groth, Jens; Kiayias, Aggelos; Lipmaa, Helger 6 2010 Linear algebra with sub-linear zero-knowledge arguments. Zbl 1252.94068 Groth, Jens 24 2009 Efficient non-interactive proof systems for bilinear groups. Zbl 1149.94320 Groth, Jens; Sahai, Amit 248 2008 Sub-linear zero-knowledge argument for correctness of a shuffle. Zbl 1149.94319 Groth, Jens; Ishai, Yuval 15 2008 Fully anonymous group signatures without random oracles. Zbl 1153.94386 Groth, Jens 53 2007 Ring signatures of sub-linear size without random oracles. Zbl 1171.94364 Chandran, Nishanth; Groth, Jens; Sahai, Amit 28 2007 Cryptography in the multi-string model. Zbl 1215.94048 Groth, Jens; Ostrovsky, Rafail 23 2007 A non-interactive shuffle with pairing based verifiability. Zbl 1153.94387 Groth, Jens; Lu, Steve 19 2007 Verifiable shuffle of large size ciphertexts. Zbl 1161.94401 Groth, Jens; Lu, Steve 8 2007 Perfect non-interactive zero knowledge for NP. Zbl 1129.94025 Groth, Jens; Ostrovsky, Rafail; Sahai, Amit 117 2006 Simulation-sound NIZK proofs for a practical language and constant size group signatures. Zbl 1172.94615 Groth, Jens 112 2006 Non-interactive ZAPs and new techniques for NIZK. Zbl 1129.94024 Groth, Jens; Ostrovsky, Rafail; Sahai, Amit 69 2006 An adaptively secure mix-net without erasures. Zbl 1133.94351 Wikström, Douglas; Groth, Jens 1 2006 Non-interactive zero-knowledge arguments for voting. Zbl 1126.68397 Groth, Jens 20 2005 Group signatures: better efficiency and new theoretical aspects. Zbl 1116.94310 Camenisch, Jan; Groth, Jens 17 2005 Cryptography in subgroups of \(\mathbb Z^*_n\). Zbl 1079.94548 Groth, Jens 10 2005 Rerandomizable and replayable adaptive chosen ciphertext attack secure cryptosystems. Zbl 1197.94188 Groth, Jens 21 2004 Evaluating security of voting schemes in the universal composability framework. Zbl 1103.68515 Groth, Jens 12 2004 Efficient maximal privacy in boardroom voting and anonymous broadcast. Zbl 1105.94305 Groth, Jens 10 2004 Non-interactive and reusable non-malleable commitment schemes. Zbl 1192.94116 Damgard, Ivan; Groth, Jens 32 2003 A verifiable secret shuffle of homomorphic encryptions. Zbl 1033.94527 Groth, Jens 14 2002 all cited Publications top 5 cited Publications all top 5 Cited by 1,193 Authors 26 Libert, Benoît 25 Chiesa, Alessandro 25 Susilo, Willy 23 Sahai, Amit 21 Hofheinz, Dennis 19 Fiore, Dario 19 Lipmaa, Helger 18 Slamanig, Daniel 17 Ishai, Yuval 17 Nguyen, Khoa 17 Pointcheval, David 16 Abe, Masayuki 16 Fuchsbauer, Georg 16 Hanaoka, Goichiro 16 Rothblum, Ron D. 16 Wang, Huaxiong 16 Yung, Moti 15 Faonio, Antonio 15 Khurana, Dakshita 15 Pan, Jiaxin 15 Ràfols, Carla 14 Bootle, Jonathan 14 Couteau, Geoffroy 14 Katsumata, Shuichi 14 Kohlweiss, Markulf 14 Visconti, Ivan 13 Garg, Sanjam 13 Groth, Jens 13 Ohkubo, Miyako 13 Ostrovsky, Rafail 13 Pass, Rafael 13 Siim, Janno 13 Waters, Brent 13 Zajac, Michal 12 Bitansky, Nir 12 Canetti, Ran 12 Lyubashevsky, Vadim 12 Malavolta, Giulio 12 Matsuda, Takahiro 12 Spooner, Nicholas 12 Tanaka, Keisuke 12 Yamakawa, Takashi 11 Blazy, Olivier 11 Boneh, Dan 11 Kiayias, Aggelos 11 Ling, San 11 Nishimaki, Ryo 11 Peters, Thomas D. 11 Segev, Gil 11 Shi, Elaine 11 Venturi, Daniele 11 Wu, David J. 11 Yamada, Shota 10 Campanelli, Matteo 10 Ghadafi, Essam M. 10 Hazay, Carmit 10 Liu, Joseph K. K. 10 Seiler, Gregor 10 Tauman Kalai, Yael 10 Wang, Yuyu 9 Attema, Thomas 9 Baghery, Karim 9 Ganesh, Chaya 9 Gu, Dawu 9 Jain, Abhishek 9 Lin, Huijia 9 Maller, Mary 9 Nielsen, Jesper Buus 9 Nitulescu, Anca 9 Paneth, Omer 9 Wichs, Daniel 9 Yang, Guomin 8 Abdolmaleki, Behzad 8 Ben-Sasson, Eli 8 Benhamouda, Fabrice 8 Boyle, Elette 8 Fukushima, Kazuhide 8 Jager, Tibor 8 Liu, Shengli 8 Orlandi, Claudio 8 Rosen, Alon 8 Venkitasubramaniam, Muthuramakrishnan 8 Vergnaud, Damien 7 Camenisch, Jan L. 7 Döttling, Nico 7 Emura, Keita 7 González, Alonso 7 Guo, Fuchun 7 Han, Shuai 7 Huang, Qiong 7 Kiltz, Eike 7 Kolonelos, Dimitris 7 Prabhakaran, Manoj M. 7 Schröder, Dominique 7 Wee, Hoeteck 7 Xu, Yanhong 6 Badrinarayanan, Saikrishna 6 Bünz, Benedikt 6 Catalano, Dario 6 Chaidos, Pyrros ...and 1,093 more Authors all top 5 Cited in 32 Serials 62 Journal of Cryptology 33 Theoretical Computer Science 32 Designs, Codes and Cryptography 14 Information Sciences 6 SIAM Journal on Computing 3 Algorithmica 3 Prikladnaya Diskretnaya Matematika 2 Information and Computation 2 Journal of the ACM 2 Interdisciplinary Information Sciences (IIS) 2 Journal of Shanghai Jiaotong University (Science) 2 Journal of Mathematical Cryptology 2 Advances in Mathematics of Communications 2 Matematicheskie Voprosy Kriptografii 1 Acta Informatica 1 Discrete Applied Mathematics 1 Information Processing Letters 1 Applied Mathematics and Computation 1 Journal of Number Theory 1 Journal of Automated Reasoning 1 International Journal of Computer Mathematics 1 Distributed Computing 1 Applicable Algebra in Engineering, Communication and Computing 1 Cybernetics and Systems Analysis 1 Computational Complexity 1 Tatra Mountains Mathematical Publications 1 Finite Fields and their Applications 1 Journal of Applied Mathematics 1 Sādhanā 1 Oberwolfach Reports 1 Science China. Information Sciences 1 Mathematical Foundations of Computing all top 5 Cited in 12 Fields 918 Information and communication theory, circuits (94-XX) 274 Computer science (68-XX) 34 Quantum theory (81-XX) 26 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 18 Number theory (11-XX) 12 Algebraic geometry (14-XX) 3 Combinatorics (05-XX) 2 General and overarching topics; collections (00-XX) 2 Numerical analysis (65-XX) 2 Operations research, mathematical programming (90-XX) 1 Mathematical logic and foundations (03-XX) 1 Linear and multilinear algebra; matrix theory (15-XX) Citations by Year