基本信息
浏览量:402
职业迁徙
个人简介
Mohan Paturi joined the UCSD faculty in 1986 after a post-doctoral fellowship at Harvard University. He obtained his Ph.D. from Pennsylvania State University in 1985. He is a past recipient of the Jacobs School's Teacher of the Year Award. Paturi founded Parity Computing, a San Diego-based digital library and data mining technology company.
Algorithms, complexity theory, satisfiability, lower bounds, digital libraries, data mining, machine learning, and information technology (IT) education.
Mohan Paturi studies the theoretical underpinnings of computer science, efficient algorithms, and their complexity. He focuses on improved exponential-time algorithms for certain NP-complete (Nondeterministic Polynomial) problems and the interesting connection between efficient algorithms and lower bounds on computational efficiency. Paturi is also an expert in digital libraries, ontologies, and text data mining, and a company he founded (see bio) has created a number of digital libraries for professional societies such as IEEE and ACM. Paturi's other interests include learning theory and machine learning.
研究兴趣
论文共 77 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
Algorithmicano. 7 (2019): 2991-3024
SODA '17: Symposium on Discrete Algorithms
Barcelona
Spain
January, 2017pp.2190-2202, (2017)
CCC '12 Proceedings of the 2012 IEEE Conference on Computational Complexity (CCC)no. 3 (2016): 1-24
ITCS '16: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (2016): 261-270
Encyclopedia of Algorithmspp.170-174, (2016)
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn