×

zbMATH — the first resource for mathematics

Braverman, Mark

Compute Distance To:
Author ID: braverman.mark Recent zbMATH articles by "Braverman, Mark"
Published as: Braverman, Mark; Braverman, M.
Homepage: http://www.cs.princeton.edu/~mbraverm
External Links: MGP · Wikidata · Math-Net.Ru · dblp · GND
Awards: EMS Prize (2016)
Documents Indexed: 91 Publications since 2001, including 1 Book

Publications by Year

Citations contained in zbMATH Open

71 Publications have been cited 561 times in 351 Documents Cited by Year
Non-computable Julia sets. Zbl 1099.37042
Braverman, M.; Yampolsky, M.
37
2006
Computing over the reals: foundations for scientific computing. Zbl 1092.68038
Braverman, Mark; Cook, Stephen
25
2006
An information complexity approach to extended formulations. Zbl 1293.68137
Braverman, Mark; Moitra, Ankur
21
2013
Monotonicity and implementability. Zbl 1271.91070
Ashlagi, Itai; Braverman, Mark; Hassidim, Avinatan; Monderer, Dov
21
2010
How to compress interactive communication. Zbl 1293.68116
Barak, Boaz; Braverman, Mark; Chen, Xi; Rao, Anup
20
2010
Information equals amortized communication. Zbl 1292.94008
Braverman, Mark; Rao, Anup
19
2011
Noisy sorting without resampling. Zbl 1192.94077
Braverman, Mark; Mossel, Elchanan
17
2008
How to compress interactive communication. Zbl 1272.68138
Barak, Boaz; Braverman, Mark; Chen, Xi; Rao, Anup
16
2013
The Grothendieck constant is strictly smaller than Krivine’s bound. Zbl 1292.90243
Braverman, Mark; Makarychev, Konstantin; Makarychev, Yury; Naor, Assaf
15
2011
Polylogarithmic independence fools \(\mathrm{AC}^{0}\) circuits. Zbl 1327.68108
Braverman, Mark
15
2010
Stability in large matching markets with complementarities. Zbl 1303.91122
Ashlagi, Itai; Braverman, Mark; Hassidim, Avinatan
14
2014
Computability of Julia sets. Zbl 1161.37035
Braverman, Mark; Yampolsky, Michael
13
2008
Interactive information complexity. Zbl 1286.94047
Braverman, Mark
12
2012
From information to exact communication. Zbl 1293.68160
Braverman, Mark; Garg, Ankit; Pankratov, Denis; Weinstein, Omri
12
2013
Information equals amortized communication. Zbl 1360.94124
Braverman, Mark; Rao, Anup
12
2014
Parabolic Julia sets are polynomial time computable. Zbl 1190.37049
Braverman, Mark
12
2006
Position auctions with budgets: existence and uniqueness. Zbl 1200.91118
Ashlagi, Itai; Braverman, Mark; Hassidim, Avinatan; Lavi, Ron; Tennenholtz, Moshe
12
2010
Filled Julia sets with empty interior are computable. Zbl 1160.37013
Binder, I.; Braverman, M.; Yampolsky, M.
12
2007
Pseudorandom generators for regular branching programs. Zbl 1301.68192
Braverman, Mark; Rao, Anup; Raz, Ran; Yehudayoff, Amir
11
2014
On the convergence of the Hegselmann-Krause system. Zbl 1361.68106
Bhattacharyya, Arnab; Braverman, Mark; Chazelle, Bernard; Nguyen, Huy L.
11
2013
Termination of integer linear programs. Zbl 1188.68183
Braverman, Mark
11
2006
Computability of Julia sets. Zbl 1314.37033
Braverman, Mark; Yampolsky, Michael
11
2009
On the computational complexity of the Riemann mapping. Zbl 1153.30005
Binder, Ilia; Braverman, Mark; Yampolsky, Michael
11
2007
Interactive information complexity. Zbl 1330.68067
Braverman, Mark
10
2015
Computability of Brolin-Lyubich measure. Zbl 1246.37070
Binder, Ilia; Braverman, Mark; Rojas, Cristobal; Yampolsky, Michael
9
2011
Towards coding for maximum errors in interactive communication. Zbl 1288.94092
Braverman, Mark; Rao, Anup
9
2011
The complexity of properly learning simple concept classes. Zbl 1151.68575
Alekhnovich, Misha; Braverman, Mark; Feldman, Vitaly; Klivans, Adam R.; Pitassi, Toniann
9
2008
Direct product via round-preserving compression. Zbl 1336.68086
Braverman, Mark; Rao, Anup; Weinstein, Omri; Yehudayoff, Amir
8
2013
A discrepancy lower bound for information complexity. Zbl 1372.68113
Braverman, Mark; Weinstein, Omri
8
2012
On computational complexity of Siegel Julia sets. Zbl 1233.68138
Binder, I.; Braverman, M.; Yampolsky, M.
8
2006
The Grothendieck constant is strictly smaller than Krivine’s bound. Zbl 1320.15016
Braverman, Mark; Makarychev, Konstantin; Makarychev, Yury; Naor, Assaf
8
2013
Thurston equivalence to a rational map is decidable. Zbl 1329.37046
Bonnot, Sylvain; Braverman, Mark; Yampolsky, Michael
7
2012
Towards deterministic tree code constructions. Zbl 1348.94095
Braverman, Mark
7
2012
List and unique coding for interactive communication in the presence of adversarial noise. Zbl 1420.94005
Braverman, Mark; Efremenko, Klim
7
2017
Small value parallel repetition for general games. Zbl 1322.91010
Braverman, Mark; Garg, Ankit
7
2015
Inapproximability of NP-complete variants of Nash equilibrium. Zbl 1366.68071
Austrin, Per; Braverman, Mark; Chlamtáč, Eden
6
2013
Toward coding for maximum errors in interactive communication. Zbl 1360.94193
Braverman, Mark; Rao, Anup
6
2014
Information lower bounds via self-reducibility. Zbl 1345.68153
Braverman, Mark; Garg, Ankit; Pankratov, Denis; Weinstein, Omri
6
2013
Reliable communication over highly connected noisy networks. Zbl 1373.68033
Alon, Noga; Braverman, Mark; Efremenko, Klim; Gelles, Ran; Haeupler, Bernhard
6
2016
Approximating the best Nash equilibrium in \(n^{o(\log n)}\)-time breaks the exponential time hypothesis. Zbl 1372.68112
Braverman, Mark; Kun Ko, Young; Weinstein, Omri
6
2015
ETH hardness for densest-\(k\)-subgraph with perfect completeness. Zbl 1409.68125
Braverman, Mark; Ko, Young Kun; Rubinstein, Aviad; Weinstein, Omri
6
2017
Public vs private coin in bounded-round information. Zbl 1395.68116
Braverman, Mark; Garg, Ankit
5
2014
Constructing locally connected non-computable Julia sets. Zbl 1190.37050
Braverman, Mark; Yampolsky, Michael
5
2009
Constant-rate coding for multiparty interactive communication is impossible. Zbl 1373.68038
Braverman, Mark; Efremenko, Klim; Gelles, Ran; Haeupler, Bernhard
4
2016
Communication lower bounds for statistical estimation problems via a distributed data processing inequality. Zbl 1373.68235
Braverman, Mark; Garg, Ankit; Ma, Tengyu; Nguyen, Huy L.; Woodruff, David P.
4
2016
Noise vs computational intractability in dynamics. Zbl 1347.68122
Braverman, Mark; Grigo, Alexander; Rojas, Cristobal
4
2012
A discrepancy lower bound for information complexity. Zbl 1353.68088
Braverman, Mark; Weinstein, Omri
4
2016
An interactive information odometer and applications. Zbl 1321.68260
Braverman, Mark; Weinstein, Omri
4
2015
The rate of convergence of the walk on spheres algorithm. Zbl 1268.60103
Binder, Ilia; Braverman, Mark
3
2012
Parallel algorithms for select and partition with noisy comparisons. Zbl 1375.68186
Braverman, Mark; Mao, Jieming; Weinberg, S. Matthew
3
2016
Coding for interactive communication correcting insertions and deletions. Zbl 1390.68314
Braverman, Mark; Gelles, Ran; Mao, Jieming; Ostrovsky, Rafail
3
2016
Derandomization of Euclidean random walks. Zbl 1171.68863
Binder, Ilia; Braverman, Mark
3
2007
Interactive information and coding theory. Zbl 1374.94707
Braverman, Mark
2
2014
Interactive information complexity. Zbl 1380.68177
Braverman, Mark
2
2017
Information complexity is computable. Zbl 1388.68059
Braverman, Mark; Schneider, Jon
2
2016
Optimal provision-after-wait in healthcare. Zbl 1334.90069
Braverman, Mark; Chen, Jing; Kannan, Sampath
2
2016
Constructing non-computable Julia sets. Zbl 1232.37024
Braverman, Mark; Yampolsky, Michael
2
2007
Finding endogenously formed communities. Zbl 1422.68203
Balcan, Maria-Florina; Borgs, Christian; Braverman, Mark; Chayes, Jennifer; Teng, Shang-Hua
2
2013
Coding for interactive communication correcting insertions and deletions. Zbl 1390.94008
Braverman, Mark; Gelles, Ran; Mao, Jieming; Ostrovsky, Rafail
2
2017
Inapproximability of NP-complete variants of Nash equilibrium. Zbl 1343.68089
Austrin, Per; Braverman, Mark; Chlamtáč, Eden
1
2011
Branching programs for tree evaluation. Zbl 1250.68106
Braverman, Mark; Cook, Stephen; McKenzie, Pierre; Santhanam, Rahul; Wehr, Dustin
1
2009
Nash equilibria in perturbation-stable games. Zbl 1380.91011
Balcan, Maria-Florina; Braverman, Mark
1
2017
On information complexity in the broadcast model. Zbl 1333.68048
Braverman, Mark; Oshman, Rotem
1
2015
Information lower bounds via self-reducibility. Zbl 1356.68086
Braverman, Mark; Garg, Ankit; Pankratov, Denis; Weinstein, Omri
1
2016
A candidate for a strong separation of information and communication. Zbl 1462.68054
Braverman, Mark; Ganor, Anat; Kol, Gillat; Raz, Ran
1
2018
Strategyproof mechanisms for competitive influence in networks. Zbl 1367.91154
Borodin, Allan; Braverman, Mark; Lucier, Brendan; Oren, Joel
1
2017
Interactive compression to external information. Zbl 1427.68075
Braverman, Mark; Kol, Gillat
1
2018
The complexity of simulating Brownian motion. Zbl 1425.65019
Binder, Ilia; Braverman, Mark
1
2009
On simultaneous two-player combinatorial auctions. Zbl 1403.91160
Braverman, Mark; Mao, Jieming; Weinberg, S. Matthew
1
2018
Coding in undirected graphs is either very helpful or not helpful at all. Zbl 1402.90030
Braverman, Mark; Garg, Sumegha; Schvartzman, Ariel
1
2017
Constant-rate coding for multiparty interactive communication is impossible. Zbl 1426.68016
Braverman, Mark; Efremenko, Klim; Gelles, Ran; Haeupler, Bernhard
1
2018
A candidate for a strong separation of information and communication. Zbl 1462.68054
Braverman, Mark; Ganor, Anat; Kol, Gillat; Raz, Ran
1
2018
Interactive compression to external information. Zbl 1427.68075
Braverman, Mark; Kol, Gillat
1
2018
On simultaneous two-player combinatorial auctions. Zbl 1403.91160
Braverman, Mark; Mao, Jieming; Weinberg, S. Matthew
1
2018
Constant-rate coding for multiparty interactive communication is impossible. Zbl 1426.68016
Braverman, Mark; Efremenko, Klim; Gelles, Ran; Haeupler, Bernhard
1
2018
List and unique coding for interactive communication in the presence of adversarial noise. Zbl 1420.94005
Braverman, Mark; Efremenko, Klim
7
2017
ETH hardness for densest-\(k\)-subgraph with perfect completeness. Zbl 1409.68125
Braverman, Mark; Ko, Young Kun; Rubinstein, Aviad; Weinstein, Omri
6
2017
Interactive information complexity. Zbl 1380.68177
Braverman, Mark
2
2017
Coding for interactive communication correcting insertions and deletions. Zbl 1390.94008
Braverman, Mark; Gelles, Ran; Mao, Jieming; Ostrovsky, Rafail
2
2017
Nash equilibria in perturbation-stable games. Zbl 1380.91011
Balcan, Maria-Florina; Braverman, Mark
1
2017
Strategyproof mechanisms for competitive influence in networks. Zbl 1367.91154
Borodin, Allan; Braverman, Mark; Lucier, Brendan; Oren, Joel
1
2017
Coding in undirected graphs is either very helpful or not helpful at all. Zbl 1402.90030
Braverman, Mark; Garg, Sumegha; Schvartzman, Ariel
1
2017
Reliable communication over highly connected noisy networks. Zbl 1373.68033
Alon, Noga; Braverman, Mark; Efremenko, Klim; Gelles, Ran; Haeupler, Bernhard
6
2016
Constant-rate coding for multiparty interactive communication is impossible. Zbl 1373.68038
Braverman, Mark; Efremenko, Klim; Gelles, Ran; Haeupler, Bernhard
4
2016
Communication lower bounds for statistical estimation problems via a distributed data processing inequality. Zbl 1373.68235
Braverman, Mark; Garg, Ankit; Ma, Tengyu; Nguyen, Huy L.; Woodruff, David P.
4
2016
A discrepancy lower bound for information complexity. Zbl 1353.68088
Braverman, Mark; Weinstein, Omri
4
2016
Parallel algorithms for select and partition with noisy comparisons. Zbl 1375.68186
Braverman, Mark; Mao, Jieming; Weinberg, S. Matthew
3
2016
Coding for interactive communication correcting insertions and deletions. Zbl 1390.68314
Braverman, Mark; Gelles, Ran; Mao, Jieming; Ostrovsky, Rafail
3
2016
Information complexity is computable. Zbl 1388.68059
Braverman, Mark; Schneider, Jon
2
2016
Optimal provision-after-wait in healthcare. Zbl 1334.90069
Braverman, Mark; Chen, Jing; Kannan, Sampath
2
2016
Information lower bounds via self-reducibility. Zbl 1356.68086
Braverman, Mark; Garg, Ankit; Pankratov, Denis; Weinstein, Omri
1
2016
Interactive information complexity. Zbl 1330.68067
Braverman, Mark
10
2015
Small value parallel repetition for general games. Zbl 1322.91010
Braverman, Mark; Garg, Ankit
7
2015
Approximating the best Nash equilibrium in \(n^{o(\log n)}\)-time breaks the exponential time hypothesis. Zbl 1372.68112
Braverman, Mark; Kun Ko, Young; Weinstein, Omri
6
2015
An interactive information odometer and applications. Zbl 1321.68260
Braverman, Mark; Weinstein, Omri
4
2015
On information complexity in the broadcast model. Zbl 1333.68048
Braverman, Mark; Oshman, Rotem
1
2015
Stability in large matching markets with complementarities. Zbl 1303.91122
Ashlagi, Itai; Braverman, Mark; Hassidim, Avinatan
14
2014
Information equals amortized communication. Zbl 1360.94124
Braverman, Mark; Rao, Anup
12
2014
Pseudorandom generators for regular branching programs. Zbl 1301.68192
Braverman, Mark; Rao, Anup; Raz, Ran; Yehudayoff, Amir
11
2014
Toward coding for maximum errors in interactive communication. Zbl 1360.94193
Braverman, Mark; Rao, Anup
6
2014
Public vs private coin in bounded-round information. Zbl 1395.68116
Braverman, Mark; Garg, Ankit
5
2014
Interactive information and coding theory. Zbl 1374.94707
Braverman, Mark
2
2014
An information complexity approach to extended formulations. Zbl 1293.68137
Braverman, Mark; Moitra, Ankur
21
2013
How to compress interactive communication. Zbl 1272.68138
Barak, Boaz; Braverman, Mark; Chen, Xi; Rao, Anup
16
2013
From information to exact communication. Zbl 1293.68160
Braverman, Mark; Garg, Ankit; Pankratov, Denis; Weinstein, Omri
12
2013
On the convergence of the Hegselmann-Krause system. Zbl 1361.68106
Bhattacharyya, Arnab; Braverman, Mark; Chazelle, Bernard; Nguyen, Huy L.
11
2013
Direct product via round-preserving compression. Zbl 1336.68086
Braverman, Mark; Rao, Anup; Weinstein, Omri; Yehudayoff, Amir
8
2013
The Grothendieck constant is strictly smaller than Krivine’s bound. Zbl 1320.15016
Braverman, Mark; Makarychev, Konstantin; Makarychev, Yury; Naor, Assaf
8
2013
Inapproximability of NP-complete variants of Nash equilibrium. Zbl 1366.68071
Austrin, Per; Braverman, Mark; Chlamtáč, Eden
6
2013
Information lower bounds via self-reducibility. Zbl 1345.68153
Braverman, Mark; Garg, Ankit; Pankratov, Denis; Weinstein, Omri
6
2013
Finding endogenously formed communities. Zbl 1422.68203
Balcan, Maria-Florina; Borgs, Christian; Braverman, Mark; Chayes, Jennifer; Teng, Shang-Hua
2
2013
Interactive information complexity. Zbl 1286.94047
Braverman, Mark
12
2012
A discrepancy lower bound for information complexity. Zbl 1372.68113
Braverman, Mark; Weinstein, Omri
8
2012
Thurston equivalence to a rational map is decidable. Zbl 1329.37046
Bonnot, Sylvain; Braverman, Mark; Yampolsky, Michael
7
2012
Towards deterministic tree code constructions. Zbl 1348.94095
Braverman, Mark
7
2012
Noise vs computational intractability in dynamics. Zbl 1347.68122
Braverman, Mark; Grigo, Alexander; Rojas, Cristobal
4
2012
The rate of convergence of the walk on spheres algorithm. Zbl 1268.60103
Binder, Ilia; Braverman, Mark
3
2012
Information equals amortized communication. Zbl 1292.94008
Braverman, Mark; Rao, Anup
19
2011
The Grothendieck constant is strictly smaller than Krivine’s bound. Zbl 1292.90243
Braverman, Mark; Makarychev, Konstantin; Makarychev, Yury; Naor, Assaf
15
2011
Computability of Brolin-Lyubich measure. Zbl 1246.37070
Binder, Ilia; Braverman, Mark; Rojas, Cristobal; Yampolsky, Michael
9
2011
Towards coding for maximum errors in interactive communication. Zbl 1288.94092
Braverman, Mark; Rao, Anup
9
2011
Inapproximability of NP-complete variants of Nash equilibrium. Zbl 1343.68089
Austrin, Per; Braverman, Mark; Chlamtáč, Eden
1
2011
Monotonicity and implementability. Zbl 1271.91070
Ashlagi, Itai; Braverman, Mark; Hassidim, Avinatan; Monderer, Dov
21
2010
How to compress interactive communication. Zbl 1293.68116
Barak, Boaz; Braverman, Mark; Chen, Xi; Rao, Anup
20
2010
Polylogarithmic independence fools \(\mathrm{AC}^{0}\) circuits. Zbl 1327.68108
Braverman, Mark
15
2010
Position auctions with budgets: existence and uniqueness. Zbl 1200.91118
Ashlagi, Itai; Braverman, Mark; Hassidim, Avinatan; Lavi, Ron; Tennenholtz, Moshe
12
2010
Computability of Julia sets. Zbl 1314.37033
Braverman, Mark; Yampolsky, Michael
11
2009
Constructing locally connected non-computable Julia sets. Zbl 1190.37050
Braverman, Mark; Yampolsky, Michael
5
2009
Branching programs for tree evaluation. Zbl 1250.68106
Braverman, Mark; Cook, Stephen; McKenzie, Pierre; Santhanam, Rahul; Wehr, Dustin
1
2009
The complexity of simulating Brownian motion. Zbl 1425.65019
Binder, Ilia; Braverman, Mark
1
2009
Noisy sorting without resampling. Zbl 1192.94077
Braverman, Mark; Mossel, Elchanan
17
2008
Computability of Julia sets. Zbl 1161.37035
Braverman, Mark; Yampolsky, Michael
13
2008
The complexity of properly learning simple concept classes. Zbl 1151.68575
Alekhnovich, Misha; Braverman, Mark; Feldman, Vitaly; Klivans, Adam R.; Pitassi, Toniann
9
2008
Filled Julia sets with empty interior are computable. Zbl 1160.37013
Binder, I.; Braverman, M.; Yampolsky, M.
12
2007
On the computational complexity of the Riemann mapping. Zbl 1153.30005
Binder, Ilia; Braverman, Mark; Yampolsky, Michael
11
2007
Derandomization of Euclidean random walks. Zbl 1171.68863
Binder, Ilia; Braverman, Mark
3
2007
Constructing non-computable Julia sets. Zbl 1232.37024
Braverman, Mark; Yampolsky, Michael
2
2007
Non-computable Julia sets. Zbl 1099.37042
Braverman, M.; Yampolsky, M.
37
2006
Computing over the reals: foundations for scientific computing. Zbl 1092.68038
Braverman, Mark; Cook, Stephen
25
2006
Parabolic Julia sets are polynomial time computable. Zbl 1190.37049
Braverman, Mark
12
2006
Termination of integer linear programs. Zbl 1188.68183
Braverman, Mark
11
2006
On computational complexity of Siegel Julia sets. Zbl 1233.68138
Binder, I.; Braverman, M.; Yampolsky, M.
8
2006
all top 5

Cited by 584 Authors

19 Braverman, Mark
16 Yampolsky, Michael
11 Rojas, Cristobal
10 Pokutta, Sebastian
7 Zhong, Ning
6 Binder, Ilia A.
6 Braun, Gábor
6 Gelles, Ran
6 Graça, Daniel Silva
6 Ko, Ker-I
5 Chattopadhyay, Arkadev
5 Fiorini, Samuel
5 Jain, Rahul
5 Kojima, Fuhito
5 Meir, Or
5 Yehudayoff, Amir
5 Yu, Fuxiang
4 Briët, Jop
4 Carbajal, Juan Carlos
4 Chazelle, Bernard
4 Deligkas, Argyrios
4 Dudko, Artem
4 Fearnley, John
4 Gonen, Rica
4 Haeupler, Bernhard
4 Kol, Gillat
4 Lerner, Anat
4 Lutz, Jack H.
4 Pitassi, Toniann
4 Shpilka, Amir
4 Viola, Emanuele
4 Weinstein, Omri
3 Arunachalam, Srinivasan
3 Cenzer, Douglas
3 Dobzinski, Shahar
3 Galatolo, Stefano
3 Genaim, Samir
3 Kleinberg, Robert D.
3 Koucký, Michal
3 Lovett, Shachar
3 Manurangsi, Pasin
3 Mao, Cheng
3 Mishra, Debasis
3 Moran, Shay
3 Müller, Rudolf
3 Naor, Assaf
3 Nisan, Noam
3 Palazuelos, Carlos
3 Pellegrino, Daniel Marinho
3 Rettinger, Robert
3 Savani, Rahul
3 Sherstov, Alexander A.
3 Tal, Avishay
3 Vidick, Thomas
3 Wainwright, Martin J.
3 Zhang, Qin
3 Ziegler, Martin
3 Zuckerman, David
2 Bartholdi, Laurent
2 Ben-Amram, Amir M.
2 Boczkowski, Lucas
2 Borodin, Allan B.
2 Brody, Joshua E.
2 Buescu, Jorge
2 Burr, Michael A.
2 Censor-Hillel, Keren
2 Chlamtac, Eden
2 Damaschke, Peter
2 Dani, Varsha
2 Dashti, S. Ali
2 Dinur, Irit
2 Drucker, Andrew
2 Dudko, Dzmitry
2 Edalat, Abbas
2 Efremenko, Klim
2 Filmus, Yuval
2 Floyd, William J.
2 Fontes, Lila
2 Friedland, Shmuel
2 Ganor, Anat
2 Garg, Ankit
2 Geissmann, Barbara
2 Göös, Mika
2 Gopalan, Parikshit
2 Gu, Xiaoyang
2 Haramaty, Elad
2 Hatfield, John William
2 Herrmann, Samuel
2 Huang, Zengfeng
2 Jørgensen, Palle E. T.
2 Kabanets, Valentine
2 Kalies, William D.
2 Kawamura, Akitoshi
2 Kerenidis, Iordanis
2 Khot, Subhash Ajit
2 King, Jonathan L. F.
2 Kominers, Scott Duke
2 Korman, Amos
2 Kozachinskiy, Alexander
2 Kun-Ko, Young
...and 484 more Authors
all top 5

Cited in 117 Serials

28 SIAM Journal on Computing
18 Computational Complexity
14 Algorithmica
11 Theory of Computing Systems
9 Games and Economic Behavior
8 Journal of Economic Theory
7 Theoretical Computer Science
7 Mathematical Programming. Series A. Series B
7 Journal of the ACM
6 Communications in Mathematical Physics
5 Journal of Complexity
5 Journal of Machine Learning Research (JMLR)
4 Mathematics of Operations Research
4 Operations Research Letters
4 Annals of Pure and Applied Logic
4 Social Choice and Welfare
4 Information and Computation
4 SIAM Journal on Discrete Mathematics
4 Economics Letters
4 Distributed Computing
3 Information Processing Letters
3 The Annals of Statistics
3 Journal of Computer and System Sciences
3 Proceedings of the American Mathematical Society
3 Transactions of the American Mathematical Society
3 Discrete & Computational Geometry
3 MSCS. Mathematical Structures in Computer Science
3 European Journal of Operational Research
3 Foundations of Computational Mathematics
3 Games
3 ACM Transactions on Computation Theory
3 Arnold Mathematical Journal
2 Journal of Statistical Physics
2 Nonlinearity
2 Chaos, Solitons and Fractals
2 Advances in Mathematics
2 The Annals of Probability
2 International Journal of Game Theory
2 Journal of the American Statistical Association
2 Journal of Mathematical Economics
2 SIAM Journal on Control and Optimization
2 Ergodic Theory and Dynamical Systems
2 Combinatorica
2 Economic Theory
2 Discrete and Continuous Dynamical Systems
2 Journal of Systems Science and Complexity
2 Journal of Dynamics and Games
2 Discrete Analysis
1 Artificial Intelligence
1 Communications on Pure and Applied Mathematics
1 Discrete Applied Mathematics
1 Discrete Mathematics
1 Israel Journal of Mathematics
1 Linear and Multilinear Algebra
1 Problems of Information Transmission
1 Annales de l’Institut Fourier
1 Applied Mathematics and Computation
1 Automatica
1 BIT
1 Econometrica
1 Fundamenta Mathematicae
1 Geometriae Dedicata
1 International Economic Review
1 Inventiones Mathematicae
1 Journal of Computational and Applied Mathematics
1 Journal of Differential Equations
1 Memoirs of the American Mathematical Society
1 Numerische Mathematik
1 Operations Research
1 Acta Applicandae Mathematicae
1 Journal of Symbolic Computation
1 Probability Theory and Related Fields
1 Journal of Automated Reasoning
1 International Journal of Approximate Reasoning
1 Journal of the American Mathematical Society
1 Journal of Cryptology
1 Journal of Scientific Computing
1 The Annals of Applied Probability
1 Geometric and Functional Analysis. GAFA
1 L’Enseignement Mathématique. 2e Série
1 Linear Algebra and its Applications
1 SIAM Review
1 Bulletin of the American Mathematical Society. New Series
1 Archive for Mathematical Logic
1 New Zealand Journal of Mathematics
1 Annales de la Faculté des Sciences de Toulouse. Mathématiques. Série VI
1 Potential Analysis
1 The Journal of Analysis
1 Journal de Théorie des Nombres de Bordeaux
1 Combinatorics, Probability and Computing
1 Mathematical Logic Quarterly (MLQ)
1 Complexity
1 Journal of Difference Equations and Applications
1 Bernoulli
1 Sbornik: Mathematics
1 Annals of Mathematics. Second Series
1 Communications in Nonlinear Science and Numerical Simulation
1 Communications in Contemporary Mathematics
1 Review of Economic Design
1 Discrete and Continuous Dynamical Systems. Series B
...and 17 more Serials
all top 5

Cited in 37 Fields

181 Computer science (68-XX)
80 Game theory, economics, finance, and other social and behavioral sciences (91-XX)
50 Mathematical logic and foundations (03-XX)
41 Dynamical systems and ergodic theory (37-XX)
37 Information and communication theory, circuits (94-XX)
28 Operations research, mathematical programming (90-XX)
21 Combinatorics (05-XX)
19 Numerical analysis (65-XX)
17 Probability theory and stochastic processes (60-XX)
12 Functions of a complex variable (30-XX)
12 Quantum theory (81-XX)
11 Statistics (62-XX)
10 Functional analysis (46-XX)
10 Operator theory (47-XX)
9 Convex and discrete geometry (52-XX)
8 Linear and multilinear algebra; matrix theory (15-XX)
8 Manifolds and cell complexes (57-XX)
7 Systems theory; control (93-XX)
6 Number theory (11-XX)
6 Measure and integration (28-XX)
6 Ordinary differential equations (34-XX)
5 Real functions (26-XX)
5 Partial differential equations (35-XX)
5 Harmonic analysis on Euclidean spaces (42-XX)
4 History and biography (01-XX)
4 Order, lattices, ordered algebraic structures (06-XX)
4 Statistical mechanics, structure of matter (82-XX)
4 Biology and other natural sciences (92-XX)
3 Group theory and generalizations (20-XX)
2 Potential theory (31-XX)
2 Differential geometry (53-XX)
1 General and overarching topics; collections (00-XX)
1 Commutative algebra (13-XX)
1 Several complex variables and analytic spaces (32-XX)
1 Special functions (33-XX)
1 Difference and functional equations (39-XX)
1 General topology (54-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.