基本信息
浏览量:8
职业迁徙
个人简介
Hal Kierstead's research is in the area of graph theory, especially graph coloring. This is a way of modeling the problem of partitioning a set of objects having some internal conflicts into a small number of conflict-free parts. It has many applications in computer science and operations research, including flight scheduling, bandwidth allocation and register allocation, as well as deep theoretical interest. Much of this work involves finding efficient algorithms for attacking partition problems presented with incomplete information, possibly because assignment decisions must be made online before all objects are known, or because another processor is making apparently arbitrary decisions. These situations require competitive analysis expressed in terms of mathematical games. Hal Kierstead has published more than 100 articles on related subjects.
研究兴趣
论文共 109 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
Discrete mathematicsno. 11 (2023): 113300-113300
H. A. Kierstead, E. R. Ren
Discrete Mathematicsno. 9 (2023): 113514
arXiv (Cornell University) (2023)
Discrete mathematicsno. 11 (2023): 113507-113507
加载更多
作者统计
#Papers: 109
#Citation: 2085
H-Index: 25
G-Index: 41
Sociability: 5
Diversity: 2
Activity: 4
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn