基本信息
浏览量:739
职业迁徙
个人简介
My research applies combinatorial and graph theoretic tools to various computational domains. My recent work has focused on the following domains:
designing algorithms for shortest paths, pattern detection and other computational problems in graphs and matrices,
reducing fundamental computational problems to one another in a fine-grained way, sometimes showing equivalences,
studying how much graph distance information can be compressed, and
computational issues in social choice: when and how can one efficiently manipulate elections, tournaments and competitions, how to measure the quality of a voting rule, etc.
designing algorithms for shortest paths, pattern detection and other computational problems in graphs and matrices,
reducing fundamental computational problems to one another in a fine-grained way, sometimes showing equivalences,
studying how much graph distance information can be compressed, and
computational issues in social choice: when and how can one efficiently manipulate elections, tournaments and competitions, how to measure the quality of a voting rule, etc.
研究兴趣
论文共 171 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
ACM-SIAM Symposium on Discrete Algorithms (2023): 2643-2656
CoRR (2023): 7:1-7:17
引用0浏览0EI引用
0
0
SODApp.2242-2255, (2023)
2023 IEEE 64TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS (2023): 2188-2203
ACM-SIAM Symposium on Discrete Algorithms (2023): 4728-4757
ACM-SIAM Symposium on Discrete Algorithms (2023): 3792-3835
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn