基本信息
浏览量:73
职业迁徙
个人简介
I work on algorithm design and complexity theory, and I especially like using algebraic tools to solve problems throughout computer science.
His work on matrix multiplication gives the fastest known algorithm for multiplying two matrices, and also proves mathematical barrier results explaining why computer scientists have been unable to design even faster algorithms for this important problem.
His work on linear transforms focuses on a technique called matrix rigidity, which studies how well the matrices underlying computational tasks can be decomposed as a sum of a low rank matrix and a sparse matrix. He has shown that important transforms like the Walsh-Hadamard transform have more efficient decompositions than previously conjectured to be possible, and he has given the first non-trivial construction of matrices without an efficient decomposition.
His work on matrix multiplication gives the fastest known algorithm for multiplying two matrices, and also proves mathematical barrier results explaining why computer scientists have been unable to design even faster algorithms for this important problem.
His work on linear transforms focuses on a technique called matrix rigidity, which studies how well the matrices underlying computational tasks can be decomposed as a sum of a low rank matrix and a sparse matrix. He has shown that important transforms like the Walsh-Hadamard transform have more efficient decompositions than previously conjectured to be possible, and he has given the first non-trivial construction of matrices without an efficient decomposition.
研究兴趣
论文共 41 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
CoRR (2023): 4:1-4:23
arxiv(2023)
引用0浏览0EI引用
0
0
Josh Alman, Kevin Rao
arxiv(2023)
2023 IEEE 64TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS (2023): 1471-1495
SODApp.4159-4187, (2023)
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn