Chris Umans | Academic Influence

Chris Umans's AcademicInfluence.com Rankings

Chris Umans

Computer Science

#1838

World Rank

#1908

Historical Rank

#878

USA Rank

Database

#9112

World Rank

#9582

Historical Rank

#1265

USA Rank

computer-science Degrees

Download Badge

Computer Science

Chris Umans's Degrees

Bachelors Computer Science Stanford University

Similar Degrees You Can Earn

Why Is Chris Umans Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Christopher Umans is a professor of Computer Science in the Computing and Mathematical Sciences Department at the California Institute of Technology. He is known for work on algorithms, computational complexity, algebraic complexity, and hardness of approximation.

(See a Problem?)

Chris Umans's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Group-theoretic algorithms for matrix multiplication (2005) (225)
Simple extractors for all min-entropies and a new pseudo-random generator (2001) (204)
Fast Polynomial Factorization and Modular Composition (2011) (201)
The minimum equivalent DNF problem and shortest implicants (1998) (147)
A group-theoretic approach to fast matrix multiplication (2003) (136)
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes (2007) (131)
Loss-less condensers, unbalanced expanders, and extractors (2001) (127)
Pseudo-random generators for all hardnesses (2002) (125)
Completeness in the Polynomial-Time Hierarchy A Compendium ∗ (2008) (117)
On cap sets and the group-theoretic approach to matrix multiplication (2016) (116)
Hamiltonian cycles in solid grid graphs (1997) (97)
Complexity of two-level logic minimization (2006) (95)
Lossless Condensers, Unbalanced Expanders, And Extractors (2007) (83)
The complexity of Boolean formula minimization (2008) (79)
On sunflowers and matrix multiplication (2012) (74)
Fast Modular Composition in any Characteristic (2008) (74)
Pseudorandomness for Approximate Counting and Sampling (2005) (62)
Fast matrix multiplication using coherent configurations (2012) (55)
Inapproximability for VCG-based combinatorial auctions (2010) (52)
On the complexity of approximating the VC dimension (2001) (48)
On beating the hybrid argument (2012) (46)
Hardness of Approximating p 2 Minimization Problems (1999) (45)
AnatomyBrowser: A novel approach to visualization and integration of medical information. (1999) (41)
On the Complexity of Succinct Zero-Sum Games (2005) (39)
The Power of Quantum Fourier Sampling (2015) (39)
Fast polynomial factorization and modular composition in small characteristic (2008) (36)
Virtual otoscopy. (1998) (35)
Hardness of Approximating Minimization Problems (1999) (28)
Hardness of approximating /spl Sigma//sub 2//sup p/ minimization problems (1999) (27)
Approximability and completeness in the polynomial hierarchy (2000) (25)
Which groups are amenable to proving exponent two for matrix multiplication? (2017) (21)
On the Complexity and Inapproximability of Shortest Implicant Problems (1999) (20)
Better Condensers and New Extractors from Parvaresh-Vardy Codes (2012) (20)
AnatomyBrowser: A Framework for Integration of Medical Information (1998) (19)
Better lossless condensers through derandomized curve samplers (2006) (17)
The Complexity of Rationalizing Matchings (2008) (17)
Pseudorandom generators and the BQP vs. PH problem (2010) (15)
Low-end uniform hardness vs. randomness tradeoffs for AM (2007) (14)
Hardness of Approximating Sigma 2 p Minimization Problems. (1999) (12)
Algorithms for Playing Games with Limited Randomness (2007) (11)
Reconstructive Dispersers and Hitting Set Generators (2005) (11)
Extractors and condensers from univariate polynomials (2006) (9)
Low-End Uniform Hardness versus Randomness Tradeoffs for AM (2009) (9)
Targeted pseudorandom generators, simulation advice generators, and derandomizing logspace (2016) (8)
An Algorithm for Finding Hamiltonian Cycles in Grid Graphs Without Holes (1996) (8)
The Complexity of Rationalizing Network Formation (2009) (7)
On Multidimensional and Monotone k-SUM (2017) (6)
Limits on the Social Welfare of Maximal-In-Range Auction Mechanisms (2009) (6)
The complexity of the matroid-greedoid partition problem (2009) (5)
On Obtaining Pseudorandomness from Error-Correcting Codes (2006) (5)
Fast Multivariate Multipoint Evaluation Over All Finite Fields (2022) (3)
Fast Generalized DFTs for all Finite Groups (2019) (3)
Optimization Problems in the Polynomial-Time Hierarchy (2006) (3)
A fast generalized DFT for finite groups of Lie type (2017) (2)
Matrix multiplication via matrix groups (2022) (2)
Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields (2016) (2)
A New Algorithm for Fast Generalized DFTs (2017) (2)
Visions in Theoretical Computer Science: A Report on the TCS Visioning Workshop 2020 (2021) (1)
Average Case Complexity Theory (2007) (1)
How Hard is Two-Level Logic Minimization: an Addendum to Garey & Johnson (2005) (1)
Fast polynomial factorization , modular composition , and multipoint evaluation of multivariate polynomials in small characteristic (2007) (1)
Algebra in Computational Complexity (Dagstuhl Seminar 14391) (2014) (0)
Session details: Graphs cuts and flows (2009) (0)
Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl Seminar 12421) (2012) (0)
On the Complexity of Approximating the V C Dimension (2014) (0)
Executive Summary of Dagstuhl Seminar 09421 on Algebraic Methods in Computational Complexity October 11 to 16 , 2009 organized by Manindra Agrawal (2009) (0)
Improved inapproximability factors for some Sigma2p minimization problems (2009) (0)
86 14391 – Algebra in Computational Complexity 1 Executive Summary (2015) (0)
Algebraic Methods in Computational Complexity (2018) (0)
Special Section on the Forty-First Annual ACM Symposium on Theory of Computing (STOC 2009) (2012) (0)
134 18391 – Algebraic Methods in Computational Complexity 1 Executive Summary (2017) (0)
Improved inapproximability factors for some Σ p 2 minimization problems (2009) (0)
Complexity Theory Spring 2021 Final Solutions (2021) (0)
CS 151 Complexity Theory Spring 2015 Final Solutions (2015) (0)
09421 Executive Summary - Algebraic Methods in Computational Complexity (2009) (0)
Today's Topics: Lower Bounds for Constant Depth Circuits Razborovvsmolensky a Learning Algorithm for Constant Depth Circuits Hastad Has866 and Liniallmansourrnisan Lmn899 4.1 Lower Bounds for Constant Depth Circuits (1999) (0)
MIDTERM SOLUTIONS (1999) (0)
78 12421 – Algebraic and Combinatorial Methods in Computational Complexity Participants (2013) (0)
Hamiltonian Cycles in Solid Grid Graphs (Extended Abstract) (1997) (0)
Special Section On Foundations of Computer Science (2010) (0)
Special Issue “Conference on Computational Complexity 2013” Guest editor’s foreword (2014) (0)
Session details: Complexity I (2009) (0)
Frontmatter, Table of Contents, Preface, Program Commitees, External Reviewers, List of Authors (2015) (0)
Complexity Theory Spring 2021 Solution Set 4 (2015) (0)
LIPIcs, Volume 60, APPROX/RANDOM'16, Complete Volume (2016) (0)
Algebraic Methods in Computational Complexity (Dagstuhl Seminar 18391) (2018) (0)
09421 Abstracts Collection - Algebraic Methods in Computational Complexity (2009) (0)
Special Issue “Conference on Computational Complexity 2013” Guest editor’s foreword (2014) (0)
Limits on computationally efficient vcg-based mechanisms for combinatorial auctions and public projects (2011) (0)
Algebraic Methods in Computational Complexity (Dagstuhl Seminar 16411) (2016) (0)

This paper list is powered by the following services:

Other Resources About Chris Umans

en.wikipedia.org

What Schools Are Affiliated With Chris Umans?

Chris Umans is affiliated with the following schools: