C
Christopher Umans
Researcher at California Institute of Technology
Publications - 93
Citations - 3755
Christopher Umans is an academic researcher from California Institute of Technology. The author has contributed to research in topics: Matrix multiplication & Exponent. The author has an hindex of 31, co-authored 91 publications receiving 3466 citations. Previous affiliations of Christopher Umans include Microsoft & Tel Aviv University.
Papers
More filters
Journal ArticleDOI
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
TL;DR: A new, self-contained construction of randomness extractors that is optimal up to constant factors, while being much simpler than the previous construction of Lu et al.
Proceedings ArticleDOI
Group-theoretic algorithms for matrix multiplication
TL;DR: The group-theoretic approach to fast matrix multiplication introduced by Cohn and Umans is developed, and for the first time it is used to derive algorithms asymptotically faster than the standard algorithm.
Journal ArticleDOI
Simple extractors for all min-entropies and a new pseudorandom generator
Ronen Shaltiel,Christopher Umans +1 more
TL;DR: A simple, self-contained extractor construction that produces good extractors for all min-entropies and gives a quantitatively optimal hardness versus randomness tradeoff for AM and the first hardness amplification result for nondeterministic circuits.
Proceedings Article
Fast polynomial factorization and modular composition.
TL;DR: It is shown that modular composition and multipoint evaluation of multivariate polynomials are essentially equivalent, in the sense that an algorithm for one achieving exponent $alpha$ implies an algorithms for the other with exponent $ alpha + o(1)$, and vice versa.
Journal ArticleDOI
Fast Polynomial Factorization and Modular Composition
TL;DR: In this article, a randomized algorithm for modular composition of degree n univariate polynomials over finite fields was proposed, which is asymptotically faster than the best known algorithms.