Sitan Chen (Preferred)
Sitan Chen
University of California Berkeley
Names
How do you usually write your name as author of a paper? Also add any other names you have authored papers under.
Emails
Enter email addresses associated with all of your current and historical institutional affiliations, as well as all your previous publications, and the Toronto Paper Matching System. This information is crucial for deduplicating users, and ensuring you see your reviewing assignments.
****@mit.edu
, ****@seas.harvard.edu
Personal Links
Add links to your profiles on other sites. (Optional)
Education & Career History
Enter your education and career history. The institution domain is used for conflict of interest detection and institution ranking. For ongoing positions, leave the end field blank.
Postdoc
University of California Berkeley (berkeley.edu)
2021 – 2023
PhD student
Massachusetts Institute of Technology (mit.edu)
2016 – 2021
MS student
Harvard University (harvard.edu)
2015 – 2016
Undergrad student
Harvard University (harvard.edu)
2012 – 2016
Advisors, Relations & Conflicts
Enter all advisors, co-workers, and other people that should be included when detecting conflicts of interest.
Coauthor
Adam Klivans
****@cs.utexas.edu
2020 – Present
Coauthor
Sebastien Bubeck
****@microsoft.com
2020 – Present
Coauthor
Zhao Song
****@adobe.com
2020 – Present
Coauthor
Jerry Li
****@microsoft.com
2019 – Present
Coauthor
Morris Yau
****@berkeley.edu
2019 – Present
Coauthor
Frederic Koehler
****@mit.edu
2019 – Present
Coauthor
Raghu Meka
****@cs.ucla.edu
2018 – Present
PhD Advisor
Ankur Moitra
****@mit.edu
2016 – 2021
Coauthor
Prasad Raghavendra
****@cs.berkeley.edu
2018 – 2019
Coauthor
Leslie Valiant
****@seas.harvard.edu
2015 – 2016
Coauthor
Salil Vadhan
****@harvard.edu
2014 – 2016
Expertise
For each line, enter comma-separated keyphrases representing an intersection of your interests. Think of each line as a query for papers in which you would have expertise and interest. For example: deep learning, RNNs, dependency parsing
semidefinite programming, sum-of-squares, extension complexity
2018 – 2019
approximate counting and sampling, Markov chains, statistical physics
2017 – 2019
computational learning theory
2016 – 2019