基本信息
浏览量:1080
职业迁徙
个人简介
Broadly speaking, I’m a computation theorist. More narrowly, I’m mainly interested in the theory of combinatorial algorithms and discrete optimization. I’m fascinated by the design and analysis of algorithms for several reasons: it’s an attempt to explore the limits of efficient computation, it’s a means to study the intrinsic properties of fundamental combinatorial problems, and there’s always some hope to find efficient solutions that might be useful in practice.
Some of my past, current, and future research interests include (in random order):
On-line computing: k-server, file allocation, reordering buffer, randomized algorithms.
Network optimization: packet and circuit routing, admission control, flow control.
Cutting and labeling graphs: sparsest cut, multiway cut, and their relatives.
Resource allocation problems: scheduling, load balancing, bin packing, bandwidth allocation.
Sketching high dimensional data, applications to nearest neighbor search and clustering.
Metric Ramsey phenomena and their applications.
Graph decompositions, Lipschitz maps of finite metrics, and approximation algorithms.
Properties, applications of transportation metrics, discrete Lipschitz extension and selection.
Local vs. global properties of metric spaces.
Pseudorandom generators that fool geometric tests, explicit geometric constructions.
Bargaining networks.
Computational aspects of discrete dynamical processes.
Some of my past, current, and future research interests include (in random order):
On-line computing: k-server, file allocation, reordering buffer, randomized algorithms.
Network optimization: packet and circuit routing, admission control, flow control.
Cutting and labeling graphs: sparsest cut, multiway cut, and their relatives.
Resource allocation problems: scheduling, load balancing, bin packing, bandwidth allocation.
Sketching high dimensional data, applications to nearest neighbor search and clustering.
Metric Ramsey phenomena and their applications.
Graph decompositions, Lipschitz maps of finite metrics, and approximation algorithms.
Properties, applications of transportation metrics, discrete Lipschitz extension and selection.
Local vs. global properties of metric spaces.
Pseudorandom generators that fool geometric tests, explicit geometric constructions.
Bargaining networks.
Computational aspects of discrete dynamical processes.
研究兴趣
论文共 144 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
SODApp.2898-2916, (2023)
arxiv(2023)
引用0浏览0EI引用
0
0
GAMES AND ECONOMIC BEHAVIOR (2022): 361-375
SIAM Journal on Computingno. 5 (2022): 1692-1702
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn