基本信息
浏览量:216
职业迁徙
个人简介
Professor Van Melkebeek's research interests lie in computational complexity theory and the theory of computing. He has developed lower bounds for the resources needed to solve NP-complete problems, and studies the power of randomness in computation. He earned the 1999 ACM Doctoral Dissertation Award and an NSF CAREER award for his research.
Professor Van Melkebeek teaches algorithms and computational complexity theory at the undergraduate and graduate level. He is also the longtime coach for the UW-Madison teams participating in the (ACM) International Collegiate Programming Contest.
Professor Van Melkebeek teaches algorithms and computational complexity theory at the undergraduate and graduate level. He is also the longtime coach for the UW-Madison teams participating in the (ACM) International Collegiate Programming Contest.
研究兴趣
论文共 35 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
Theoretical Computer Scienceno. 1 (2012): 35-44
Computational Complexitypp.273-282, (2011)
semanticscholar(2008)
引用0浏览0引用
0
0
FOUNDATIONS AND TRENDS IN THEORETICAL COMPUTER SCIENCEno. 3 (2007): 197-303
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn