×

zbMATH — the first resource for mathematics

Ajtai, Miklós

Compute Distance To:
Author ID: ajtai.miklos Recent zbMATH articles by "Ajtai, Miklós"
Published as: Ajtai, Miklós; Ajtai, M.; Ajtai, Miklos
External Links: MGP · Wikidata · dblp · GND
Documents Indexed: 81 Publications since 1969

Publications by Year

Citations contained in zbMATH Open

67 Publications have been cited 1,317 times in 1,169 Documents Cited by Year
Sorting in \(c \log n\) parallel steps. Zbl 0523.68048
Ajtai, M.; Komlos, J.; Szemeredi, E.
151
1983
\(\Sigma_ 1^ 1\)-formulae on finite structures. Zbl 0519.03021
Ajtai, M.
122
1983
A note on Ramsey numbers. Zbl 0455.05045
Ajtai, Miklós; Komlós, János; Szemerédi, Endre
104
1980
A public-key cryptosystem with worst-case/average-case equivalence. Zbl 0962.68055
Ajtai, Miklós; Dwork, Cynthia
96
1999
Generating hard instances of lattice problems. (Extended abstract). Zbl 0921.11071
Ajtai, M.
95
1996
Crossing-free subgraphs. Zbl 0502.05021
Ajtai, M.; Chvatal, V.; Newborn, M. M.; Szemeredi, E.
77
1982
On optimal matchings. Zbl 0562.60012
Ajtai, M.; Komlós, J.; Tusnády, Gábor
51
1984
The shortest vector problem in \(L_2\) is NP-hard for randomized reductions (extended abstract). Zbl 1027.68609
Ajtai, Miklós
50
1998
A sieve algorithm for the shortest lattice vector problem. Zbl 1323.68561
Ajtai, Miklós; Kumar, Ravi; Sivakumar, D.
46
2001
A dense infinite Sidon sequence. Zbl 0474.10038
Ajtai, Miklós; Komlós, János; Szemerédi, Endre
46
1981
The longest path in a random graph. Zbl 0489.05052
Ajtai, Miklos; Komlos, Janos; Szemeredi, Endre
42
1981
Largest random component of a k-cube. Zbl 0489.05053
Ajtai, M.; Komlos, J.; Szemeredi, E.
30
1982
Extremal uncrowded hypergraphs. Zbl 0485.05049
Ajtai, M.; Komlos, J.; Pintz, J.; Spencer, J.; Szemeredi, E.
29
1982
Reachability is harder for directed than for undirected finite graphs. Zbl 0708.03016
Ajtai, Miklos; Fagin, Ronald
28
1990
Generating hard instances of the short basis problem. Zbl 0987.94021
Ajtai, Miklós
21
1999
On Turan’s theorem for sparse graphs. Zbl 0491.05038
Ajtai, M.; Erdős, Paul; Komlos, J.; Szemeredi, E.
19
1981
Every group admits a bad topology. Zbl 0535.22001
Ajtai, M.; Havas, I.; Komlós, J.
18
1983
Monotone versus positive. Zbl 0637.94022
Ajtai, Miklos; Gurevich, Yuri
16
1987
The complexity of the pigeonhole principle. Zbl 0811.03042
Ajtai, M.
15
1994
Sets of lattice points that form no squares. Zbl 0303.10046
Ajtai, M.; Szemerédi, E.
15
1975
First occurrence of Hamilton cycles in random graphs. Zbl 0577.05057
Ajtai, M.; Komlós, J.; Szemerédi, E.
14
1985
Improved algorithms and analysis for secretary problems and generalizations. Zbl 0969.65058
Ajtai, Miklos; Megiddo, Nimrod; Waarts, Orli
13
2001
Datalog vs first-order logic. Zbl 0824.68034
Ajtai, Miklos; Gurevich, Yuri
13
1994
Topological complete subgraphs in random graphs. Zbl 0489.05051
Ajtai, Miklos; Komlos, Janos; Szemeredi, Endre
11
1979
Construction of a thin set with small Fourier coefficients. Zbl 0733.11005
Ajtai, Miklós; Iwaniec, Henryk; Komlós, János; Pintz, János; Szemerédi, Endre
10
1990
A lower bound for finding predecessors in Yao’s cell probe model. Zbl 0659.68030
Ajtai, M.
9
1988
On a class of finite lattices. Zbl 0302.06006
Ajtai, M.
9
1973
Approximate counting with uniform constant-depth circuits. Zbl 0797.68064
Ajtai, Miklós
8
1993
On a conjecture of Loebl. Zbl 0844.05037
Ajtai, Miklós; Komlós, János; Szemerédi, Endre
8
1995
Generating hard instances of lattice problems. Zbl 1071.11041
Ajtai, Miklós
8
2004
Determinism versus nondeterminism for linear time RAMs with memory restrictions. Zbl 1020.68035
Ajtai, Miklós
7
2002
Hash functions for priority queues. Zbl 0591.68093
Ajtai, M.; Fredman, M.; Komlós, J.
7
1984
The set of continuous functions with everywhere convergent Fourier series. Zbl 0633.04004
Ajtai, M.; Kechris, A. S.
7
1987
Fairness in scheduling. Zbl 0917.68017
Ajtai, Miklos; Aspnes, James; Naor, Moni; Rabani, Yuval; Schulman, Leonard J.; Waarts, Orli
7
1998
The independence of the modulo \(p\) counting principles. Zbl 1345.03103
Ajtai, Miklos
7
1994
Determinism versus non-determinism for linear time RAMs (extended abstract). Zbl 1346.68093
Ajtai, Miklós
7
1999
The influence of large coalitions. Zbl 0807.90148
Ajtai, Miklós; Linial, Nathan
6
1993
Recursive construction for 3-regular expanders. Zbl 0810.05046
Ajtai, M.
6
1994
Approximate counting of inversions in a data stream. Zbl 1192.68455
Ajtai, Miklós; Jayram, T. S.; Kumar, Ravi; Sivakumar, D.
6
2002
First-order definability on finite structures. Zbl 0688.03018
Ajtai, M.
6
1989
Sorting in average time o(log n). Zbl 0673.68041
Ajtai, M.; Karabeg, D.; Komlós, J.; Szemerédi, E.
6
1989
Oblivious RAMs without cryptogarphic assumptions. (Oblivious RAMs without cryptogrpahic assumptions.) Zbl 1293.68120
Ajtai, Miklós
6
2010
A non-linear time lower bound for Boolean branching programs. Zbl 1213.68302
Ajtai, Miklós
5
2005
Secure computation with information leaking to an adversary. Zbl 1288.94047
Ajtai, Miklos
5
2011
Optimal parallel selection has complexity O(log log N). Zbl 0668.68044
Ajtai, Miklós; Komlós, János; Steiger, W. L.; Szemerédi, Endre
5
1989
Sorting and selection with imprecise comparisons. Zbl 1398.68113
Ajtai, Miklós; Feldman, Vitaly; Hassidim, Avinatan; Nelson, Jelani
5
2016
The closure of monadic NP. Zbl 1028.68060
Ajtai, Miklos; Fagin, Ronald; Stockmeyer, Larry
4
1998
Isomorphism and higher order equivalence. Zbl 0415.03044
Ajtai, M.
4
1979
Parity and the pigeonhole principle. Zbl 0781.03045
Ajtai, M.
4
1990
Sorting and selection with imprecise comparisons. Zbl 1248.68177
Ajtai, Miklós; Feldman, Vitaly; Hassidim, Avinatan; Nelson, Jelani
4
2009
Compactly encoding unstructured inputs with differential compression. Zbl 1326.68130
Ajtai, Miklos; Burns, Randal; Fagin, Ronald; Long, Darrell D. E.; Stockmeyer, Larry
4
2002
Fault tolerant graphs, perfect hash functions and disjoint paths. Zbl 0977.68557
Ajtai, M.; Alon, N.; Bruck, J.; Cypher, R.; Ho, C. T.; Naor, M.; Szemerédi, E.
3
1992
The solution of a problem of T. Rado. Zbl 0258.52014
Ajtai, M.
3
1973
The closure of monadic NP. Zbl 0958.68069
Ajtai, Miklos; Fagin, Ronald; Stockmeyer, Larry
2
2000
The worst-case behavior of Schnorr’s algorithm approximating the shortest nonzero vector in a lattice. Zbl 1192.68336
Ajtai, Miklos
2
2003
Halvers and expanders. Zbl 0977.68531
Ajtai, Miklós; Komlós, János; Szemerédi, Endre
2
1992
On the boundedness of definable linear operators. Zbl 0307.02046
Ajtai, M.
2
1974
Generalizations of the compactness theorem and Gödel’s completeness theorem for nonstandard finite structures. Zbl 1198.03038
Ajtai, Miklós
2
2007
Worst-case complexity, average-case complexity and lattice problems. Zbl 0922.11111
Ajtai, Miklós
1
1998
Geometric properties of sets defined by constant depth circuits. Zbl 0799.68083
Ajtai, M.
1
1993
On the existence of modulo \(p\) cardinality functions. Zbl 0834.03010
Ajtai, Miklós
1
1995
There is no fast single hashing algorithm. Zbl 0401.68044
Ajtai, Miklós; Komlós, János; Szemerédi, Endre
1
1978
A deterministic poly\((\log\log n)\)-time \(n\)-processor algorithm for linear programming in fixed dimension. Zbl 0864.68105
Ajtai, Miklos; Megiddo, Nimrod
1
1996
Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr’s algorithm for the shortest vector problem. Zbl 1213.68325
Ajtai, Miklós
1
2008
On coverings of random graphs. Zbl 0494.05055
Ajtai, M.; Komlos, J.; Rödl, Vojtěch; Szemeredi, E.
1
1982
On a generalization of the game Go-moku. I. Zbl 0497.90099
Ajtai, M.; Csirmaz, L.; Nagy, Zs.
1
1979
Boolean complexity and probabilistic constructions. Zbl 0769.68038
Ajtai, Miklós
1
1992
Sorting and selection with imprecise comparisons. Zbl 1398.68113
Ajtai, Miklós; Feldman, Vitaly; Hassidim, Avinatan; Nelson, Jelani
5
2016
Secure computation with information leaking to an adversary. Zbl 1288.94047
Ajtai, Miklos
5
2011
Oblivious RAMs without cryptogarphic assumptions. (Oblivious RAMs without cryptogrpahic assumptions.) Zbl 1293.68120
Ajtai, Miklós
6
2010
Sorting and selection with imprecise comparisons. Zbl 1248.68177
Ajtai, Miklós; Feldman, Vitaly; Hassidim, Avinatan; Nelson, Jelani
4
2009
Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr’s algorithm for the shortest vector problem. Zbl 1213.68325
Ajtai, Miklós
1
2008
Generalizations of the compactness theorem and Gödel’s completeness theorem for nonstandard finite structures. Zbl 1198.03038
Ajtai, Miklós
2
2007
A non-linear time lower bound for Boolean branching programs. Zbl 1213.68302
Ajtai, Miklós
5
2005
Generating hard instances of lattice problems. Zbl 1071.11041
Ajtai, Miklós
8
2004
The worst-case behavior of Schnorr’s algorithm approximating the shortest nonzero vector in a lattice. Zbl 1192.68336
Ajtai, Miklos
2
2003
Determinism versus nondeterminism for linear time RAMs with memory restrictions. Zbl 1020.68035
Ajtai, Miklós
7
2002
Approximate counting of inversions in a data stream. Zbl 1192.68455
Ajtai, Miklós; Jayram, T. S.; Kumar, Ravi; Sivakumar, D.
6
2002
Compactly encoding unstructured inputs with differential compression. Zbl 1326.68130
Ajtai, Miklos; Burns, Randal; Fagin, Ronald; Long, Darrell D. E.; Stockmeyer, Larry
4
2002
A sieve algorithm for the shortest lattice vector problem. Zbl 1323.68561
Ajtai, Miklós; Kumar, Ravi; Sivakumar, D.
46
2001
Improved algorithms and analysis for secretary problems and generalizations. Zbl 0969.65058
Ajtai, Miklos; Megiddo, Nimrod; Waarts, Orli
13
2001
The closure of monadic NP. Zbl 0958.68069
Ajtai, Miklos; Fagin, Ronald; Stockmeyer, Larry
2
2000
A public-key cryptosystem with worst-case/average-case equivalence. Zbl 0962.68055
Ajtai, Miklós; Dwork, Cynthia
96
1999
Generating hard instances of the short basis problem. Zbl 0987.94021
Ajtai, Miklós
21
1999
Determinism versus non-determinism for linear time RAMs (extended abstract). Zbl 1346.68093
Ajtai, Miklós
7
1999
The shortest vector problem in \(L_2\) is NP-hard for randomized reductions (extended abstract). Zbl 1027.68609
Ajtai, Miklós
50
1998
Fairness in scheduling. Zbl 0917.68017
Ajtai, Miklos; Aspnes, James; Naor, Moni; Rabani, Yuval; Schulman, Leonard J.; Waarts, Orli
7
1998
The closure of monadic NP. Zbl 1028.68060
Ajtai, Miklos; Fagin, Ronald; Stockmeyer, Larry
4
1998
Worst-case complexity, average-case complexity and lattice problems. Zbl 0922.11111
Ajtai, Miklós
1
1998
Generating hard instances of lattice problems. (Extended abstract). Zbl 0921.11071
Ajtai, M.
95
1996
A deterministic poly\((\log\log n)\)-time \(n\)-processor algorithm for linear programming in fixed dimension. Zbl 0864.68105
Ajtai, Miklos; Megiddo, Nimrod
1
1996
On a conjecture of Loebl. Zbl 0844.05037
Ajtai, Miklós; Komlós, János; Szemerédi, Endre
8
1995
On the existence of modulo \(p\) cardinality functions. Zbl 0834.03010
Ajtai, Miklós
1
1995
The complexity of the pigeonhole principle. Zbl 0811.03042
Ajtai, M.
15
1994
Datalog vs first-order logic. Zbl 0824.68034
Ajtai, Miklos; Gurevich, Yuri
13
1994
The independence of the modulo \(p\) counting principles. Zbl 1345.03103
Ajtai, Miklos
7
1994
Recursive construction for 3-regular expanders. Zbl 0810.05046
Ajtai, M.
6
1994
Approximate counting with uniform constant-depth circuits. Zbl 0797.68064
Ajtai, Miklós
8
1993
The influence of large coalitions. Zbl 0807.90148
Ajtai, Miklós; Linial, Nathan
6
1993
Geometric properties of sets defined by constant depth circuits. Zbl 0799.68083
Ajtai, M.
1
1993
Fault tolerant graphs, perfect hash functions and disjoint paths. Zbl 0977.68557
Ajtai, M.; Alon, N.; Bruck, J.; Cypher, R.; Ho, C. T.; Naor, M.; Szemerédi, E.
3
1992
Halvers and expanders. Zbl 0977.68531
Ajtai, Miklós; Komlós, János; Szemerédi, Endre
2
1992
Boolean complexity and probabilistic constructions. Zbl 0769.68038
Ajtai, Miklós
1
1992
Reachability is harder for directed than for undirected finite graphs. Zbl 0708.03016
Ajtai, Miklos; Fagin, Ronald
28
1990
Construction of a thin set with small Fourier coefficients. Zbl 0733.11005
Ajtai, Miklós; Iwaniec, Henryk; Komlós, János; Pintz, János; Szemerédi, Endre
10
1990
Parity and the pigeonhole principle. Zbl 0781.03045
Ajtai, M.
4
1990
First-order definability on finite structures. Zbl 0688.03018
Ajtai, M.
6
1989
Sorting in average time o(log n). Zbl 0673.68041
Ajtai, M.; Karabeg, D.; Komlós, J.; Szemerédi, E.
6
1989
Optimal parallel selection has complexity O(log log N). Zbl 0668.68044
Ajtai, Miklós; Komlós, János; Steiger, W. L.; Szemerédi, Endre
5
1989
A lower bound for finding predecessors in Yao’s cell probe model. Zbl 0659.68030
Ajtai, M.
9
1988
Monotone versus positive. Zbl 0637.94022
Ajtai, Miklos; Gurevich, Yuri
16
1987
The set of continuous functions with everywhere convergent Fourier series. Zbl 0633.04004
Ajtai, M.; Kechris, A. S.
7
1987
First occurrence of Hamilton cycles in random graphs. Zbl 0577.05057
Ajtai, M.; Komlós, J.; Szemerédi, E.
14
1985
On optimal matchings. Zbl 0562.60012
Ajtai, M.; Komlós, J.; Tusnády, Gábor
51
1984
Hash functions for priority queues. Zbl 0591.68093
Ajtai, M.; Fredman, M.; Komlós, J.
7
1984
Sorting in \(c \log n\) parallel steps. Zbl 0523.68048
Ajtai, M.; Komlos, J.; Szemeredi, E.
151
1983
\(\Sigma_ 1^ 1\)-formulae on finite structures. Zbl 0519.03021
Ajtai, M.
122
1983
Every group admits a bad topology. Zbl 0535.22001
Ajtai, M.; Havas, I.; Komlós, J.
18
1983
Crossing-free subgraphs. Zbl 0502.05021
Ajtai, M.; Chvatal, V.; Newborn, M. M.; Szemeredi, E.
77
1982
Largest random component of a k-cube. Zbl 0489.05053
Ajtai, M.; Komlos, J.; Szemeredi, E.
30
1982
Extremal uncrowded hypergraphs. Zbl 0485.05049
Ajtai, M.; Komlos, J.; Pintz, J.; Spencer, J.; Szemeredi, E.
29
1982
On coverings of random graphs. Zbl 0494.05055
Ajtai, M.; Komlos, J.; Rödl, Vojtěch; Szemeredi, E.
1
1982
A dense infinite Sidon sequence. Zbl 0474.10038
Ajtai, Miklós; Komlós, János; Szemerédi, Endre
46
1981
The longest path in a random graph. Zbl 0489.05052
Ajtai, Miklos; Komlos, Janos; Szemeredi, Endre
42
1981
On Turan’s theorem for sparse graphs. Zbl 0491.05038
Ajtai, M.; Erdős, Paul; Komlos, J.; Szemeredi, E.
19
1981
A note on Ramsey numbers. Zbl 0455.05045
Ajtai, Miklós; Komlós, János; Szemerédi, Endre
104
1980
Topological complete subgraphs in random graphs. Zbl 0489.05051
Ajtai, Miklos; Komlos, Janos; Szemeredi, Endre
11
1979
Isomorphism and higher order equivalence. Zbl 0415.03044
Ajtai, M.
4
1979
On a generalization of the game Go-moku. I. Zbl 0497.90099
Ajtai, M.; Csirmaz, L.; Nagy, Zs.
1
1979
There is no fast single hashing algorithm. Zbl 0401.68044
Ajtai, Miklós; Komlós, János; Szemerédi, Endre
1
1978
Sets of lattice points that form no squares. Zbl 0303.10046
Ajtai, M.; Szemerédi, E.
15
1975
On the boundedness of definable linear operators. Zbl 0307.02046
Ajtai, M.
2
1974
On a class of finite lattices. Zbl 0302.06006
Ajtai, M.
9
1973
The solution of a problem of T. Rado. Zbl 0258.52014
Ajtai, M.
3
1973
all top 5

Cited by 1,749 Authors

18 Fox, Jacob
18 Sudakov, Benny
16 Alon, Noga M.
16 Pach, János
14 Krivelevich, Michael
14 Mubayi, Dhruv
13 Tóth, Csaba D.
11 Bollobás, Béla
11 Lefmann, Hanno
10 Frieze, Alan Michael
10 Rodl, Vojtech
9 Ajtai, Miklós
9 Cai, Jin-Yi
9 Dumitrescu, Adrian
9 Szemerédi, Endre
8 Beame, Paul W.
8 Hurtado, Ferran
8 Suk, Andrew
8 Thérien, Denis
7 Bohman, Tom
7 Conlon, David
7 Erdős, Pál
7 Mix Barrington, David A.
7 Osthus, Deryk
7 Reidys, Christian Michael
7 Sharir, Micha
7 Shparlinski, Igor E.
6 Goldwasser, Shafi
6 Hagerup, Torben
6 Kohayakawa, Yoshiharu
6 Kolaitis, Phokion G.
6 Kühn, Daniela
6 Łuczak, Tomasz
6 Pudlák, Pavel
6 Straubing, Howard
6 Vaikuntanathan, Vinod
6 Yukna, Stasys P.
5 Brakerski, Zvika
5 Dudek, Andrzej
5 Fagin, Ronald
5 Håstad, Johan Torkel
5 Komlós, János
5 Lee, Hyangsook
5 Li, Yusheng
5 Lim, Seongan
5 Lindner, Richard
5 Ling, San
5 Parberry, Ian
5 Piguet, Diana
5 Razborov, Aleksandr Aleksandrovich
5 Simonovits, Miklós
5 Stehlé, Damien
5 Stein, Maya Jakobine
5 Tóth, Géza
5 Vishkin, Uzi
5 Wang, Huaxiong
5 Wigderson, Avi
4 Atserias, Albert
4 Azar, Yossi
4 Balogh, József
4 Bogdanov, Andrej
4 Boppana, Ravi B.
4 Bro Miltersen, Peter
4 Buss, Samuel R.
4 Chandrasekaran, Karthekeyan
4 Chen, Wenbin
4 Cilleruelo, Javier
4 Cooper, Jeff
4 Dikranjan, Dikran N.
4 Goldreich, Oded
4 Hefetz, Dan
4 Huemer, Clemens
4 Immerman, Neil
4 Ishai, Yuval
4 Kahn, Jeff D.
4 Khot, Subhash Ajit
4 Lee, Sangjune
4 Lubetzky, Eyal
4 Morris, Robert D.
4 Nguyen, Khoa
4 Nguyen, Phong Q.
4 Peikert, Chris
4 Péladeau, Pierre
4 Peres, Yuval
4 Rautenbach, Dieter
4 Rossman, Benjamin
4 Schweikardt, Nicole
4 Schwentick, Thomas
4 Solymosi, József
4 Steinfeld, Ron
4 Tao, Terence
4 Vardi, Moshe Y.
4 Viola, Emanuele
3 Ackerman, Eyal
3 Aggarwal, Divesh
3 Aichholzer, Oswin
3 Applebaum, Benny
3 Babai, László
3 Balister, Paul N.
3 Barenboim, Leonid
...and 1,649 more Authors
all top 5

Cited in 202 Serials

98 Theoretical Computer Science
65 Information Processing Letters
62 Journal of Computer and System Sciences
38 Discrete Mathematics
33 Random Structures & Algorithms
29 Combinatorics, Probability and Computing
28 Journal of Combinatorial Theory. Series B
28 Combinatorica
25 Algorithmica
25 Computational Complexity
23 Discrete Applied Mathematics
21 Information and Computation
19 Annals of Pure and Applied Logic
18 Discrete & Computational Geometry
17 SIAM Journal on Discrete Mathematics
17 Designs, Codes and Cryptography
16 Computational Geometry
15 European Journal of Combinatorics
15 Graphs and Combinatorics
15 Journal of Cryptology
14 Journal of Combinatorial Theory. Series A
13 SIAM Journal on Computing
13 Theory of Computing Systems
11 The Annals of Probability
10 Topology and its Applications
9 Mathematical Systems Theory
8 Proceedings of the American Mathematical Society
8 Transactions of the American Mathematical Society
8 Journal of Combinatorial Optimization
7 Journal of Graph Theory
6 Advances in Mathematics
6 The Journal of Symbolic Logic
5 Acta Informatica
5 Israel Journal of Mathematics
5 Journal of Number Theory
5 Distributed Computing
5 The Electronic Journal of Combinatorics
4 Information Sciences
4 Journal of the American Mathematical Society
4 Annales de l’Institut Henri Poincaré. Probabilités et Statistiques
4 Journal of Mathematical Sciences (New York)
4 Annals of Mathematics. Second Series
4 Journal of Mathematical Cryptology
3 Artificial Intelligence
3 Journal of Mathematical Analysis and Applications
3 Journal of Statistical Physics
3 Mathematical Proceedings of the Cambridge Philosophical Society
3 Mathematics of Computation
3 Duke Mathematical Journal
3 Probability Theory and Related Fields
3 Journal of Complexity
3 Journal of Theoretical Probability
3 International Journal of Foundations of Computer Science
3 Journal of Global Optimization
3 Geometric and Functional Analysis. GAFA
3 Archive for Mathematical Logic
3 Mathematical Programming. Series A. Series B
3 Mathematical Logic Quarterly (MLQ)
3 Finite Fields and their Applications
3 The Bulletin of Symbolic Logic
3 International Journal of Number Theory
3 Advances in Mathematics of Communications
3 Discrete Mathematics, Algorithms and Applications
2 Journal d’Analyse Mathématique
2 Algebra Universalis
2 BIT
2 Computing
2 Journal of Pure and Applied Algebra
2 Memoirs of the American Mathematical Society
2 Notre Dame Journal of Formal Logic
2 Studia Logica
2 Advances in Applied Mathematics
2 Statistics & Probability Letters
2 Operations Research Letters
2 Chinese Annals of Mathematics. Series B
2 Journal of Symbolic Computation
2 Journal of Computer Science and Technology
2 International Journal of Parallel Programming
2 Applied Mathematics Letters
2 Journal of Parallel and Distributed Computing
2 European Journal of Operational Research
2 Annals of Mathematics and Artificial Intelligence
2 Electronic Journal of Probability
2 Mathematical Problems in Engineering
2 European Series in Applied and Industrial Mathematics (ESAIM): Probability and Statistics
2 Journal of the European Mathematical Society (JEMS)
2 Journal of High Energy Physics
2 ACM Transactions on Computational Logic
2 Mathematics in Computer Science
2 Acta Universitatis Sapientiae. Informatica
1 ACM Computing Surveys
1 Advances in Applied Probability
1 Analysis Mathematica
1 Archive for History of Exact Sciences
1 Archive for Rational Mechanics and Analysis
1 Bulletin of the Australian Mathematical Society
1 Communications in Algebra
1 Communications on Pure and Applied Mathematics
1 Mathematical Methods in the Applied Sciences
1 Mathematical Notes
...and 102 more Serials
all top 5

Cited in 48 Fields

573 Computer science (68-XX)
374 Combinatorics (05-XX)
218 Information and communication theory, circuits (94-XX)
108 Mathematical logic and foundations (03-XX)
96 Number theory (11-XX)
89 Probability theory and stochastic processes (60-XX)
60 Operations research, mathematical programming (90-XX)
43 Convex and discrete geometry (52-XX)
27 Game theory, economics, finance, and other social and behavioral sciences (91-XX)
21 Statistics (62-XX)
21 Numerical analysis (65-XX)
20 Order, lattices, ordered algebraic structures (06-XX)
19 Group theory and generalizations (20-XX)
18 Quantum theory (81-XX)
16 General topology (54-XX)
13 Topological groups, Lie groups (22-XX)
8 Algebraic geometry (14-XX)
8 Linear and multilinear algebra; matrix theory (15-XX)
8 Dynamical systems and ergodic theory (37-XX)
8 Calculus of variations and optimal control; optimization (49-XX)
8 Statistical mechanics, structure of matter (82-XX)
7 Harmonic analysis on Euclidean spaces (42-XX)
6 Real functions (26-XX)
5 Commutative algebra (13-XX)
5 Geometry (51-XX)
5 Biology and other natural sciences (92-XX)
4 History and biography (01-XX)
4 Abstract harmonic analysis (43-XX)
3 General algebraic systems (08-XX)
3 Field theory and polynomials (12-XX)
3 Associative rings and algebras (16-XX)
3 Approximations and expansions (41-XX)
2 General and overarching topics; collections (00-XX)
2 Partial differential equations (35-XX)
2 Difference and functional equations (39-XX)
2 Functional analysis (46-XX)
2 Manifolds and cell complexes (57-XX)
2 Global analysis, analysis on manifolds (58-XX)
2 Systems theory; control (93-XX)
1 Nonassociative rings and algebras (17-XX)
1 Category theory; homological algebra (18-XX)
1 Measure and integration (28-XX)
1 Functions of a complex variable (30-XX)
1 Several complex variables and analytic spaces (32-XX)
1 Special functions (33-XX)
1 Differential geometry (53-XX)
1 Algebraic topology (55-XX)
1 Relativity and gravitational theory (83-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.