基本信息
浏览量:500
职业迁徙
个人简介
The main focus of our research group is reaching the ultimate limits of algorithmic techniques for solving hard computational problems. We are working on problems of algorithm design and using computational complexity to discover the fundamental limitations of efficient algorithms. A large part of the work uses the framework of parameterized complexity to obtain a more fine-grained understanding of problem complexity.
研究兴趣
论文共 252 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODApp.314-345, (2024)
CoRR (2024): 34:1-34:17
CoRR (2024)
引用0浏览0EI引用
0
0
arXiv (Cornell University) (2024)
STOC 2024 Proceedings of the 56th Annual ACM Symposium on Theory of Computingpp.1517-1525, (2024)
Symposium on the Theory of Computing (2023): 1517-1525
International Colloquium on Automata, Languages and Programming (2023): 6:1-6:19
加载更多
作者统计
#Papers: 251
#Citation: 9876
H-Index: 43
G-Index: 95
Sociability: 6
Diversity: 1
Activity: 2
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn