×

zbMATH — the first resource for mathematics

Arora, Sanjeev

Compute Distance To:
Author ID: arora.sanjeev Recent zbMATH articles by "Arora, Sanjeev"
Published as: Arora, Sanjeev; Arora, S.
External Links: IdRef · MGP · Wikidata · GND
Documents Indexed: 72 Publications since 1992, including 2 Books

Publications by Year

Citations contained in zbMATH Open

57 Publications have been cited 1,789 times in 1,430 Documents Cited by Year
Computational complexity. A modern approach. Zbl 1193.68112
Arora, Sanjeev; Barak, Boaz
325
2009
Proof verification and the hardness of approximation problems. Zbl 1065.68570
Arora, Sanjeev; Lund, Carsten; Motwani, Rajeev; Sudan, Madhu; Szegedy, Mario
203
1998
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. Zbl 1064.90566
Arora, Sanjeev
157
1998
Proof verification and hardness of approximation problems. Zbl 0977.68539
Arora, Sanjeev; Lund, Carsten; Motwani, Rajeev; Sudan, Madhu; Szegedy, Mario
149
1992
Probabilistic checking of proofs: a new characterization of NP. Zbl 0903.68076
Arora, Sanjeev; Safra, Shmuel
128
1998
The multiplicative weights update method: a meta-algorithm and applications. Zbl 1283.68414
Arora, Sanjeev; Hazan, Elad; Kale, Satyen
75
2012
The hardness of approximate optima in lattices, codes, and systems of linear equations. Zbl 0877.68067
Arora, Sanjeev; Babai, László; Stern, Jacques; Sweedyk, Z.
56
1997
Expander flows, geometric embeddings and graph partitioning. Zbl 1325.68255
Arora, Sanjeev; Rao, Satish; Vazirani, Umesh
51
2009
Expander flows, geometric embeddings and graph partitioning. Zbl 1192.68467
Arora, Sanjeev; Rao, Satish; Vazirani, Umesh
45
2004
Probabilistic checking of proofs; a new characterization of NP. Zbl 0945.68516
Arora, Sanjeev; Safra, Shmuel
43
1992
Approximation schemes for Euclidean \(k\)-medians and related problems. Zbl 1027.68979
Arora, Sanjeev; Raghavan, Prabhakar; Rao, Satish
43
1998
Polynomial time approximation schemes for dense instances of NP-hard problems. Zbl 0968.68534
Arora, Sanjeev; Karger, David; Karpinski, Marek
42
1995
Computing a nonnegative matrix factorization – provably. Zbl 1286.15014
Arora, Sanjeev; Ge, Rong; Kannan, Ravindran; Moitra, Ankur
41
2012
Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems. Zbl 0937.68160
Arora, Sanjeev; Karger, David; Karpinski, Marek
35
1999
Subexponential algorithms for unique games and related problems. Zbl 1426.05159
Arora, Sanjeev; Barak, Boaz; Steurer, David
27
2015
Euclidean distortion and the sparsest cut. Zbl 1132.68070
Arora, Sanjeev; Lee, James R.; Naor, Assaf
27
2008
Improved low-degree testing and its applications. Zbl 1101.68572
Arora, Sanjeev; Sudan, Madhu
26
2003
New algorithms for learning in presence of errors. Zbl 1332.68099
Arora, Sanjeev; Ge, Rong
22
2011
A polynomial-time approximation scheme for weighted planar graph TSP. Zbl 0930.68104
Arora, Sanjeev; Grigni, Michelangelo; Karger, David; Klein, Philip; Woloszyn, Andrzej
22
1998
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. Zbl 1154.90602
Arora, Sanjeev; Frieze, Alan; Kaplan, Haim
21
2002
Improved low degree testing and its applications. Zbl 0968.68145
Arora, Sanjeev; Sudan, Madhu
19
1999
Approximation schemes for NP-hard geometric optimization problems: a survey. Zbl 1035.90113
Arora, Sanjeev
19
2003
Proving integrality gaps without knowing the linear program. Zbl 1213.68306
Arora, Sanjeev; Bollobás, Béla; Lovász, László; Tourlakis, Iannis
16
2006
Page replacement for general caching problems. Zbl 0934.68104
Albers, Susanne; Arora, Sanjeev; Khanna, Sanjeev
15
1999
Euclidean distortion and the sparsest cut (extended abstract). Zbl 1192.68870
Arora, Sanjeev; Lee, James R.; Naor, Assaf
15
2005
A combinatorial, primal-dual approach to semidefinite programs. Zbl 1232.68177
Arora, Sanjeev; Kale, Satyen
12
2007
A \(2 + \varepsilon\) approximation algorithm for the \(k\)-MST problem. Zbl 0961.68104
Arora, Sanjeev; Karakostas, George
11
2000
New approximation guarantee for chromatic number. Zbl 1301.05324
Arora, Sanjeev; Chlamtac, Eden
11
2006
Learning mixtures of separated nonspherical Gaussians. Zbl 1059.62062
Arora, Sanjeev; Kannan, Ravi
9
2005
A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem. Zbl 1111.90101
Arora, Sanjeev; Karakostas, George
9
2006
Approximation schemes for degree-restricted MST and red-blue separation problems. Zbl 1082.68125
Arora, Sanjeev; Chang, Kevin
9
2004
Approximation schemes for minimum latency problems. Zbl 1047.68166
Arora, Sanjeev; Karakostas, George
9
2003
Unique games on expanding constraint graphs are easy (extended abstract). Zbl 1231.68147
Arora, Sanjeev; Khot, Subrash A.; Kolla, Alexandra; Steurer, David; Yulsiani, Madhur; Vishnoi, Nisheeth K.
9
2008
\(O(\sqrt{\log n})\) approximation to sparsest cut in \(\tilde{O}(n^2)\) time. Zbl 1207.68441
Arora, Sanjeev; Hazan, Elad; Kale, Satyen
9
2010
A fast random sampling algorithm for sparsifying matrices. Zbl 1155.68567
Arora, Sanjeev; Hazan, Elad; Kale, Satyen
8
2006
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. (Abstract). Zbl 0911.90333
Arora, Sanjeev
7
1998
Simulating quadratic dynamical systems is PSPACE-complete (preliminary version). Zbl 1345.68150
Arora, Sanjeev; Rabani, Yuval; Vazirani, Umesh
5
1994
On winning strategies in Ehrenfeucht-Fraïssé games. Zbl 0903.68079
Arora, Sanjeev; Fagin, Ronald
5
1997
The approximability of NP-hard problems. Zbl 1028.68065
Arora, Sanjeev
5
1998
On-line algorithms for path selection in a nonblocking network. Zbl 0852.68004
Arora, Sanjeev; Leighton, F. T.; Maggs, Bruce M.
5
1996
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy. Zbl 1192.90123
Alekhnovich, Mikhail; Arora, Sanjeev; Tourlakis, Iannis
5
2005
Approximation algorithms for geometric TSP. Zbl 1113.90347
Arora, Sanjeev
4
2002
Approximation schemes for minimum latency problems. Zbl 1345.90110
Arora, Sanjeev; Karakostas, George
4
1999
Fréchet embeddings of negative type metrics. Zbl 1136.46008
Arora, Sanjeev; Lee, James R.; Naor, Assaf
4
2007
Provable ICA with unknown Gaussian noise, and implications for Gaussian mixtures and autoencoders. Zbl 1333.68224
Arora, Sanjeev; Ge, Rong; Moitra, Ankur; Sachdeva, Sushant
4
2015
Fitting algebraic curves to noisy data. Zbl 1090.68576
Arora, Sanjeev; Khot, Subhash
3
2003
Local versus global properties of metric spaces. Zbl 1291.90195
Arora, Sanjeev; Lovász, László; Newman, Ilan; Rabani, Yuval; Rabinovich, Yuri; Vempala, Santosh
3
2012
Towards a study of low-complexity graphs. Zbl 1248.68365
Arora, Sanjeev; Steurer, David; Wigderson, Avi
3
2009
Towards strong nonapproximability results in the Lovász-Schrijver hierarchy. Zbl 1252.68131
Alekhnovich, Mikhail; Arora, Sanjeev; Tourlakis, Iannis
2
2011
Computing a nonnegative matrix factorization – provably. Zbl 1350.68123
Arora, Sanjeev; Ge, Rong; Kannan, Ravi; Moitra, Ankur
2
2016
Local versus global properties of metric spaces (extended abstract). Zbl 1192.90155
Arora, Sanjeev; Lovász, László; Newman, Ilan; Rabani, Yuval; Rabinovich, Yuri; Vempala, Santosh
2
2006
New tools for graph coloring. Zbl 1343.68104
Arora, Sanjeev; Ge, Rong
2
2011
A combinatorial, primal-dual approach to semidefinite programs. Zbl 1426.68301
Arora, Sanjeev; Kale, Satyen
2
2016
Provable learning of noisy-or networks. Zbl 1369.68274
Arora, Sanjeev; Ge, Rong; Ma, Tengyu; Risteski, Andrej
1
2017
Approximation schemes for degree-restricted MST and red-blue separation problem. Zbl 1039.68165
Arora, Sanjeev; Chang, Kevin L.
1
2003
A randomized online algorithm for bandwidth utilization. Zbl 1093.68535
Arora, Sanjeev; Brnkman, Bo
1
2002
How NP got a new definition: A survey of probabilistically checkable proofs. Zbl 1001.68049
Arora, Sanjeev
1
2002
Provable learning of noisy-or networks. Zbl 1369.68274
Arora, Sanjeev; Ge, Rong; Ma, Tengyu; Risteski, Andrej
1
2017
Computing a nonnegative matrix factorization – provably. Zbl 1350.68123
Arora, Sanjeev; Ge, Rong; Kannan, Ravi; Moitra, Ankur
2
2016
A combinatorial, primal-dual approach to semidefinite programs. Zbl 1426.68301
Arora, Sanjeev; Kale, Satyen
2
2016
Subexponential algorithms for unique games and related problems. Zbl 1426.05159
Arora, Sanjeev; Barak, Boaz; Steurer, David
27
2015
Provable ICA with unknown Gaussian noise, and implications for Gaussian mixtures and autoencoders. Zbl 1333.68224
Arora, Sanjeev; Ge, Rong; Moitra, Ankur; Sachdeva, Sushant
4
2015
The multiplicative weights update method: a meta-algorithm and applications. Zbl 1283.68414
Arora, Sanjeev; Hazan, Elad; Kale, Satyen
75
2012
Computing a nonnegative matrix factorization – provably. Zbl 1286.15014
Arora, Sanjeev; Ge, Rong; Kannan, Ravindran; Moitra, Ankur
41
2012
Local versus global properties of metric spaces. Zbl 1291.90195
Arora, Sanjeev; Lovász, László; Newman, Ilan; Rabani, Yuval; Rabinovich, Yuri; Vempala, Santosh
3
2012
New algorithms for learning in presence of errors. Zbl 1332.68099
Arora, Sanjeev; Ge, Rong
22
2011
Towards strong nonapproximability results in the Lovász-Schrijver hierarchy. Zbl 1252.68131
Alekhnovich, Mikhail; Arora, Sanjeev; Tourlakis, Iannis
2
2011
New tools for graph coloring. Zbl 1343.68104
Arora, Sanjeev; Ge, Rong
2
2011
\(O(\sqrt{\log n})\) approximation to sparsest cut in \(\tilde{O}(n^2)\) time. Zbl 1207.68441
Arora, Sanjeev; Hazan, Elad; Kale, Satyen
9
2010
Computational complexity. A modern approach. Zbl 1193.68112
Arora, Sanjeev; Barak, Boaz
325
2009
Expander flows, geometric embeddings and graph partitioning. Zbl 1325.68255
Arora, Sanjeev; Rao, Satish; Vazirani, Umesh
51
2009
Towards a study of low-complexity graphs. Zbl 1248.68365
Arora, Sanjeev; Steurer, David; Wigderson, Avi
3
2009
Euclidean distortion and the sparsest cut. Zbl 1132.68070
Arora, Sanjeev; Lee, James R.; Naor, Assaf
27
2008
Unique games on expanding constraint graphs are easy (extended abstract). Zbl 1231.68147
Arora, Sanjeev; Khot, Subrash A.; Kolla, Alexandra; Steurer, David; Yulsiani, Madhur; Vishnoi, Nisheeth K.
9
2008
A combinatorial, primal-dual approach to semidefinite programs. Zbl 1232.68177
Arora, Sanjeev; Kale, Satyen
12
2007
Fréchet embeddings of negative type metrics. Zbl 1136.46008
Arora, Sanjeev; Lee, James R.; Naor, Assaf
4
2007
Proving integrality gaps without knowing the linear program. Zbl 1213.68306
Arora, Sanjeev; Bollobás, Béla; Lovász, László; Tourlakis, Iannis
16
2006
New approximation guarantee for chromatic number. Zbl 1301.05324
Arora, Sanjeev; Chlamtac, Eden
11
2006
A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem. Zbl 1111.90101
Arora, Sanjeev; Karakostas, George
9
2006
A fast random sampling algorithm for sparsifying matrices. Zbl 1155.68567
Arora, Sanjeev; Hazan, Elad; Kale, Satyen
8
2006
Local versus global properties of metric spaces (extended abstract). Zbl 1192.90155
Arora, Sanjeev; Lovász, László; Newman, Ilan; Rabani, Yuval; Rabinovich, Yuri; Vempala, Santosh
2
2006
Euclidean distortion and the sparsest cut (extended abstract). Zbl 1192.68870
Arora, Sanjeev; Lee, James R.; Naor, Assaf
15
2005
Learning mixtures of separated nonspherical Gaussians. Zbl 1059.62062
Arora, Sanjeev; Kannan, Ravi
9
2005
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy. Zbl 1192.90123
Alekhnovich, Mikhail; Arora, Sanjeev; Tourlakis, Iannis
5
2005
Expander flows, geometric embeddings and graph partitioning. Zbl 1192.68467
Arora, Sanjeev; Rao, Satish; Vazirani, Umesh
45
2004
Approximation schemes for degree-restricted MST and red-blue separation problems. Zbl 1082.68125
Arora, Sanjeev; Chang, Kevin
9
2004
Improved low-degree testing and its applications. Zbl 1101.68572
Arora, Sanjeev; Sudan, Madhu
26
2003
Approximation schemes for NP-hard geometric optimization problems: a survey. Zbl 1035.90113
Arora, Sanjeev
19
2003
Approximation schemes for minimum latency problems. Zbl 1047.68166
Arora, Sanjeev; Karakostas, George
9
2003
Fitting algebraic curves to noisy data. Zbl 1090.68576
Arora, Sanjeev; Khot, Subhash
3
2003
Approximation schemes for degree-restricted MST and red-blue separation problem. Zbl 1039.68165
Arora, Sanjeev; Chang, Kevin L.
1
2003
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. Zbl 1154.90602
Arora, Sanjeev; Frieze, Alan; Kaplan, Haim
21
2002
Approximation algorithms for geometric TSP. Zbl 1113.90347
Arora, Sanjeev
4
2002
A randomized online algorithm for bandwidth utilization. Zbl 1093.68535
Arora, Sanjeev; Brnkman, Bo
1
2002
How NP got a new definition: A survey of probabilistically checkable proofs. Zbl 1001.68049
Arora, Sanjeev
1
2002
A \(2 + \varepsilon\) approximation algorithm for the \(k\)-MST problem. Zbl 0961.68104
Arora, Sanjeev; Karakostas, George
11
2000
Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems. Zbl 0937.68160
Arora, Sanjeev; Karger, David; Karpinski, Marek
35
1999
Improved low degree testing and its applications. Zbl 0968.68145
Arora, Sanjeev; Sudan, Madhu
19
1999
Page replacement for general caching problems. Zbl 0934.68104
Albers, Susanne; Arora, Sanjeev; Khanna, Sanjeev
15
1999
Approximation schemes for minimum latency problems. Zbl 1345.90110
Arora, Sanjeev; Karakostas, George
4
1999
Proof verification and the hardness of approximation problems. Zbl 1065.68570
Arora, Sanjeev; Lund, Carsten; Motwani, Rajeev; Sudan, Madhu; Szegedy, Mario
203
1998
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. Zbl 1064.90566
Arora, Sanjeev
157
1998
Probabilistic checking of proofs: a new characterization of NP. Zbl 0903.68076
Arora, Sanjeev; Safra, Shmuel
128
1998
Approximation schemes for Euclidean \(k\)-medians and related problems. Zbl 1027.68979
Arora, Sanjeev; Raghavan, Prabhakar; Rao, Satish
43
1998
A polynomial-time approximation scheme for weighted planar graph TSP. Zbl 0930.68104
Arora, Sanjeev; Grigni, Michelangelo; Karger, David; Klein, Philip; Woloszyn, Andrzej
22
1998
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. (Abstract). Zbl 0911.90333
Arora, Sanjeev
7
1998
The approximability of NP-hard problems. Zbl 1028.68065
Arora, Sanjeev
5
1998
The hardness of approximate optima in lattices, codes, and systems of linear equations. Zbl 0877.68067
Arora, Sanjeev; Babai, László; Stern, Jacques; Sweedyk, Z.
56
1997
On winning strategies in Ehrenfeucht-Fraïssé games. Zbl 0903.68079
Arora, Sanjeev; Fagin, Ronald
5
1997
On-line algorithms for path selection in a nonblocking network. Zbl 0852.68004
Arora, Sanjeev; Leighton, F. T.; Maggs, Bruce M.
5
1996
Polynomial time approximation schemes for dense instances of NP-hard problems. Zbl 0968.68534
Arora, Sanjeev; Karger, David; Karpinski, Marek
42
1995
Simulating quadratic dynamical systems is PSPACE-complete (preliminary version). Zbl 1345.68150
Arora, Sanjeev; Rabani, Yuval; Vazirani, Umesh
5
1994
Proof verification and hardness of approximation problems. Zbl 0977.68539
Arora, Sanjeev; Lund, Carsten; Motwani, Rajeev; Sudan, Madhu; Szegedy, Mario
149
1992
Probabilistic checking of proofs; a new characterization of NP. Zbl 0945.68516
Arora, Sanjeev; Safra, Shmuel
43
1992
all top 5

Cited by 2,456 Authors

20 Paschos, Vangelis Th.
13 Naor, Assaf
12 Khachay, Mikhail Yur’evich
11 Karpinski, Marek
11 Trevisan, Luca
10 Hajiaghayi, Mohammad Taghi
10 Khot, Subhash Ajit
9 Elbassioni, Khaled M.
9 Goldreich, Oded
9 Håstad, Johan Torkel
8 Arora, Sanjeev
8 Ben-Sasson, Eli
8 Czumaj, Artur
8 Dinur, Irit
8 Escoffier, Bruno
8 Kortsarz, Guy
8 Nagarajan, Viswanath
8 Raman, Venkatesh
8 Sudan, Madhu
7 Alon, Noga M.
7 DasGupta, Bhaskar
7 Feige, Uriel
7 Gillis, Nicolas
7 Lee, James R.
7 Marathe, Madhav V.
7 Pokutta, Sebastian
7 Sitters, Rene A.
6 Chen, Jian-er
6 Chiesa, Alessandro
6 Drineas, Petros
6 Faria, Luerbio
6 Guruswami, Venkatesan
6 Halldórsson, Magnús Mar
6 Könemann, Jochen
6 Lingas, Andrzej
6 Lohrey, Markus
6 Neznakhina, Katherine
6 Pardalos, Panos M.
6 Ravi, Ramamoorthi
6 Ravi, S. S.
6 Rubinfeld, Ronitt
6 Vinodchandran, N. Variyam
6 Wigderson, Avi
5 Adamaszek, Anna
5 Allender, Eric W.
5 Bansal, Nikhil
5 Bazgan, Cristina
5 Böckenhauer, Hans-Joachim
5 Bourgeois, Nicolas
5 Cai, Jin-Yi
5 Chakraborty, Sankardeep
5 Demange, Marc
5 Feldmann, Andreas Emil
5 Fomin, Fedor V.
5 Fujito, Toshihiro
5 Hunt, Harry Bowen III
5 Jiang, Tao
5 Kann, Viggo
5 Khandekar, Rohit
5 Korman, Matias
5 Kurpisz, Adam
5 Levin, Asaf
5 Manurangsi, Pasin
5 Mathieu, Claire
5 Meer, Klaus
5 Mitchell, Joseph S. B.
5 Patel, Viresh
5 Raghavendra Rao, B. V.
5 Raghavendra, Prasad
5 Saket, Rishi
5 Sarma M. N., Jayalal
5 Tóth, Csaba D.
5 Wang, Lusheng
5 Woeginger, Gerhard Johannes
4 Alekhnovich, Michael
4 Arkin, Esther M.
4 Baartse, Martijn
4 Bhangale, Amey
4 Bonsma, Paul S.
4 Braun, Gábor
4 Broersma, Hajo J.
4 Butenko, Sergiy I.
4 Carmi, Paz
4 Černý, Michal
4 Charikar, Moses S.
4 Chekuri, Chandra S.
4 Chen, Wenbin
4 Chlamtac, Eden
4 Daneshgar, Amir
4 de Figueiredo, Celina M. Herrera
4 de Haan, Ronald
4 Dell, Holger
4 Dumitrescu, Adrian
4 Elkin, Michael
4 Engebretsen, Lars
4 Fekete, Sándor P.
4 Fernandez de la Vega, Wenceslas
4 Fortnow, Lance J.
4 Grandoni, Fabrizio
4 Grigorescu, Elena
...and 2,356 more Authors
all top 5

Cited in 238 Serials

119 Theoretical Computer Science
82 Algorithmica
62 Discrete Applied Mathematics
61 SIAM Journal on Computing
56 Information Processing Letters
54 Journal of Computer and System Sciences
33 Mathematical Programming. Series A. Series B
33 Computational Complexity
33 Journal of Combinatorial Optimization
29 Theory of Computing Systems
23 Computational Geometry
23 European Journal of Operational Research
22 Information and Computation
22 Random Structures & Algorithms
16 Discrete & Computational Geometry
14 Operations Research Letters
13 Linear Algebra and its Applications
13 Journal of Discrete Algorithms
12 SIAM Journal on Discrete Mathematics
11 Mathematics of Operations Research
10 Optimization Letters
9 Journal of Global Optimization
9 Annals of Mathematics and Artificial Intelligence
8 Artificial Intelligence
8 Machine Learning
7 Networks
7 Combinatorica
7 Annals of Pure and Applied Logic
7 Computers & Operations Research
7 SIAM Journal on Optimization
6 Discrete Mathematics
6 Journal of Cryptology
6 International Journal of Foundations of Computer Science
6 Bulletin of the American Mathematical Society. New Series
6 Journal of the ACM
6 Journal of Machine Learning Research (JMLR)
6 Discrete Optimization
6 Proceedings of the Steklov Institute of Mathematics
6 Logical Methods in Computer Science
6 Computer Science Review
5 The Annals of Statistics
5 Automatica
5 Information Sciences
5 Neural Computation
5 Designs, Codes and Cryptography
5 Journal of High Energy Physics
5 ACM Transactions on Computation Theory
4 Acta Informatica
4 Problems of Information Transmission
4 Operations Research
4 Transactions of the American Mathematical Society
4 Journal of Computer Science and Technology
4 International Journal of Approximate Reasoning
4 Annals of Operations Research
4 MSCS. Mathematical Structures in Computer Science
4 Computational Mathematics and Mathematical Physics
4 Journal of Mathematical Sciences (New York)
4 RAIRO. Operations Research
4 4OR
3 Communications in Mathematical Physics
3 Journal of Combinatorial Theory. Series B
3 Journal of Optimization Theory and Applications
3 Optimization
3 Journal of Automated Reasoning
3 SIAM Journal on Matrix Analysis and Applications
3 International Journal of Algebra and Computation
3 Cybernetics and Systems Analysis
3 Computational Optimization and Applications
3 Doklady Mathematics
3 Chicago Journal of Theoretical Computer Science
3 Journal of Scheduling
3 Annals of Mathematics. Second Series
3 Quantum Information Processing
3 Journal of Applied Logic
3 Electronic Journal of Statistics
3 Algorithms
2 Israel Journal of Mathematics
2 Journal of Mathematical Analysis and Applications
2 Journal of Mathematical Physics
2 Acta Mathematica
2 Advances in Mathematics
2 Applied Mathematics and Computation
2 The Journal of Symbolic Logic
2 Mathematische Annalen
2 Opsearch
2 Proceedings of the American Mathematical Society
2 Journal of Complexity
2 Journal of the American Mathematical Society
2 Neural Networks
2 International Journal of Computational Geometry & Applications
2 Annals of Physics
2 International Journal of Computer Mathematics
2 Proceedings of the National Academy of Sciences of the United States of America
2 SIAM Journal on Mathematical Analysis
2 Stochastic Processes and their Applications
2 Distributed Computing
2 Applicable Algebra in Engineering, Communication and Computing
2 Journal of Logic, Language and Information
2 International Journal of Computer Vision
2 Journal of Heuristics
...and 138 more Serials
all top 5

Cited in 47 Fields

985 Computer science (68-XX)
435 Operations research, mathematical programming (90-XX)
324 Combinatorics (05-XX)
113 Information and communication theory, circuits (94-XX)
65 Game theory, economics, finance, and other social and behavioral sciences (91-XX)
61 Mathematical logic and foundations (03-XX)
59 Statistics (62-XX)
50 Numerical analysis (65-XX)
44 Quantum theory (81-XX)
40 Linear and multilinear algebra; matrix theory (15-XX)
28 Biology and other natural sciences (92-XX)
21 Group theory and generalizations (20-XX)
20 Number theory (11-XX)
19 Probability theory and stochastic processes (60-XX)
18 Functional analysis (46-XX)
18 Convex and discrete geometry (52-XX)
12 Systems theory; control (93-XX)
11 Calculus of variations and optimal control; optimization (49-XX)
7 Manifolds and cell complexes (57-XX)
7 Statistical mechanics, structure of matter (82-XX)
7 Relativity and gravitational theory (83-XX)
6 General algebraic systems (08-XX)
6 Functions of a complex variable (30-XX)
6 Dynamical systems and ergodic theory (37-XX)
5 Order, lattices, ordered algebraic structures (06-XX)
5 Algebraic geometry (14-XX)
4 Geometry (51-XX)
3 General and overarching topics; collections (00-XX)
3 Commutative algebra (13-XX)
3 Abstract harmonic analysis (43-XX)
3 General topology (54-XX)
2 Measure and integration (28-XX)
2 Approximations and expansions (41-XX)
2 Operator theory (47-XX)
2 Mechanics of particles and systems (70-XX)
2 Optics, electromagnetic theory (78-XX)
1 Associative rings and algebras (16-XX)
1 Category theory; homological algebra (18-XX)
1 Topological groups, Lie groups (22-XX)
1 Several complex variables and analytic spaces (32-XX)
1 Ordinary differential equations (34-XX)
1 Partial differential equations (35-XX)
1 Harmonic analysis on Euclidean spaces (42-XX)
1 Differential geometry (53-XX)
1 Algebraic topology (55-XX)
1 Geophysics (86-XX)
1 Mathematics education (97-XX)

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.