Arora, Sanjeev

Compute Distance To:
 Author ID: arora.sanjeev Published as: Arora, Sanjeev External Links: MGP · Wikidata · GND · IdRef
 Documents Indexed: 73 Publications since 1992, including 1 Book 1 Contribution as Editor Co-Authors: 59 Co-Authors with 57 Joint Publications 2,250 Co-Co-Authors
all top 5

Co-Authors

 14 single-authored 6 Ge, Rong 5 Kale, Satyen 5 Steurer, David 4 Karakostas, George L. 4 Sudan, Madhu 3 Hazan, Elad 3 Kannan, Ravindran 3 Karger, David R. 3 Khot, Subhash Ajit 3 Lee, James R. 3 Lovász, László 3 Moitra, Ankur 3 Naor, Assaf 3 Rabani, Yuval 3 Rao, Satish B. 3 Tourlakis, Iannis 3 Vazirani, Umesh V. 2 Alekhnovich, Michael 2 Barak, Boaz 2 Chang, Kevin L. 2 Daskalakis, Constantinos 2 Karpinski, Marek 2 Lund, Carsten 2 Motwani, Rajeev 2 Newman, Ilan I. 2 Rabinovich, Yuri 2 Sachdeva, Sushant 2 Safra, Muli 2 Szegedy, Mario 2 Vempala, Santosh S. 1 Albers, Susanne 1 Babai, László 1 Bhattacharyya, Arnab 1 Bollobás, Béla 1 Brinkman, Bo 1 Brnkman, Bo 1 Bustamante-Cedeño, E. 1 Chlamtac, Eden 1 Fagin, Ronald 1 Frieze, Alan Michael 1 Grigni, Michelangelo 1 Jansen, Klaus 1 Kaplan, Haim 1 Khanna, Sanjeev 1 Klein, Philip N. 1 Kolla, Alexandra 1 Leighton, Frank Thomson 1 Ma, Tengyu 1 Maggs, Bruce M. 1 Manokaran, Rajsekar 1 Masta, M. 1 Raghavan, Prabhakar 1 Risteski, Andrej 1 Rolim, José D. P. 1 Sahai, Amit 1 Stern, Jacques 1 Sweedyk, Z. 1 Vishnoi, Nisheeth K. 1 Wigderson, Avi 1 Woloszyn, Andrzej 1 Yulsiani, Madhur
all top 5

Serials

 6 Journal of the ACM 5 SIAM Journal on Computing 3 Journal of Computer and System Sciences 3 Mathematical Programming. Series A. Series B 2 Algorithmica 2 Theory of Computing 1 IEEE Transactions on Information Theory 1 Journal of the Operational Research Society 1 Theoretical Computer Science 1 Combinatorica 1 Discrete & Computational Geometry 1 Journal of the American Mathematical Society 1 The Annals of Applied Probability 1 Notices of the American Mathematical Society 1 Computational Complexity 1 Journal of Scheduling 1 Lecture Notes in Computer Science 1 Palestine Journal of Mathematics 1 Journal of Linear and Topological Algebra
all top 5

Fields

 62 Computer science (68-XX) 26 Operations research, mathematical programming (90-XX) 12 Combinatorics (05-XX) 6 Numerical analysis (65-XX) 4 Linear and multilinear algebra; matrix theory (15-XX) 4 Information and communication theory, circuits (94-XX) 3 Functional analysis (46-XX) 2 Mathematical logic and foundations (03-XX) 2 Statistics (62-XX) 1 General and overarching topics; collections (00-XX) 1 History and biography (01-XX) 1 Convex and discrete geometry (52-XX) 1 General topology (54-XX) 1 Probability theory and stochastic processes (60-XX) 1 Game theory, economics, finance, and other social and behavioral sciences (91-XX)

Citations contained in zbMATH Open

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

all top 5

Cited in 252 Serials

 132 Theoretical Computer Science 86 Algorithmica 65 SIAM Journal on Computing 63 Discrete Applied Mathematics 60 Information Processing Letters 59 Journal of Computer and System Sciences 35 Mathematical Programming. Series A. Series B 34 Journal of Combinatorial Optimization 33 Computational Complexity 29 Theory of Computing Systems 26 Information and Computation 24 Computational Geometry 24 European Journal of Operational Research 22 Random Structures & Algorithms 16 Discrete & Computational Geometry 16 SIAM Journal on Discrete Mathematics 15 Linear Algebra and its Applications 14 Operations Research Letters 13 Journal of Discrete Algorithms 12 Artificial Intelligence 12 Machine Learning 11 Mathematics of Operations Research 11 Optimization Letters 9 Computers & Operations Research 9 Journal of Global Optimization 9 SIAM Journal on Optimization 9 Annals of Mathematics and Artificial Intelligence 8 Automatica 8 Journal of Cryptology 7 Networks 7 Combinatorica 7 Annals of Pure and Applied Logic 7 Journal of Machine Learning Research (JMLR) 7 Logical Methods in Computer Science 7 SIAM Journal on Mathematics of Data Science 6 Discrete Mathematics 6 Information Sciences 6 International Journal of Foundations of Computer Science 6 Designs, Codes and Cryptography 6 Bulletin of the American Mathematical Society. New Series 6 Journal of the ACM 6 Discrete Optimization 6 Proceedings of the Steklov Institute of Mathematics 6 Computer Science Review 5 The Annals of Statistics 5 Operations Research 5 Transactions of the American Mathematical Society 5 Neural Computation 5 Journal of High Energy Physics 5 ACM Transactions on Computation Theory 4 Acta Informatica 4 Problems of Information Transmission 4 Journal of Computer Science and Technology 4 International Journal of Approximate Reasoning 4 SIAM Journal on Matrix Analysis and Applications 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 Doklady Mathematics 4 RAIRO. Operations Research 4 4OR 4 Electronic Journal of Statistics 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 International Journal of Algebra and Computation 3 Distributed Computing 3 Cybernetics and Systems Analysis 3 Computational Optimization and Applications 3 Chicago Journal of Theoretical Computer Science 3 Journal of Scheduling 3 Annals of Mathematics. Second Series 3 Foundations of Computational Mathematics 3 Quantum Information Processing 3 Journal of Applied Logic 3 SIAM Journal on Imaging Sciences 3 Algorithms 2 Archive for Rational Mechanics and Analysis 2 International Journal of Control 2 Israel Journal of Mathematics 2 Journal of Mathematical Analysis and Applications 2 Journal of Mathematical Physics 2 Physics Letters. B 2 Acta Mathematica 2 Advances in Mathematics 2 Applied Mathematics and Computation 2 Journal of Mathematical Psychology 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 MCSS. Mathematics of Control, Signals, and Systems 2 Neural Networks 2 International Journal of Computational Geometry & Applications 2 Annals of Physics ...and 152 more Serials
all top 5

Cited in 49 Fields

 1,107 Computer science (68-XX) 471 Operations research, mathematical programming (90-XX) 351 Combinatorics (05-XX) 133 Information and communication theory, circuits (94-XX) 71 Mathematical logic and foundations (03-XX) 71 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 65 Statistics (62-XX) 54 Numerical analysis (65-XX) 48 Quantum theory (81-XX) 44 Linear and multilinear algebra; matrix theory (15-XX) 29 Biology and other natural sciences (92-XX) 22 Group theory and generalizations (20-XX) 21 Functional analysis (46-XX) 21 Probability theory and stochastic processes (60-XX) 20 Number theory (11-XX) 19 Convex and discrete geometry (52-XX) 18 Systems theory; control (93-XX) 13 Calculus of variations and optimal control; optimization (49-XX) 9 Order, lattices, ordered algebraic structures (06-XX) 9 Algebraic geometry (14-XX) 9 Statistical mechanics, structure of matter (82-XX) 8 General algebraic systems (08-XX) 7 Functions of a complex variable (30-XX) 7 Manifolds and cell complexes (57-XX) 7 Relativity and gravitational theory (83-XX) 6 Dynamical systems and ergodic theory (37-XX) 5 Commutative algebra (13-XX) 4 General and overarching topics; collections (00-XX) 4 Geometry (51-XX) 3 Abstract harmonic analysis (43-XX) 3 General topology (54-XX) 2 Measure and integration (28-XX) 2 Partial differential equations (35-XX) 2 Approximations and expansions (41-XX) 2 Operator theory (47-XX) 2 Algebraic topology (55-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 Real functions (26-XX) 1 Several complex variables and analytic spaces (32-XX) 1 Ordinary differential equations (34-XX) 1 Difference and functional equations (39-XX) 1 Harmonic analysis on Euclidean spaces (42-XX) 1 Differential geometry (53-XX) 1 Geophysics (86-XX) 1 Mathematics education (97-XX)

Wikidata Timeline

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