Xi Chen | |
|---|---|
 | |
| Alma mater | Tsinghua University |
| Known for | Computational complexity theory |
| Awards | Gödel Prize (2021) Fulkerson Prize (2021) Presburger Award (2015) Sloan Research Fellowship (2012) |
| Scientific career | |
| Fields | Computer theory |
| Institutions | Columbia University |
| Website | Xi Chen at Columbia University |
Xi Chen (Chinese: 陈汐)[1] is a computer scientist.[2] He is an associate professor of computer science at Columbia University.[2] Chen won the 2021 Gödel Prize and Fulkerson Prize for his co-authored paper "Complexity of Counting CSP with Complex Weights" with Jin-Yi Cai.[3][4]
Biography
Chen received his B.S. and Ph.D. from Tsinghua University.[5] He was a postdoctoral fellow at Institute for Advanced Study, Princeton University, University of Southern California, and joined the Columbia faculty in 2011.[6]
Chen's research focuses on computational complexity theory.[2] He also received a Presburger Award from the European Association for Theoretical Computer Science in 2015 and a Sloan Research Fellowship in 2012.[7]
References
- ↑ "陈汐同学两篇论文被理论计算机界最高会议录用-清华计算机科学与技术系". www.cs.tsinghua.edu.cn. Retrieved 2022-05-13.
- 1 2 3 "Xi Chen Wins Both 2021 Gödel Prize and Fulkerson Prize". Columbia Engineering. 2022-04-20. Retrieved 2022-05-13.
- ↑ "2021 SIGACT Knuth and Gödel Prizes Recipient". www.acm.org. Retrieved 2022-05-13.
- ↑ "Delbert Ray Fulkerson Prize (AMS-MOS)". American Mathematical Society. Retrieved 2022-05-13.
- ↑ "物理系系友陈汐获得2012年美国斯隆研究奖-清华大学物理系". www.phys.tsinghua.edu.cn. Retrieved 2022-05-13.
- ↑ "Xi Chen" (PDF). Retrieved May 12, 2022.
- ↑ "The EATCS bestows the Presburger Award 2015 on Xi Chen (Columbia University)". European Association for Theoretical Computer Science. Retrieved May 12, 2022.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.