| 2013 | SODA | Fast matrix multiplication using coherent configurations. | Henry Cohn, Christopher Umans |
| 2010 | SODA | Inapproximability for VCG-Based Combinatorial Auctions. | David Buchfuhrer, Shaddin Dughmi, Hu Fu, Robert Kleinberg, Elchanan Mossel, Christos H. Papadimitriou, Michael Schapira, Yaron Singer, Christopher Umans |
| 2009 | FOCS | The Complexity of Rationalizing Network Formation. | Shankar Kalyanaraman, Christopher Umans |
| 2008 | FOCS | Fast Modular Composition in any Characteristic. | Kiran S. Kedlaya, Christopher Umans |
| 2008 | ICALP | The Complexity of Boolean Formula Minimization. | David Buchfuhrer, Christopher Umans |
| 2008 | ISAAC | The Complexity of Rationalizing Matchings. | Shankar Kalyanaraman, Christopher Umans |
| 2008 | STOC | Fast polynomial factorization and modular composition in small characteristic. | Christopher Umans |
| 2007 | ESA | Algorithms for Playing Games with Limited Randomness. | Shankar Kalyanaraman, Christopher Umans |
| 2007 | STOC | Low-end uniform hardness vs. randomness tradeoffs for AM. | Ronen Shaltiel, Christopher Umans |
| 2006 | FOCS | Better lossless condensers through derandomized curve samplers. | Amnon Ta-Shma, Christopher Umans |
| 2006 | ISSAC | Group-theoretic algorithms for matrix multiplication. | Christopher Umans |
| 2006 | TAMC | Optimization Problems in the Polynomial-Time Hierarchy. | Christopher Umans |
| 2005 | FOCS | Group-theoretic Algorithms for Matrix Multiplication. | Henry Cohn, Robert D. Kleinberg, Balzs Szegedy, Christopher Umans |
| 2003 | FOCS | A Group-Theoretic Approach to Fast Matrix Multiplication. | Henry Cohn, Christopher Umans |
| 2002 | STOC | Pseudo-random generators for all hardnesses. | Christopher Umans |
| 2001 | FOCS | Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator. | Ronen Shaltiel, Christopher Umans |
| 2001 | STOC | Loss-less condensers, unbalanced expanders, and extractors. | Amnon Ta-Shma, Christopher Umans, David Zuckerman |
| 1999 | FOCS | Hardness of Approximating Sigma | Christopher Umans |
| 1999 | ICALP | On the Complexity and Inapproximability of Shortest Implicant Problems. | Christopher Umans |
| 1998 | FOCS | The Minimum Equivalent DNF Problem and Shortest Implicants. | Christopher Umans |
| 1998 | MICCAI | AnatomyBrowser: A Framework for Integration of Medical Information. | Polina Golland, Ron Kikinis, Christopher Umans, Michael Halle, Martha Elizabeth Shenton, Jens A. Richolt |
| 1997 | FOCS | Hamiltonian Cycles in Solid Grid Graphs. | Christopher Umans, William J. Lenhart |