☰

Christopher M. Umans, Ph.D. - Publications

Affiliations: 
2000 University of California, Berkeley, Berkeley, CA, United States 
Area:
Biosystems & Computational Biology (BIO); Database Management Systems (DBMS); Theory (THY)
Tree Info Similar researchers PubMed Report error

17 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Hsu CC, Umans C. A New Algorithm for Fast Generalized DFTs Acm Transactions On Algorithms. 16: 1-20. DOI: 10.1145/3301313  0.32
2017 Blasiak J, Church T, Cohn H, Grochow JA, Naslund E, Sawin WF, Umans C. On cap sets and the group-theoretic approach to matrix multiplication Arxiv: Combinatorics. 5202017: 1245. DOI: 10.19086/Da.1245  0.31
2014 Umans C. Special Issue Conference on Computational Complexity 2013 Guest editor's foreword Computational Complexity. 23: 147-149. DOI: 10.1007/S00037-014-0088-X  0.334
2013 Alon N, Shpilka A, Umans C. On sunflowers and matrix multiplication Computational Complexity. 22: 219-243. DOI: 10.1007/S00037-013-0060-1  0.335
2012 Immorlica N, Katz J, Mitzenmacher M, Servedio RA, Umans C. Special Section on the Forty-First Annual ACM Symposium on Theory of Computing (STOC 2009) Siam Journal On Computing. 41: 1591-1592. DOI: 10.1137/120973305  0.325
2011 Kedlaya KS, Umans C. Fast polynomial factorization and modular composition Siam Journal On Computing. 40: 1767-1802. DOI: 10.1137/08073408X  0.368
2011 Buchfuhrer D, Umans C. The complexity of Boolean formula minimization Journal of Computer and System Sciences. 77: 142-153. DOI: 10.1016/J.Jcss.2010.06.011  0.34
2010 Lee JR, Umans C. Special Section On Foundations of Computer Science Siam Journal On Computing. 39: 2397-2397. DOI: 10.1137/Smjcat000039000006002397000001  0.341
2009 Guruswami V, Umans C, Vadhan S. Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes Journal of the Acm. 56. DOI: 10.1145/1538902.1538904  0.337
2009 Shaltiel R, Umans C. Low-End Uniform Hardness versus Randomness Tradeoffs for AM Siam Journal On Computing. 39: 1006-1037. DOI: 10.1137/070698348  0.409
2009 Asodi V, Umans C. The complexity of the matroid–greedoid partition problem Theoretical Computer Science. 410: 859-866. DOI: 10.1016/J.Tcs.2008.11.019  0.403
2008 Fortnow L, Impagliazzo R, Kabanets V, Umans C. On the complexity of succinct zero-sum games Computational Complexity. 17: 353-376. DOI: 10.1007/S00037-008-0252-2  0.395
2007 Ta-Shma A, Umans C, Zuckerman D. Lossless Condensers, Unbalanced Expanders, And Extractors Combinatorica. 27: 213-240. DOI: 10.1007/S00493-007-0053-2  0.306
2006 Umans C, Villa T, Sangiovanni-Vincentelli AL. Complexity of two-level logic minimization Ieee Transactions On Computer-Aided Design of Integrated Circuits and Systems. 25: 1230-1246. DOI: 10.1109/Tcad.2005.855944  0.359
2006 Shaltiel R, Umans C. Pseudorandomness for Approximate Counting and Sampling Computational Complexity. 15: 298-341. DOI: 10.1007/S00037-007-0218-9  0.375
2005 Shaltiel R, Umans C. Simple extractors for all min-entropies and a new pseudorandom generator Journal of the Acm. 52: 172-216. DOI: 10.1145/1059513.1059516  0.405
2001 Umans C. The Minimum Equivalent DNF Problem and Shortest Implicants Journal of Computer and System Sciences. 63: 597-611. DOI: 10.1006/Jcss.2001.1775  0.378
Show low-probability matches.