陈致中教授学术报告

发布者:联合学院发布时间:2019-08-09浏览次数:107

讲座人:陈致中教授(Prof. Zhizhong Chen

讲座时间201957日(周二)下午14:00

讲座题目Various Approaches to Computationally Hard Problems

讲座地点:二教南228会议室


讲座摘要Many problems in real world are computationally hard. I have worked on various approaches to such problems. They include randomized algorithms, approximation algorithms, parallel algorithms, fixed-parameter algorithms, and heuristic algorithms. In this talk, I will focus on several important computationally hard problems (Reducing Randomness via Irrational Numbers, Algorithms for Haplotype Assembly, Algorithms for Phylogenetic Trees and Hybridization Networks) and explain my results on them.


报告人简介:陈致中教授现任日本东京电机大学理工学部终身教授(Tokyo Denki University)。陈致中教授于1992年取得日本电气通信大学计算机系博士学位(The University of Electro-Communications),曾在University of California at Berkeley访问一年,与Christos Papadimitriou教授(Bill Gates的导师,高德纳奖获得者)合作,共同研究成果发表在理论计算机科学顶级会议STOC上,2015年获得日本学术振兴会奖,2011年获得日本情报处理学会山下纪念研究奖。多年来从事计算机科学(网络优化,组合优化,算法设计与分析等)和生物信息学方面的研究,在国际SCI刊物(包括Journal of the ACMSIAM Journal on ComputingSIAM Journal on Discrete Mathematics, ACM Transaction on Algorithms, IEEE/ACM Transactions on Computational Biology and BioinformaticsBioinformatics等多个计算机科学和生物信息学领域的顶级期刊)上发表论文100多篇。现任或曾任ISSACCOCOONCOCOA等多个国际学术会议程序委员会委员和Theoretical Computer ScienceJournal of Applied Mathematics等多个国际SCI期刊的编委。