Edit Profile (opens in new tab) Braverman, Mark Compute Distance To: Compute Author ID: braverman.mark Published as: Braverman, Mark; Braverman, M. Further Spellings: Браверман Марк Homepage: http://www.cs.princeton.edu/~mbraverm External Links: MGP · Wikidata · Math-Net.Ru · dblp · GND · IdRef Awards: EMS Prize (2016) · Nevanlinna Prize (2022) · IMU Abacus Medal (2022) Documents Indexed: 91 Publications since 2001, including 1 Book 2 Contributions as Editor Co-Authors: 78 Co-Authors with 83 Joint Publications 2,249 Co-Co-Authors all top 5 Co-Authors 10 single-authored 10 Yampolsky, Michael 9 Weinstein, Omri 8 Rao, Anup 7 Binder, Ilia A. 7 Garg, Ankit 7 Gelles, Ran 7 Mao, Jieming 6 Efremenko, Klim 5 Kun-Ko, Young 4 Cook, Stephen Arthur 4 Haeupler, Bernhard 3 Ashlagi, Itai 3 Garg, Sumegha 3 Hassidim, Avinatan 3 McKenzie, Pierre 3 Pankratov, Denis 3 Rojas, Cristobal 3 Santhanam, Rahul 3 Wehr, Dustin 3 Weinberg, Seth Matthew 2 Alon, Noga M. 2 Austrin, Per 2 Balcan, Maria-Florina 2 Barak, Boaz 2 Chen, Xi 2 Chlamtac, Eden 2 Cohen, Gil 2 Kol, Gillat 2 Makarychev, Konstantin S. 2 Makarychev, Yury S. 2 Mossel, Elchanan 2 Naor, Assaf 2 Nguyen, Huy L. 2 Ostrovsky, Rafail 2 Raz, Ran 2 Schneider, Jon 2 Woodruff, David P. 2 Yehudayoff, Amir 1 Alekhnovich, Misha 1 Bhattacharyya, Arnab 1 Bonnot, Sylvain 1 Borgs, Christian 1 Borodin, Allan B. 1 Chayes, Jennifer Tour 1 Chazelle, Bernard 1 Chen, Shengyuan 1 Etesami, Omid 1 Feldman, Vitaly 1 Gameiro, Marcio F. 1 Ganor, Anat 1 Gärtner, Nadine 1 Grigo, Alexander 1 Gueron, Shay 1 Jin, Yasong 1 Juba, Brendan 1 Kannan, Sampath K. 1 Keyes, Edward 1 Klivans, Adam R. 1 Kulkarni, Raghav 1 Lavi, Ron 1 Lucier, Brendan 1 Lumelskii, Yan P. 1 Ma, Tengyu 1 Moitra, Ankur 1 Monderer, Dov 1 Oren, Joel 1 Oshman, Rotem 1 Oshri, Gal 1 Pitassi, Toniann 1 Roy, Sambuddha 1 Rubinstein, Aviad 1 Santosa, Fadil N. 1 Schvartzman, Ariel 1 Teng, Shang-Hua 1 Tennenholtz, Moshe 1 Touchette, Dave 1 Widjaya, Haris 1 Yitayew, Michael A. all top 5 Serials 6 SIAM Journal on Computing 4 IEEE Transactions on Information Theory 3 Communications in Mathematical Physics 3 Algorithmica 2 Journal of the ACM 2 Moscow Mathematical Journal 2 Theory of Computing 1 Nonlinearity 1 Arkiv för Matematik 1 Econometrica 1 Journal of Computer and System Sciences 1 Mathematics of Operations Research 1 Operations Research 1 Statistics & Probability Letters 1 Journal of the American Mathematical Society 1 The Annals of Applied Probability 1 Geometric and Functional Analysis. GAFA 1 SIAM Review 1 Notices of the American Mathematical Society 1 Distributed Computing 1 Computational Complexity 1 The Canadian Applied Mathematics Quarterly 1 Monte Carlo Methods and Applications 1 Sbornik: Mathematics 1 Theory of Computing Systems 1 Foundations of Computational Mathematics 1 Algorithms and Computation in Mathematics 1 The B. E. Journal of Theoretical Economics 1 Japanese Journal of Mathematics. 3rd Series 1 LIPIcs – Leibniz International Proceedings in Informatics 1 Forum of Mathematics, Pi 1 ACM Transactions on Computation Theory all top 5 Fields 66 Computer science (68-XX) 21 Information and communication theory, circuits (94-XX) 18 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 14 Dynamical systems and ergodic theory (37-XX) 8 Operations research, mathematical programming (90-XX) 6 Probability theory and stochastic processes (60-XX) 5 Mathematical logic and foundations (03-XX) 5 Combinatorics (05-XX) 5 Numerical analysis (65-XX) 4 Statistics (62-XX) 2 General and overarching topics; collections (00-XX) 2 Linear and multilinear algebra; matrix theory (15-XX) 2 Functions of a complex variable (30-XX) 1 Measure and integration (28-XX) 1 Potential theory (31-XX) 1 Difference and functional equations (39-XX) 1 Manifolds and cell complexes (57-XX) 1 Quantum theory (81-XX) 1 Systems theory; control (93-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 74 Publications have been cited 640 times in 399 Documents Cited by ▼ Year ▼ Non-computable Julia sets. Zbl 1099.37042Braverman, M.; Yampolsky, M. 39 2006 Computing over the reals: foundations for scientific computing. Zbl 1092.68038Braverman, Mark; Cook, Stephen 28 2006 Noisy sorting without resampling. Zbl 1192.94077Braverman, Mark; Mossel, Elchanan 23 2008 An information complexity approach to extended formulations. Zbl 1293.68137Braverman, Mark; Moitra, Ankur 22 2013 Monotonicity and implementability. Zbl 1271.91070Ashlagi, Itai; Braverman, Mark; Hassidim, Avinatan; Monderer, Dov 22 2010 How to compress interactive communication. Zbl 1293.68116Barak, Boaz; Braverman, Mark; Chen, Xi; Rao, Anup 21 2010 How to compress interactive communication. Zbl 1272.68138Barak, Boaz; Braverman, Mark; Chen, Xi; Rao, Anup 20 2013 Information equals amortized communication. Zbl 1292.94008Braverman, Mark; Rao, Anup 19 2011 Polylogarithmic independence fools \(\mathrm{AC}^{0}\) circuits. Zbl 1327.68108Braverman, Mark 17 2010 Stability in large matching markets with complementarities. Zbl 1303.91122Ashlagi, Itai; Braverman, Mark; Hassidim, Avinatan 16 2014 The Grothendieck constant is strictly smaller than Krivine’s bound. Zbl 1292.90243Braverman, Mark; Makarychev, Konstantin; Makarychev, Yury; Naor, Assaf 16 2011 Computability of Julia sets. Zbl 1161.37035Braverman, Mark; Yampolsky, Michael 16 2008 Information equals amortized communication. Zbl 1360.94124Braverman, Mark; Rao, Anup 15 2014 From information to exact communication. Zbl 1293.68160Braverman, Mark; Garg, Ankit; Pankratov, Denis; Weinstein, Omri 14 2013 Pseudorandom generators for regular branching programs. Zbl 1301.68192Braverman, Mark; Rao, Anup; Raz, Ran; Yehudayoff, Amir 14 2014 Filled Julia sets with empty interior are computable. Zbl 1160.37013Binder, I.; Braverman, M.; Yampolsky, M. 13 2007 On the computational complexity of the Riemann mapping. Zbl 1153.30005Binder, Ilia; Braverman, Mark; Yampolsky, Michael 13 2007 Termination of integer linear programs. Zbl 1188.68183Braverman, Mark 13 2006 Position auctions with budgets: existence and uniqueness. Zbl 1200.91118Ashlagi, Itai; Braverman, Mark; Hassidim, Avinatan; Lavi, Ron; Tennenholtz, Moshe 13 2010 Parabolic Julia sets are polynomial time computable. Zbl 1190.37049Braverman, Mark 13 2006 Interactive information complexity. Zbl 1286.94047Braverman, Mark 12 2012 Computability of Brolin-Lyubich measure. Zbl 1246.37070Binder, Ilia; Braverman, Mark; Rojas, Cristobal; Yampolsky, Michael 12 2011 On the convergence of the Hegselmann-Krause system. Zbl 1361.68106Bhattacharyya, Arnab; Braverman, Mark; Chazelle, Bernard; Nguyen, Huy L. 12 2013 Computability of Julia sets. Zbl 1314.37033Braverman, Mark; Yampolsky, Michael 11 2009 Interactive information complexity. Zbl 1330.68067Braverman, Mark 11 2015 The complexity of properly learning simple concept classes. Zbl 1151.68575Alekhnovich, Misha; Braverman, Mark; Feldman, Vitaly; Klivans, Adam R.; Pitassi, Toniann 10 2008 Towards coding for maximum errors in interactive communication. Zbl 1288.94092Braverman, Mark; Rao, Anup 10 2011 On computational complexity of Siegel Julia sets. Zbl 1233.68138Binder, I.; Braverman, M.; Yampolsky, M. 9 2006 Direct product via round-preserving compression. Zbl 1336.68086Braverman, Mark; Rao, Anup; Weinstein, Omri; Yehudayoff, Amir 9 2013 Towards deterministic tree code constructions. Zbl 1348.94095Braverman, Mark 8 2012 The Grothendieck constant is strictly smaller than Krivine’s bound. Zbl 1320.15016Braverman, Mark; Makarychev, Konstantin; Makarychev, Yury; Naor, Assaf 8 2013 List and unique coding for interactive communication in the presence of adversarial noise. Zbl 1420.94005Braverman, Mark; Efremenko, Klim 8 2017 Toward coding for maximum errors in interactive communication. Zbl 1360.94193Braverman, Mark; Rao, Anup 8 2014 A discrepancy lower bound for information complexity. Zbl 1372.68113Braverman, Mark; Weinstein, Omri 8 2012 Inapproximability of NP-complete variants of Nash equilibrium. Zbl 1366.68071Austrin, Per; Braverman, Mark; Chlamtáč, Eden 7 2013 Small value parallel repetition for general games. Zbl 1322.91010Braverman, Mark; Garg, Ankit 7 2015 Thurston equivalence to a rational map is decidable. Zbl 1329.37046Bonnot, Sylvain; Braverman, Mark; Yampolsky, Michael 7 2012 Reliable communication over highly connected noisy networks. Zbl 1373.68033Alon, Noga; Braverman, Mark; Efremenko, Klim; Gelles, Ran; Haeupler, Bernhard 7 2016 Approximating the best Nash equilibrium in \(n^{o(\log n)}\)-time breaks the exponential time hypothesis. Zbl 1372.68112Braverman, Mark; Kun Ko, Young; Weinstein, Omri 7 2015 Information lower bounds via self-reducibility. Zbl 1345.68153Braverman, Mark; Garg, Ankit; Pankratov, Denis; Weinstein, Omri 6 2013 ETH hardness for densest-\(k\)-subgraph with perfect completeness. Zbl 1409.68125Braverman, Mark; Ko, Young Kun; Rubinstein, Aviad; Weinstein, Omri 6 2017 Constructing locally connected non-computable Julia sets. Zbl 1190.37050Braverman, Mark; Yampolsky, Michael 6 2009 Communication lower bounds for statistical estimation problems via a distributed data processing inequality. Zbl 1373.68235Braverman, Mark; Garg, Ankit; Ma, Tengyu; Nguyen, Huy L.; Woodruff, David P. 6 2016 Derandomization of Euclidean random walks. Zbl 1171.68863Binder, Ilia; Braverman, Mark 6 2007 Noise vs computational intractability in dynamics. Zbl 1347.68122Braverman, Mark; Grigo, Alexander; Rojas, Cristobal 5 2012 A discrepancy lower bound for information complexity. Zbl 1353.68088Braverman, Mark; Weinstein, Omri 5 2016 Parallel algorithms for select and partition with noisy comparisons. Zbl 1375.68186Braverman, Mark; Mao, Jieming; Weinberg, S. Matthew 5 2016 Public vs private coin in bounded-round information. Zbl 1395.68116Braverman, Mark; Garg, Ankit 5 2014 An interactive information odometer and applications. Zbl 1321.68260Braverman, Mark; Weinstein, Omri 4 2015 Coding for interactive communication correcting insertions and deletions. Zbl 1390.94008Braverman, Mark; Gelles, Ran; Mao, Jieming; Ostrovsky, Rafail 4 2017 Constant-rate coding for multiparty interactive communication is impossible. Zbl 1373.68038Braverman, Mark; Efremenko, Klim; Gelles, Ran; Haeupler, Bernhard 4 2016 Coding for interactive communication correcting insertions and deletions. Zbl 1390.68314Braverman, Mark; Gelles, Ran; Mao, Jieming; Ostrovsky, Rafail 3 2016 Pseudorandom pseudo-distributions with near-optimal error for read-once branching programs. Zbl 1453.68211Braverman, Mark; Cohen, Gil; Garg, Sumegha 3 2020 The rate of convergence of the walk on spheres algorithm. Zbl 1268.60103Binder, Ilia; Braverman, Mark 3 2012 On information complexity in the broadcast model. Zbl 1333.68048Braverman, Mark; Oshman, Rotem 2 2015 Information complexity is computable. Zbl 1388.68059Braverman, Mark; Schneider, Jon 2 2016 Interpolating between truthful and non-truthful mechanisms for combinatorial auctions. Zbl 1417.91228Braverman, Mark; Mao, Jieming; Weinberg, S. Matthew 2 2016 On simultaneous two-player combinatorial auctions. Zbl 1403.91160Braverman, Mark; Mao, Jieming; Weinberg, S. Matthew 2 2018 Coding in undirected graphs is either very helpful or not helpful at all. Zbl 1402.90030Braverman, Mark; Garg, Sumegha; Schvartzman, Ariel 2 2017 Finding endogenously formed communities. Zbl 1422.68203Balcan, Maria-Florina; Borgs, Christian; Braverman, Mark; Chayes, Jennifer; Teng, Shang-Hua 2 2013 Optimal provision-after-wait in healthcare. Zbl 1334.90069Braverman, Mark; Chen, Jing; Kannan, Sampath 2 2016 Interactive information and coding theory. Zbl 1374.94707Braverman, Mark 2 2014 Interactive information complexity. Zbl 1380.68177Braverman, Mark 2 2017 Strategyproof mechanisms for competitive influence in networks. Zbl 1367.91154Borodin, Allan; Braverman, Mark; Lucier, Brendan; Oren, Joel 2 2017 Constructing non-computable Julia sets. Zbl 1232.37024Braverman, Mark; Yampolsky, Michael 2 2007 Inapproximability of NP-complete variants of Nash equilibrium. Zbl 1343.68089Austrin, Per; Braverman, Mark; Chlamtáč, Eden 1 2011 Branching programs for tree evaluation. Zbl 1250.68106Braverman, Mark; Cook, Stephen; McKenzie, Pierre; Santhanam, Rahul; Wehr, Dustin 1 2009 Constant-rate coding for multiparty interactive communication is impossible. Zbl 1426.68016Braverman, Mark; Efremenko, Klim; Gelles, Ran; Haeupler, Bernhard 1 2018 Interactive compression to external information. Zbl 1427.68075Braverman, Mark; Kol, Gillat 1 2018 Tight space-noise tradeoffs in computing the ergodic measure. Zbl 1390.68335Braverman, Mark; Rojas, Cristóbal; Schneider, Jon 1 2017 The complexity of simulating Brownian motion. Zbl 1425.65019Binder, Ilia; Braverman, Mark 1 2009 Information lower bounds via self-reducibility. Zbl 1356.68086Braverman, Mark; Garg, Ankit; Pankratov, Denis; Weinstein, Omri 1 2016 Nash equilibria in perturbation-stable games. Zbl 1380.91011Balcan, Maria-Florina; Braverman, Mark 1 2017 A candidate for a strong separation of information and communication. Zbl 1462.68054Braverman, Mark; Ganor, Anat; Kol, Gillat; Raz, Ran 1 2018 Pseudorandom pseudo-distributions with near-optimal error for read-once branching programs. Zbl 1453.68211Braverman, Mark; Cohen, Gil; Garg, Sumegha 3 2020 On simultaneous two-player combinatorial auctions. Zbl 1403.91160Braverman, Mark; Mao, Jieming; Weinberg, S. Matthew 2 2018 Constant-rate coding for multiparty interactive communication is impossible. Zbl 1426.68016Braverman, Mark; Efremenko, Klim; Gelles, Ran; Haeupler, Bernhard 1 2018 Interactive compression to external information. Zbl 1427.68075Braverman, Mark; Kol, Gillat 1 2018 A candidate for a strong separation of information and communication. Zbl 1462.68054Braverman, Mark; Ganor, Anat; Kol, Gillat; Raz, Ran 1 2018 List and unique coding for interactive communication in the presence of adversarial noise. Zbl 1420.94005Braverman, Mark; Efremenko, Klim 8 2017 ETH hardness for densest-\(k\)-subgraph with perfect completeness. Zbl 1409.68125Braverman, Mark; Ko, Young Kun; Rubinstein, Aviad; Weinstein, Omri 6 2017 Coding for interactive communication correcting insertions and deletions. Zbl 1390.94008Braverman, Mark; Gelles, Ran; Mao, Jieming; Ostrovsky, Rafail 4 2017 Coding in undirected graphs is either very helpful or not helpful at all. Zbl 1402.90030Braverman, Mark; Garg, Sumegha; Schvartzman, Ariel 2 2017 Interactive information complexity. Zbl 1380.68177Braverman, Mark 2 2017 Strategyproof mechanisms for competitive influence in networks. Zbl 1367.91154Borodin, Allan; Braverman, Mark; Lucier, Brendan; Oren, Joel 2 2017 Tight space-noise tradeoffs in computing the ergodic measure. Zbl 1390.68335Braverman, Mark; Rojas, Cristóbal; Schneider, Jon 1 2017 Nash equilibria in perturbation-stable games. Zbl 1380.91011Balcan, Maria-Florina; Braverman, Mark 1 2017 Reliable communication over highly connected noisy networks. Zbl 1373.68033Alon, Noga; Braverman, Mark; Efremenko, Klim; Gelles, Ran; Haeupler, Bernhard 7 2016 Communication lower bounds for statistical estimation problems via a distributed data processing inequality. Zbl 1373.68235Braverman, Mark; Garg, Ankit; Ma, Tengyu; Nguyen, Huy L.; Woodruff, David P. 6 2016 A discrepancy lower bound for information complexity. Zbl 1353.68088Braverman, Mark; Weinstein, Omri 5 2016 Parallel algorithms for select and partition with noisy comparisons. Zbl 1375.68186Braverman, Mark; Mao, Jieming; Weinberg, S. Matthew 5 2016 Constant-rate coding for multiparty interactive communication is impossible. Zbl 1373.68038Braverman, Mark; Efremenko, Klim; Gelles, Ran; Haeupler, Bernhard 4 2016 Coding for interactive communication correcting insertions and deletions. Zbl 1390.68314Braverman, Mark; Gelles, Ran; Mao, Jieming; Ostrovsky, Rafail 3 2016 Information complexity is computable. Zbl 1388.68059Braverman, Mark; Schneider, Jon 2 2016 Interpolating between truthful and non-truthful mechanisms for combinatorial auctions. Zbl 1417.91228Braverman, Mark; Mao, Jieming; Weinberg, S. Matthew 2 2016 Optimal provision-after-wait in healthcare. Zbl 1334.90069Braverman, Mark; Chen, Jing; Kannan, Sampath 2 2016 Information lower bounds via self-reducibility. Zbl 1356.68086Braverman, Mark; Garg, Ankit; Pankratov, Denis; Weinstein, Omri 1 2016 Interactive information complexity. Zbl 1330.68067Braverman, Mark 11 2015 Small value parallel repetition for general games. Zbl 1322.91010Braverman, Mark; Garg, Ankit 7 2015 Approximating the best Nash equilibrium in \(n^{o(\log n)}\)-time breaks the exponential time hypothesis. Zbl 1372.68112Braverman, Mark; Kun Ko, Young; Weinstein, Omri 7 2015 An interactive information odometer and applications. Zbl 1321.68260Braverman, Mark; Weinstein, Omri 4 2015 On information complexity in the broadcast model. Zbl 1333.68048Braverman, Mark; Oshman, Rotem 2 2015 Stability in large matching markets with complementarities. Zbl 1303.91122Ashlagi, Itai; Braverman, Mark; Hassidim, Avinatan 16 2014 Information equals amortized communication. Zbl 1360.94124Braverman, Mark; Rao, Anup 15 2014 Pseudorandom generators for regular branching programs. Zbl 1301.68192Braverman, Mark; Rao, Anup; Raz, Ran; Yehudayoff, Amir 14 2014 Toward coding for maximum errors in interactive communication. Zbl 1360.94193Braverman, Mark; Rao, Anup 8 2014 Public vs private coin in bounded-round information. Zbl 1395.68116Braverman, Mark; Garg, Ankit 5 2014 Interactive information and coding theory. Zbl 1374.94707Braverman, Mark 2 2014 An information complexity approach to extended formulations. Zbl 1293.68137Braverman, Mark; Moitra, Ankur 22 2013 How to compress interactive communication. Zbl 1272.68138Barak, Boaz; Braverman, Mark; Chen, Xi; Rao, Anup 20 2013 From information to exact communication. Zbl 1293.68160Braverman, Mark; Garg, Ankit; Pankratov, Denis; Weinstein, Omri 14 2013 On the convergence of the Hegselmann-Krause system. Zbl 1361.68106Bhattacharyya, Arnab; Braverman, Mark; Chazelle, Bernard; Nguyen, Huy L. 12 2013 Direct product via round-preserving compression. Zbl 1336.68086Braverman, Mark; Rao, Anup; Weinstein, Omri; Yehudayoff, Amir 9 2013 The Grothendieck constant is strictly smaller than Krivine’s bound. Zbl 1320.15016Braverman, Mark; Makarychev, Konstantin; Makarychev, Yury; Naor, Assaf 8 2013 Inapproximability of NP-complete variants of Nash equilibrium. Zbl 1366.68071Austrin, Per; Braverman, Mark; Chlamtáč, Eden 7 2013 Information lower bounds via self-reducibility. Zbl 1345.68153Braverman, Mark; Garg, Ankit; Pankratov, Denis; Weinstein, Omri 6 2013 Finding endogenously formed communities. Zbl 1422.68203Balcan, Maria-Florina; Borgs, Christian; Braverman, Mark; Chayes, Jennifer; Teng, Shang-Hua 2 2013 Interactive information complexity. Zbl 1286.94047Braverman, Mark 12 2012 Towards deterministic tree code constructions. Zbl 1348.94095Braverman, Mark 8 2012 A discrepancy lower bound for information complexity. Zbl 1372.68113Braverman, Mark; Weinstein, Omri 8 2012 Thurston equivalence to a rational map is decidable. Zbl 1329.37046Bonnot, Sylvain; Braverman, Mark; Yampolsky, Michael 7 2012 Noise vs computational intractability in dynamics. Zbl 1347.68122Braverman, Mark; Grigo, Alexander; Rojas, Cristobal 5 2012 The rate of convergence of the walk on spheres algorithm. Zbl 1268.60103Binder, Ilia; Braverman, Mark 3 2012 Information equals amortized communication. Zbl 1292.94008Braverman, Mark; Rao, Anup 19 2011 The Grothendieck constant is strictly smaller than Krivine’s bound. Zbl 1292.90243Braverman, Mark; Makarychev, Konstantin; Makarychev, Yury; Naor, Assaf 16 2011 Computability of Brolin-Lyubich measure. Zbl 1246.37070Binder, Ilia; Braverman, Mark; Rojas, Cristobal; Yampolsky, Michael 12 2011 Towards coding for maximum errors in interactive communication. Zbl 1288.94092Braverman, Mark; Rao, Anup 10 2011 Inapproximability of NP-complete variants of Nash equilibrium. Zbl 1343.68089Austrin, Per; Braverman, Mark; Chlamtáč, Eden 1 2011 Monotonicity and implementability. Zbl 1271.91070Ashlagi, Itai; Braverman, Mark; Hassidim, Avinatan; Monderer, Dov 22 2010 How to compress interactive communication. Zbl 1293.68116Barak, Boaz; Braverman, Mark; Chen, Xi; Rao, Anup 21 2010 Polylogarithmic independence fools \(\mathrm{AC}^{0}\) circuits. Zbl 1327.68108Braverman, Mark 17 2010 Position auctions with budgets: existence and uniqueness. Zbl 1200.91118Ashlagi, Itai; Braverman, Mark; Hassidim, Avinatan; Lavi, Ron; Tennenholtz, Moshe 13 2010 Computability of Julia sets. Zbl 1314.37033Braverman, Mark; Yampolsky, Michael 11 2009 Constructing locally connected non-computable Julia sets. Zbl 1190.37050Braverman, Mark; Yampolsky, Michael 6 2009 Branching programs for tree evaluation. Zbl 1250.68106Braverman, Mark; Cook, Stephen; McKenzie, Pierre; Santhanam, Rahul; Wehr, Dustin 1 2009 The complexity of simulating Brownian motion. Zbl 1425.65019Binder, Ilia; Braverman, Mark 1 2009 Noisy sorting without resampling. Zbl 1192.94077Braverman, Mark; Mossel, Elchanan 23 2008 Computability of Julia sets. Zbl 1161.37035Braverman, Mark; Yampolsky, Michael 16 2008 The complexity of properly learning simple concept classes. Zbl 1151.68575Alekhnovich, Misha; Braverman, Mark; Feldman, Vitaly; Klivans, Adam R.; Pitassi, Toniann 10 2008 Filled Julia sets with empty interior are computable. Zbl 1160.37013Binder, I.; Braverman, M.; Yampolsky, M. 13 2007 On the computational complexity of the Riemann mapping. Zbl 1153.30005Binder, Ilia; Braverman, Mark; Yampolsky, Michael 13 2007 Derandomization of Euclidean random walks. Zbl 1171.68863Binder, Ilia; Braverman, Mark 6 2007 Constructing non-computable Julia sets. Zbl 1232.37024Braverman, Mark; Yampolsky, Michael 2 2007 Non-computable Julia sets. Zbl 1099.37042Braverman, M.; Yampolsky, M. 39 2006 Computing over the reals: foundations for scientific computing. Zbl 1092.68038Braverman, Mark; Cook, Stephen 28 2006 Termination of integer linear programs. Zbl 1188.68183Braverman, Mark 13 2006 Parabolic Julia sets are polynomial time computable. Zbl 1190.37049Braverman, Mark 13 2006 On computational complexity of Siegel Julia sets. Zbl 1233.68138Binder, I.; Braverman, M.; Yampolsky, M. 9 2006 all cited Publications top 5 cited Publications all top 5 Cited by 659 Authors 20 Braverman, Mark 18 Yampolsky, Michael 13 Rojas, Cristobal 10 Pokutta, Sebastian 8 Zhong, Ning 7 Binder, Ilia A. 7 Gelles, Ran 7 Graça, Daniel Silva 6 Braun, Gábor 6 Ko, Ker-I 6 Kojima, Fuhito 5 Briët, Jop 5 Chattopadhyay, Arkadev 5 Deligkas, Argyrios 5 Fearnley, John 5 Fiorini, Samuel 5 Jain, Rahul 5 Leucci, Stefano 5 Liu, Chih-Hung 5 Lutz, Jack H. 5 Meir, Or 5 Yehudayoff, Amir 5 Yu, Fuxiang 4 Carbajal, Juan Carlos 4 Chazelle, Bernard 4 Dudko, Artem 4 Gonen, Rica 4 Haeupler, Bernhard 4 Hoza, William M. 4 Kol, Gillat 4 Lerner, Anat 4 Loff, Bruno 4 Pitassi, Toniann 4 Shpilka, Amir 4 Viola, Emanuele 4 Weinstein, Omri 4 Ziegler, Martin 3 Arunachalam, Srinivasan 3 Ben-Amram, Amir M. 3 Brody, Joshua E. 3 Cenzer, Douglas 3 Dobzinski, Shahar 3 Efremenko, Klim 3 Galatolo, Stefano 3 Geissmann, Barbara 3 Genaim, Samir 3 Hatami, Pooya 3 Kleinberg, Robert D. 3 Koucký, Michal 3 Lee, Troy 3 Lovett, Shachar 3 Manurangsi, Pasin 3 Mao, Cheng 3 Mayordomo, Elvira 3 McNicholl, Timothy H. 3 Mishra, Debasis 3 Moran, Shay 3 Müller, Rudolf 3 Naor, Assaf 3 Neumann, Eike 3 Nisan, Noam 3 Palazuelos, Carlos 3 Pellegrino, Daniel Marinho 3 Penna, Paolo 3 Rettinger, Robert 3 Savani, Rahul 3 Sherstov, Alexander A. 3 Šíma, Jiří 3 Spirakis, Paul G. 3 Tal, Avishay 3 Vidick, Thomas 3 Wainwright, Martin J. 3 Zak, Stanislav 3 Zhang, Qin 3 Zuckerman, David 2 Andreev, Valentin V. 2 Assadi, Sepehr 2 Bartholdi, Laurent 2 Boczkowski, Lucas 2 Borodin, Allan B. 2 Buescu, Jorge 2 Buhrman, Harry 2 Burr, Michael A. 2 Censor-Hillel, Keren 2 Chlamtac, Eden 2 Cohen, Gil 2 Damaschke, Peter 2 Dani, Varsha 2 Dashti, S. Ali 2 Dinur, Irit 2 Doron, Dean 2 Drucker, Andrew 2 Dudko, Dzmitry 2 Edalat, Abbas 2 Filmus, Yuval 2 Floyd, William J. 2 Fontes, Lila 2 Friedland, Shmuel 2 Ganor, Anat 2 Gao, Chao ...and 559 more Authors all top 5 Cited in 123 Serials 30 SIAM Journal on Computing 19 Computational Complexity 15 Algorithmica 11 Games and Economic Behavior 11 Theory of Computing Systems 9 Journal of Economic Theory 8 Theoretical Computer Science 7 Mathematical Programming. Series A. Series B 7 Journal of the ACM 6 Communications in Mathematical Physics 6 The Annals of Statistics 5 Operations Research Letters 5 Journal of Complexity 5 Journal of Machine Learning Research (JMLR) 4 Journal of Computer and System Sciences 4 Mathematics of Operations Research 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 4 Foundations of Computational Mathematics 3 Information Processing Letters 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 Economic Theory 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 Operations Research 2 SIAM Journal on Control and Optimization 2 Ergodic Theory and Dynamical Systems 2 Combinatorica 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 Canadian Journal of Mathematics 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 Acta Applicandae Mathematicae 1 Physica D 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 The Journal of Artificial Intelligence Research (JAIR) 1 Complexity 1 Journal of Difference Equations and Applications 1 Bernoulli 1 Sbornik: Mathematics 1 Annals of Mathematics. Second Series 1 Interdisciplinary Information Sciences (IIS) ...and 23 more Serials all top 5 Cited in 37 Fields 210 Computer science (68-XX) 90 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 56 Mathematical logic and foundations (03-XX) 43 Information and communication theory, circuits (94-XX) 41 Dynamical systems and ergodic theory (37-XX) 33 Operations research, mathematical programming (90-XX) 24 Combinatorics (05-XX) 19 Probability theory and stochastic processes (60-XX) 19 Numerical analysis (65-XX) 14 Statistics (62-XX) 12 Functions of a complex variable (30-XX) 12 Quantum theory (81-XX) 10 Functional analysis (46-XX) 10 Operator theory (47-XX) 10 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.