Hamiltonian Cycles in Solid Grid Graphs. - Christopher Umans; William J. Lenhart (FOCS, 1997)

AnatomyBrowser: A Framework for Integration of Medical Information. - Polina Golland; Ron Kikinis; Christopher Umans; Michael Halle; Martha Elizabeth Shenton; Jens A. Richolt (MICCAI, 1998)

Hardness of Approximating Sigma2p Minimization Problems. - Christopher Umans (FOCS, 1999)

On the Complexity and Inapproximability of Shortest Implicant Problems. - Christopher Umans (ICALP, 1999)

Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator. - Ronen Shaltiel; Christopher Umans (FOCS, 2001)

Loss-less condensers, unbalanced expanders, and extractors. - Amnon Ta-Shma; Christopher Umans; David Zuckerman (STOC, 2001)

The Minimum Equivalent DNF Problem and Shortest Implicants. - Christopher Umans (J. Comput. Syst. Sci., 2001)

On the complexity of approximating the VC dimension. - Elchanan Mossel; Christopher Umans (J. Comput. Syst. Sci., 2002)

A Group-Theoretic Approach to Fast Matrix Multiplication. - Henry Cohn; Christopher Umans (FOCS, 2003)

Pseudo-random generators for all hardnesses. - Christopher Umans (J. Comput. Syst. Sci., 2003)

Group-theoretic Algorithms for Matrix Multiplication. - Henry Cohn; Robert D. Kleinberg; Balázs Szegedy; Christopher Umans (FOCS, 2005)

Simple extractors for all min-entropies and a new pseudorandom generator. - Ronen Shaltiel; Christopher Umans (J. ACM, 2005)

Better lossless condensers through derandomized curve samplers. - Amnon Ta-Shma; Christopher Umans (FOCS, 2006)

Group-theoretic algorithms for matrix multiplication. - Christopher Umans (ISSAC, 2006)

Optimization Problems in the Polynomial-Time Hierarchy. - Christopher Umans (TAMC, 2006)

Pseudorandomness for Approximate Counting and Sampling. - Ronen Shaltiel; Christopher Umans (Comput. Complex., 2006)

Extractors and condensers from univariate polynomials. - Venkatesan Guruswami; Christopher Umans; Salil P. Vadhan (Electron. Colloquium Comput. Complex., 2006)

On obtaining pseudorandomness from error-correcting codes.. - Shankar Kalyanaraman; Christopher Umans (Electron. Colloquium Comput. Complex., 2006)

Complexity of two-level logic minimization. - Christopher Umans; Tiziano Villa; Alberto L. Sangiovanni-Vincentelli (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2006)

Lossless Condensers, Unbalanced Expanders, And Extractors. - Amnon Ta-Shma; Christopher Umans; David Zuckerman (Comb., 2007)

Algorithms for Playing Games with Limited Randomness. - Shankar Kalyanaraman; Christopher Umans (Electron. Colloquium Comput. Complex., 2007)

Low-end uniform hardness vs. randomness tradeoffs for AM. - Ronen Shaltiel; Christopher Umans (Electron. Colloquium Comput. Complex., 2007)

Fast Modular Composition in any Characteristic. - Kiran S. Kedlaya; Christopher Umans (FOCS, 2008)

Fast polynomial factorization and modular composition in small characteristic. - Christopher Umans (STOC, 2008)

On the Complexity of Succinct Zero-Sum Games. - Lance Fortnow; Russell Impagliazzo; Valentine Kabanets; Christopher Umans (Comput. Complex., 2008)

The Complexity of Rationalizing Matchings. - Shankar Kalyanaraman; Christopher Umans (Electron. Colloquium Comput. Complex., 2008)

09421 Abstracts Collection - Algebraic Methods in Computational Complexity. - Manindra Agrawal; Lance Fortnow; Thomas Thierauf; Christopher Umans (Algebraic Methods in Computational Complexity, 2009)

09421 Executive Summary - Algebraic Methods in Computational Complexity. - Manindra Agrawal; Lance Fortnow; Thomas Thierauf; Christopher Umans (Algebraic Methods in Computational Complexity, 2009)

Reconstructive Dispersers and Hitting Set Generators. - Christopher Umans (Algorithmica, 2009)

Limits on the Social Welfare of Maximal-In-Range Auction Mechanisms. - David Buchfuhrer; Christopher Umans (Electron. Colloquium Comput. Complex., 2009)

Improved inapproximability factors for some Sigma2p minimization problems. - Kevin Dick; Christopher Umans (Electron. Colloquium Comput. Complex., 2009)

The Complexity of Rationalizing Network Formation. - Shankar Kalyanaraman; Christopher Umans (Electron. Colloquium Comput. Complex., 2009)

Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. - Venkatesan Guruswami; Christopher Umans; Salil P. Vadhan (J. ACM, 2009)

Low-End Uniform Hardness versus Randomness Tradeoffs for AM. - Ronen Shaltiel; Christopher Umans (SIAM J. Comput., 2009)

The complexity of the matroid-greedoid partition problem. - Vera Asodi; Christopher Umans (Theor. Comput. Sci., 2009)

Inapproximability for VCG-Based Combinatorial Auctions. - David Buchfuhrer; Shaddin Dughmi; Hu Fu 001; Robert Kleinberg; Elchanan Mossel; Christos H. Papadimitriou; Michael Schapira; Yaron Singer; Christopher Umans (SODA, 2010)

Pseudorandom generators and the BQP vs. PH problem - Bill Fefferman; Christopher Umans (CoRR, 2010)

On beating the hybrid argument. - Bill Fefferman; Ronen Shaltiel; Christopher Umans; Emanuele Viola (Electron. Colloquium Comput. Complex., 2010)

Special Section On Foundations of Computer Science. - James R. Lee; Christopher Umans (SIAM J. Comput., 2010)

The complexity of Boolean formula minimization. - David Buchfuhrer; Christopher Umans (J. Comput. Syst. Sci., 2011)

Fast Polynomial Factorization and Modular Composition. - Kiran S. Kedlaya; Christopher Umans (SIAM J. Comput., 2011)

Better Condensers and New Extractors from Parvaresh-Vardy Codes. - Amnon Ta-Shma; Christopher Umans (CCC, 2012)

Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl Seminar 12421). - Manindra Agrawal; Thomas Thierauf; Christopher Umans (Dagstuhl Reports, 2012)

Special Section on the Forty-First Annual ACM Symposium on Theory of Computing (STOC 2009). - Nicole Immorlica; Jonathan Katz; Michael Mitzenmacher; Rocco A. Servedio; Chris Umans (SIAM J. Comput., 2012)

Fast matrix multiplication using coherent configurations. - Henry Cohn; Christopher Umans (SODA, 2013)

On sunflowers and matrix multiplication. - Noga Alon; Amir Shpilka; Christopher Umans (Comput. Complex., 2013)

Special Issue "Conference on Computational Complexity 2013" Guest editor's foreword. - Christopher Umans (Comput. Complex., 2014)

Algebra in Computational Complexity (Dagstuhl Seminar 14391). - Manindra Agrawal; Valentine Kabanets; Thomas Thierauf; Christopher Umans (Dagstuhl Reports, 2014)

Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields. - Zeyu Guo 001; Anand Kumar Narayanan; Chris Umans (MFCS, 2016)

On the Power of Quantum Fourier Sampling. - Bill Fefferman; Christopher Umans (TQC, 2016)

On cap sets and the group-theoretic approach to matrix multiplication. - Jonah Blasiak; Thomas Church; Henry Cohn; Joshua A. Grochow; Chris Umans (CoRR, 2016)

Algebraic Methods in Computational Complexity (Dagstuhl Seminar 16411). - Valentine Kabanets; Thomas Thierauf; Jacobo Torán; Christopher Umans (Dagstuhl Reports, 2016)

On Multidimensional and Monotone k-SUM. - Chloe Ching-Yun Hsu; Chris Umans (MFCS, 2017)

Which groups are amenable to proving exponent two for matrix multiplication? - Jonah Blasiak; Thomas Church; Henry Cohn; Joshua A. Grochow; Chris Umans (CoRR, 2017)

A fast generalized DFT for finite groups of Lie type. - Chloe Ching-Yun Hsu; Chris Umans (SODA, 2018)

Algebraic Methods in Computational Complexity (Dagstuhl Seminar 18391). - Markus Bläser; Valentine Kabanets; Jacobo Torán; Christopher Umans (Dagstuhl Reports, 2018)

Fast Generalized DFTs for all Finite Groups. - Chris Umans (FOCS, 2019)

A New Algorithm for Fast Generalized DFTs. - Chloe Ching-Yun Hsu; Chris Umans (ACM Trans. Algorithms, 2020)

Visions in Theoretical Computer Science: A Report on the TCS Visioning Workshop 2020. - Shuchi Chawla 001; Jelani Nelson; Chris Umans; David P. Woodruff (CoRR, 2021)

Fast Multivariate Multipoint Evaluation Over All Finite Fields. - Vishwas Bhargava; Sumanta Ghosh; Zeyu Guo 001; Mrinal Kumar 001; Chris Umans (Electron. Colloquium Comput. Complex., 2022)

Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace. - William M. Hoza; Chris Umans (SIAM J. Comput., 2022)

Matrix Multiplication via Matrix Groups. - Jonah Blasiak; Henry Cohn; Joshua A. Grochow; Kevin Pratt; Chris Umans (ITCS, 2023)

Pseudorandomness of the Sticky Random Walk. - Emile Anand; Chris Umans (CoRR, 2023)

Finite Matrix Multiplication Algorithms from Infinite Groups. - Jonah Blasiak; Henry Cohn; Joshua A. Grochow; Kevin Pratt; Chris Umans (ITCS, 2025)