Jump to content

Jin-Yi Cai: Difference between revisions

From Wikipedia, the free encyclopedia
Browse history interactively
← Previous edit
Content deleted Content added
VisualWikitext
mNo edit summary
 
(27 intermediate revisions by 12 users not shown)
Line 1: Line 1:
{{Short description|Chinese-American computer scientist}}
{{AfC submission|t||ts=20210718192218|u=Uwmadisoncdis|ns=118|demo=}}<!-- Important, do not remove this line before article has been created. -->


'''Jin-Yi Cai''' ({{zh|s=蔡进一}}; born 1961) is a Chinese American [[mathematician]] and [[computer scientist]]. He is a professor of computer science, and also the [https://research.wisc.edu/professorships-and-faculty-fellowships/steenbock-professorships/ Steenbock Professor of Mathematical Sciences]<ref>{{Cite web|url=https://news.wisc.edu/two-faculty-members-named-steenbock-professors/|title=Two faculty members named Steenbock Professors|website=news.wisc.edu}}</ref> 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 problem (complexity)|counting problems]], especially counting [[graph homomorphism]]s, counting [[constraint satisfaction problem]]s, and Holant problems as related to [[holographic algorithm]]s.
Jin-Yi Cai ([[Chinese language|Chinese]]: 蔡进一; born January 23, 1961) is Chinese American
mathematician and [[Computer scientist|computer scientist]]. He is a professor of computer
science, and also the [https://research.wisc.edu/professorships-and-faculty-fellowships/steenbock-professorships/ Steenbock Professor of Mathematical Sciences]<ref>https://news.wisc.edu/two-faculty-members-named-steenbock-professors/</ref>
at the [[University of wisconsin-madison|University of Wisconsin-Madison]]. His research work focuses
on [[Computational complexity theory|algorithmic complexity theory]] and [[Theoretical computer science|theoretical computer science]]. In recent years he has concentrated on the classification of computational counting problems, especially counting [[Graph homomorphism|graph homomorphisms]], counting constraint satisfaction problems, and Holant problems as related to [[Holographic algorithm|holographic algorithms]].


== Early life ==
⚫
Cai was born in [[Shanghai, China]]. He studied mathematics at [[Fudan University]], graduating in 1981.
He earned a master's degree at [[Temple University]] in 1983, a second master's degree at [[Cornell University]] in 1985,<ref name=cv/> and his Ph.D. from Cornell in 1986, with [[Juris Hartmanis]] as his [[doctoral advisor]].<ref>{{mathgenealogy|id=79379}}</ref>


⚫
== Academic career ==
<big>'''Early Life'''</big>
⚫
He became a faculty member at [[Yale University]] (1986-1989),

⚫
Cai was born in [[Shanghai, China]]. He attended [[Fudan University]] as a
member of the class 77, graduating with a degree in ___________ TO DO PUT DEGREE HERE _____________
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 [[Doctor of Philosophy|Ph. D.]] in 1986 under [[Juris Hartmanis]].

⚫
'''<big>Academic career'''</big>

⚫
He became a faculty member at [[Yale University]](1986-1989),
[[Princeton University]] (1989-1993), and [[SUNY-Buffalo|SUNY Buffalo]] (1993-2000),
[[Princeton University]] (1989-1993), and [[SUNY-Buffalo|SUNY Buffalo]] (1993-2000),
rising from [[Assistant professor|Assistant Professor]] to [[Full Professor]] in 1996.
rising from [[Assistant professor|Assistant Professor]] to [[Full Professor]] in 1996.
He became a Professor of Computer Science at the University of
He became a Professor of Computer Science at the [[University of Wisconsin–Madison]] in 2000.<ref name=cv>{{cite web|url=http://pages.cs.wisc.edu/~jyc/cv.pdf|title=Curriculum vitae|access-date=2021-09-12}}</ref>
Wisconsin-Madison in 2000.


== Awards ==
<big>'''Key contributions'''</big>
Cai was a [[Presidential Young Investigator Award|Presidential Young Investigator]], [[Sloan Research Fellowship|Sloan Research Fellow]],<ref>{{Cite web|url=https://sloan.org/past-fellows|title=Past Fellows &#124; Alfred P. Sloan Foundation|website=sloan.org|access-date=2021-08-19|archive-date=2018-03-14|archive-url=https://web.archive.org/web/20180314000756/https://sloan.org/past-fellows|url-status=dead}}</ref> and a [[Guggenheim Fellowship|Guggenheim Fellow]].<ref>{{Cite web|url=https://www.gf.org/fellows/|title=John Simon Guggenheim Foundation &#124; Fellows|access-date=2021-08-19|archive-date=2021-02-14|archive-url=https://web.archive.org/web/20210214171150/https://www.gf.org/fellows/|url-status=dead}}</ref> He received a [[Morningside Medal|Morningside Silver Medal]], and a [[Humboldt Research Award]] for Senior U.S. Scientists.<ref name=cv/> 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.''<ref>{{Cite web|url=https://sigact.org/prizes/g%C3%B6del/citation2021.html|title=The 2021 Gödel Prize|website=sigact.org}}</ref> He was also awarded the [[Fulkerson Prize]] in Discrete Mathematics awarded by the American Mathematical Society and the Mathemtical Programming Society.<ref>{{Cite web|url=http://www.ams.org/prizes-awards/paview.cgi?parent_id=17|title = Delbert Ray Fulkerson Prize (AMS-MOS)}}</ref>


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).<ref name=cv/> He was named to the 2023 class of Fellows of the [[American Mathematical Society]], "for contributions to computational complexity theory, especially in the areas of complexity dichotomy".<ref>{{cite web|url=http://www.ams.org/cgi-bin/fellows/fellows_by_year.cgi|title=2023 Class of Fellows|publisher=American Mathematical Society|access-date=2022-11-09}}</ref>
Cai's research results include:
* His proof that with probability one a random oracle separates the polynomial-time hierarchy from PSPACE<ref>https://www.sciencedirect.com/science/article/pii/0022000089900330</ref>
*The CFI-construction<ref>https://link.springer.com/article/10.1007/BF01305232</ref> (joint work with Martin Fürer and [[Neil Immerman]]).
*Complexity dichotomy theorems for the partition functions of graph homomorphisms, constraint satisfaction problems (CSP), and Holant problems<ref>https://epubs.siam.org/doi/abs/10.1137/110840194?mobileUi=0&</ref><ref>https://dl.acm.org/doi/abs/10.1145/2822891</ref><ref>https://epubs.siam.org/doi/abs/10.1137/17M1131672?af=R</ref>


⚫
== References ==
His book Complexity Dichotomies for Counting Problems: Volume 1. Boolean Domain
⚫
{{reflist}}
(coauthored with Xi Chen) was published by the Cambridge University Press in 2018.<ref>https://www.cambridge.org/gb/academic/subjects/computer-science/algorithmics-complexity-computer-algebra-and-computational-g/complexity-dichotomies-counting-problems-volume-1?format=HB#DFBHvIwbXJQwt13s.97</ref>


{{Gödel Prize laureates}}
<big>'''Awards'''</big>
{{Authority control}}


{{DEFAULTSORT:Cai, Jin-Yi}}

[[Category:1961 births]]
Cai has been a [[Presidential Young Investigator Award|Presidential Young Investigator]], [[Sloan Fellows|a Sloan Fellow]], and a [[Guggenheim Fellowship|Guggenheim Fellow]]. He received a [[Morningside Medal|Morningside Silver Medal]], 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).
[[Category:Living people]]
He was jointly awarded the [[Gödel Prize]] in 2021, one of the most prestigious awards in theoretical computer science for his work in the paper titled: ''Complexity of Counting CSP with Complex Weights''<ref>https://sigact.org/prizes/gödel/citation2021.html</ref>
[[Category:Mathematicians from Shanghai]]

[[Category:American computer scientists]]

[[Category:Chinese computer scientists]]
⚫
== References ==
[[Category:Theoretical computer scientists]]
<!-- Inline citations added to your article will automatically display here. See en.wikipedia.org/wiki/WP:REFB for instructions on how to add citations. -->
[[Category:Fudan University alumni]]
⚫
{{reflist}}
[[Category:Temple University alumni]]
[[Category:Cornell University alumni]]
[[Category:Yale University faculty]]
[[Category:Princeton University faculty]]
[[Category:University at Buffalo faculty]]
[[Category:University of Wisconsin–Madison faculty]]
[[Category:2001 fellows of the Association for Computing Machinery]]
[[Category:Fellows of the American Mathematical Society]]
[[Category:Fellows of the American Association for the Advancement of Science]]
[[Category:Members of Academia Europaea]]

Latest revision as of 07:20, 13 September 2024

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

[edit]

Cai was born in Shanghai, China. He studied mathematics at Fudan University, graduating in 1981. He earned a master's degree at Temple University in 1983, a second master's degree at Cornell University in 1985,[2] and his Ph.D. from Cornell in 1986, with Juris Hartmanis as his doctoral advisor.[3]

Academic career

[edit]

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.[2]

Awards

[edit]

Cai was a Presidential Young Investigator, Sloan Research Fellow,[4] and a Guggenheim Fellow.[5] He received a Morningside Silver Medal, and a Humboldt Research Award for Senior U.S. Scientists.[2] 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.[6] He was also awarded the Fulkerson Prize in Discrete Mathematics awarded by the American Mathematical Society and the Mathemtical Programming Society.[7]

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).[2] He was named to the 2023 class of Fellows of the American Mathematical Society, "for contributions to computational complexity theory, especially in the areas of complexity dichotomy".[8]

References

[edit]
  1. ^ "Two faculty members named Steenbock Professors". news.wisc.edu.
  2. ^ a b c d "Curriculum vitae" (PDF). Retrieved 2021-09-12.
  3. ^ Jin-Yi Cai at the Mathematics Genealogy Project
  4. ^ "Past Fellows | Alfred P. Sloan Foundation". sloan.org. Archived from the original on 2018-03-14. Retrieved 2021-08-19.
  5. ^ "John Simon Guggenheim Foundation | Fellows". Archived from the original on 2021-02-14. Retrieved 2021-08-19.
  6. ^ "The 2021 Gödel Prize". sigact.org.
  7. ^ "Delbert Ray Fulkerson Prize (AMS-MOS)".
  8. ^ "2023 Class of Fellows". American Mathematical Society. Retrieved 2022-11-09.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Jin-Yi_Cai&oldid=1245482635"