Sotabase

Career

· Professor, California Institute of Technology2010–
· Associate Professor, California Institute of Technology2008–2010
· Assistant Professor, California Institute of Technology2002–2008
· Postdoctoral Researcher, Microsoft Research2000–2002
· PhD in Computer Science, University of California, Berkeley2000–
· B.A. in Mathematics and Computer Science, Williams College1996–
· Professor, California Institute of Technology

Publications (84)

Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
Cybersecurity and Cyberforensics Conference · 2007
455
cited
Fast Polynomial Factorization and Modular Composition
SIAM journal on computing (Print) · 2011
257
cited
Group-theoretic algorithms for matrix multiplication
IEEE Annual Symposium on Foundations of Computer Science · 2005
247
cited
Simple extractors for all min-entropies and a new pseudo-random generator
Proceedings IEEE International Conference on Cluster Computing · 2001
239
cited
The minimum equivalent DNF problem and shortest implicants
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) · 1998
163
cited
A group-theoretic approach to fast matrix multiplication
44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. · 2003
161
cited
Pseudo-random generators for all hardnesses
Proceedings 17th IEEE Annual Conference on Computational Complexity · 2002
140
cited
Completeness in the Polynomial-Time Hierarchy A Compendium ∗
2008
139
cited
On cap sets and the group-theoretic approach to matrix multiplication
arXiv.org · 2016
137
cited
Loss-less condensers, unbalanced expanders, and extractors
Symposium on the Theory of Computing · 2001
127
cited
Complexity of two-level logic minimization
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 2006
117
cited
Hamiltonian cycles in solid grid graphs
Proceedings 38th Annual Symposium on Foundations of Computer Science · 1997
109
cited
Lossless Condensers, Unbalanced Expanders, And Extractors
Comb. · 2007
95
cited
The complexity of Boolean formula minimization
Journal of computer and system sciences (Print) · 2008
93
cited
On sunflowers and matrix multiplication
2012 IEEE 27th Conference on Computational Complexity · 2012
85
cited
Fast Modular Composition in any Characteristic
2008 49th Annual IEEE Symposium on Foundations of Computer Science · 2008
76
cited
Fast matrix multiplication using coherent configurations
ACM-SIAM Symposium on Discrete Algorithms · 2012
64
cited
Inapproximability for VCG-based combinatorial auctions
ACM-SIAM Symposium on Discrete Algorithms · 2010
62
cited
Hardness of Approximating p 2 Minimization Problems
1999
51
cited
On beating the hybrid argument
Information Technology Convergence and Services · 2012
51
cited
Sotabase