Jump to content

Jin-Yi Cai

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Danre98 (talk | contribs) at 21:49, 2 September 2021 (Key contributions: removed promotional section, not sure why handpicked contributions need highlighting). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Jin-Yi Cai (Chinese: 蔡进一; born 1961) is a Chinese American mathematician and computer scientist. He is a professor of computer science, and also the Steenbock Professor of Mathematical Sciences[1] at the University of Wisconsin-Madison. His research is in theoretical computer science, especially computational complexity theory. In recent years he has concentrated on the classification of computational counting problems, especially counting graph homomorphisms, counting constraint satisfaction problems, and Holant problems as related to holographic algorithms.

Early life

Cai was born in Shanghai, China. He attended Fudan University as a member of the class 77, where he studied mathematics.

After coming to the United States in 1981, he attended Temple University studying with Donald J. Newman, and then at Cornell University, where he received his Ph. D. in 1986 under Juris Hartmanis.

Academic career

He became a faculty member at Yale University (1986-1989), Princeton University (1989-1993), and SUNY Buffalo (1993-2000), rising from Assistant Professor to Full Professor in 1996. He became a Professor of Computer Science at the University of Wisconsin-Madison in 2000.

Awards

Cai was a Presidential Young Investigator, Sloan Research Fellow[2] , and a Guggenheim Fellow[3]. He received a Morningside Silver Medal, and a Humboldt Research Award for Senior U.S. Scientists. He was elected a Fellow of the Association for Computing Machinery (2001), American Association for the Advancement of Science (2007), and a foreign member of Academia Europaea (2017). He was jointly awarded the Gödel Prize in 2021, an award in theoretical computer science for his work in the paper titled: Complexity of Counting CSP with Complex Weights.[4] He was also awarded the Fulkerson Prize in Discrete Mathematics awarded by the American Mathematical Society and the Mathemtical Programming Society. [5]

References

  1. ^ "Two faculty members named Steenbock Professors". news.wisc.edu.
  2. ^ "Past Fellows | Alfred P. Sloan Foundation". sloan.org.
  3. ^ "John Simon Guggenheim Foundation | Fellows".
  4. ^ "The 2021 Gödel Prize". sigact.org.
  5. ^ "Delbert Ray Fulkerson Prize (AMS-MOS)".