×

zbMATH — the first resource for mathematics

Umans, Christopher

Compute Distance To:
Author ID: umans.christopher Recent zbMATH articles by "Umans, Christopher"
Published as: Umans, Christopher
Documents Indexed: 31 Publications since 1999

Publications by Year

Citations contained in zbMATH Open

24 Publications have been cited 210 times in 171 Documents Cited by Year
Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. Zbl 1325.68169
Guruswami, Venkatesan; Umans, Christopher; Vadhan, Salil
35
2009
Fast polynomial factorization and modular composition. Zbl 1333.11117
Kedlaya, Kiran S.; Umans, Christopher
33
2011
Simple extractors for all min-entropies and a new pseudorandom generator. Zbl 1317.68132
Shaltiel, Ronen; Umans, Christopher
20
2005
The minimum equivalent DNF problem and shortest implicants. Zbl 1006.68053
Umans, Christopher
16
2001
Pseudorandomness for approximate counting and sampling. Zbl 1125.68058
Shaltiel, Ronen; Umans, Christopher
13
2006
Pseudo-random generators for all hardnesses. Zbl 1072.68129
Umans, Christopher
13
2003
On sunflowers and matrix multiplication. Zbl 1268.05223
Alon, Noga; Shpilka, Amir; Umans, Christopher
12
2013
Loss-less condensers, unbalanced expanders, and extractors. Zbl 1323.68263
Ta-Shma, Amnon; Umans, Christopher; Zuckerman, David
12
2001
On the complexity of succinct zero-sum games. Zbl 1162.91302
Fortnow, Lance; Impagliazzo, Russell; Kabanets, Valentine; Umans, Christopher
10
2008
Lossless condensers, unbalanced expanders, and extractors. Zbl 1164.68004
Ta-Shma, Amnon; Umans, Christopher; Zuckerman, David
7
2007
Fast polynomial factorization and modular composition in small characteristic. Zbl 1231.68294
Umans, Christopher
6
2008
The complexity of Boolean formula minimization. Zbl 1218.68089
Buchfuhrer, David; Umans, Christopher
4
2011
Low-end uniform hardness versus randomness tradeoffs for AM. Zbl 1194.68120
Shaltiel, Ronen; Umans, Christopher
4
2009
The complexity of rationalizing matchings. Zbl 1183.68311
Kalyanaraman, Shankar; Umans, Christopher
4
2008
The complexity of Boolean formula minimization. Zbl 1152.68445
Buchfuhrer, David; Umans, Christopher
4
2008
Algorithms for playing games with limited randomness. Zbl 1151.91321
Kalyanaraman, Shankar; Umans, Christopher
4
2007
On the complexity of approximating the VC dimension. Zbl 1059.68049
Mossel, Elchanan; Umans, Christopher
3
2002
Fast matrix multiplication using coherent configurations. Zbl 1425.65060
Cohn, Henry; Umans, Christopher
2
2013
On beating the hybrid argument. Zbl 1347.68159
Fefferman, Bill; Shaltiel, Ronen; Umans, Christopher; Viola, Emanuele
2
2012
Pseudo-random generators for all hardnesses. Zbl 1192.68863
Umans, Christopher
2
2002
On beating the hybrid argument. Zbl 1298.81047
Fefferman, Bill; Shaltiel, Ronen; Umans, Christopher; Viola, Emanuele
1
2013
The complexity of rationalizing network formation. Zbl 1292.91151
Kalyanaraman, Shankar; Umans, Christopher
1
2009
The complexity of the matroid-greedoid partition problem. Zbl 1162.68016
Asodi, Vera; Umans, Christopher
1
2009
Low-end uniform hardness vs. randomness tradeoffs for AM. Zbl 1232.68059
Shaltiel, Ronen; Umans, Christopher
1
2007
On sunflowers and matrix multiplication. Zbl 1268.05223
Alon, Noga; Shpilka, Amir; Umans, Christopher
12
2013
Fast matrix multiplication using coherent configurations. Zbl 1425.65060
Cohn, Henry; Umans, Christopher
2
2013
On beating the hybrid argument. Zbl 1298.81047
Fefferman, Bill; Shaltiel, Ronen; Umans, Christopher; Viola, Emanuele
1
2013
On beating the hybrid argument. Zbl 1347.68159
Fefferman, Bill; Shaltiel, Ronen; Umans, Christopher; Viola, Emanuele
2
2012
Fast polynomial factorization and modular composition. Zbl 1333.11117
Kedlaya, Kiran S.; Umans, Christopher
33
2011
The complexity of Boolean formula minimization. Zbl 1218.68089
Buchfuhrer, David; Umans, Christopher
4
2011
Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. Zbl 1325.68169
Guruswami, Venkatesan; Umans, Christopher; Vadhan, Salil
35
2009
Low-end uniform hardness versus randomness tradeoffs for AM. Zbl 1194.68120
Shaltiel, Ronen; Umans, Christopher
4
2009
The complexity of rationalizing network formation. Zbl 1292.91151
Kalyanaraman, Shankar; Umans, Christopher
1
2009
The complexity of the matroid-greedoid partition problem. Zbl 1162.68016
Asodi, Vera; Umans, Christopher
1
2009
On the complexity of succinct zero-sum games. Zbl 1162.91302
Fortnow, Lance; Impagliazzo, Russell; Kabanets, Valentine; Umans, Christopher
10
2008
Fast polynomial factorization and modular composition in small characteristic. Zbl 1231.68294
Umans, Christopher
6
2008
The complexity of rationalizing matchings. Zbl 1183.68311
Kalyanaraman, Shankar; Umans, Christopher
4
2008
The complexity of Boolean formula minimization. Zbl 1152.68445
Buchfuhrer, David; Umans, Christopher
4
2008
Lossless condensers, unbalanced expanders, and extractors. Zbl 1164.68004
Ta-Shma, Amnon; Umans, Christopher; Zuckerman, David
7
2007
Algorithms for playing games with limited randomness. Zbl 1151.91321
Kalyanaraman, Shankar; Umans, Christopher
4
2007
Low-end uniform hardness vs. randomness tradeoffs for AM. Zbl 1232.68059
Shaltiel, Ronen; Umans, Christopher
1
2007
Pseudorandomness for approximate counting and sampling. Zbl 1125.68058
Shaltiel, Ronen; Umans, Christopher
13
2006
Simple extractors for all min-entropies and a new pseudorandom generator. Zbl 1317.68132
Shaltiel, Ronen; Umans, Christopher
20
2005
Pseudo-random generators for all hardnesses. Zbl 1072.68129
Umans, Christopher
13
2003
On the complexity of approximating the VC dimension. Zbl 1059.68049
Mossel, Elchanan; Umans, Christopher
3
2002
Pseudo-random generators for all hardnesses. Zbl 1192.68863
Umans, Christopher
2
2002
The minimum equivalent DNF problem and shortest implicants. Zbl 1006.68053
Umans, Christopher
16
2001
Loss-less condensers, unbalanced expanders, and extractors. Zbl 1323.68263
Ta-Shma, Amnon; Umans, Christopher; Zuckerman, David
12
2001
all top 5

Cited by 282 Authors

10 Shaltiel, Ronen
7 Čepek, Ondřej
7 Lecerf, Grégoire
7 van der Hoeven, Joris
6 Schost, Éric
5 Kučera, Petr
5 Ta-Shma, Amnon
4 Doliskani, Javad
4 Umans, Christopher
4 Watson, Thomas C.
4 Williams, Richard Ryan
3 Allender, Eric W.
3 Artemenko, Sergei
3 Cohen, Gil
3 Demuynck, Thomas
3 Janota, Mikoláš
3 Marques-Silva, João P.
3 Saxena, Nitin
3 van Melkebeek, Dieter
3 Zuckerman, David
2 Aydinlioǧlu, Bariş
2 Björklund, Andreas
2 Boros, Endre
2 Buhrman, Harry
2 Chakaravarthy, Venkatesan T.
2 Chattopadhyay, Eshan
2 Cheraghchi, Mahdi
2 Cherchye, Laurens
2 Christandl, Matthias
2 De Rock, Bram
2 Gabizon, Ariel
2 Gashkov, Sergey B.
2 Goldreich, Oded
2 Grigorescu, Elena
2 Hermelin, Danny
2 Hitchcock, John M.
2 Huang, Chien-Chung
2 Hubáček, Pavel
2 Ianovski, Egor
2 Kanukurthi, Bhavana
2 Kaski, Petteri
2 Kinne, Jeff
2 Kowalski, Dariusz R.
2 Kratsch, Stefan
2 Musatov, Daniil
2 Naor, Moni
2 Ong, Luke
2 Ostrovsky, Rafail
2 Petit, Christophe
2 Poteaux, Adrien
2 Raz, Ran
2 Rojas, J. Maurice
2 Romashchenko, Andrei
2 Roy, Sambuddha
2 Santhanam, Rahul
2 Ullman, Jonathan R.
2 Vereshchagin, Nikolay K.
2 Vinodchandran, N. Variyam
2 Wahlström, Magnus
2 Xie, Ning
2 Zimand, Marius
2 Zuiddam, Jeroen
1 Abdalla, Michel
1 Agrawal, Manindra
1 Alon, Noga M.
1 Applebaum, Benny
1 Arora, Manuel
1 Arpe, Jan
1 Arvind, Vikraman
1 Asodi, Vera
1 Ateniese, Giuseppe
1 Badrinarayanan, Saikrishna
1 Balcan, Maria-Florina
1 Baltz, Andreas
1 Baumeister, Dorothea
1 Bauwens, Bruno
1 Belazzougui, Djamal
1 Belov, Anton
1 Ben-Aroya, Avraham
1 Benhamouda, Fabrice
1 Bi, Jingguo
1 Bitansky, Nir
1 Bourgain, Jean
1 Brandt, Felix
1 Brieulle, Ludovic
1 Brown, Christopher W.
1 Buchfuhrer, David
1 Büscher, Niklas
1 Cai, Jin-Yi
1 Chandran, Nishanth
1 Chandrasekaran, Karthekeyan
1 Chen, Zhenyu
1 Cheng, Qi
1 Cho, Gook Hwa
1 Chromý, Miloš
1 Cilleruelo, Javier
1 Clarke, Edmund Melson jun.
1 Crama, Yves
1 Cui, Jingyi
1 Davenport, James Harold
...and 182 more Authors
all top 5

Cited in 53 Serials

22 Computational Complexity
11 SIAM Journal on Computing
10 Journal of Computer and System Sciences
7 Theoretical Computer Science
6 Journal of Complexity
6 Algorithmica
6 Theory of Computing Systems
5 Artificial Intelligence
5 Mathematics of Computation
5 Journal of Symbolic Computation
4 Information Processing Letters
4 Journal of Cryptology
3 Random Structures & Algorithms
3 Applicable Algebra in Engineering, Communication and Computing
2 Discrete Applied Mathematics
2 Journal of Mathematical Economics
2 Information and Computation
2 Designs, Codes and Cryptography
2 Journal of the ACM
2 Philosophical Transactions of the Royal Society of London. Series A. Mathematical, Physical and Engineering Sciences
2 LMS Journal of Computation and Mathematics
2 Discrete Mathematics, Algorithms and Applications
1 Discrete Mathematics
1 International Journal of Theoretical Physics
1 Moscow University Mathematics Bulletin
1 Operations Research
1 Proceedings of the London Mathematical Society. Third Series
1 Transactions of the American Mathematical Society
1 Combinatorica
1 Linear Algebra and its Applications
1 Bulletin of the American Mathematical Society. New Series
1 Distributed Computing
1 Chinese Science Bulletin
1 Journal of Algebraic Combinatorics
1 Formal Methods in System Design
1 Combinatorics, Probability and Computing
1 Journal of Mathematical Sciences (New York)
1 Finite Fields and their Applications
1 The Electronic Journal of Combinatorics
1 The Journal of Artificial Intelligence Research (JAIR)
1 Annals of Mathematics and Artificial Intelligence
1 Sbornik: Mathematics
1 Soft Computing
1 Journal of Combinatorial Optimization
1 Annals of Mathematics. Second Series
1 Lobachevskii Journal of Mathematics
1 Foundations of Computational Mathematics
1 Discrete Optimization
1 Journal of Mathematical Cryptology
1 Forum of Mathematics, Sigma
1 Journal of the Operations Research Society of China
1 JSIAM Letters
1 ACM Transactions on Computation Theory

Citations by Year