Office hours will be posted on the respective iLearn page and held through Zoom. Please contact the office if you are unable to find instructions for office hours for a particular class.
Advising HoursFriday: 4:00 p.m. - 5:00 p.m.
https://ilearn.sfsu.edu/collab/course/view.php?id=1863 (Zoom info is posted on this site. Contact firstname.lastname@example.org if you are not enrolled in this site.)
Areas of Expertise
- Graph Theory
- Randomized Algorithms
- T. Sun, "Face distributions of embeddings of complete graphs," Journal of Graph Theory (2021).
- T. Sun, "Simultaneous constructions for minimum triangulations and complete graph embeddings". Ars Mathematica Contemporanea (2020).
- X. Chen, T. Randolph, R. Servedio, T. Sun, "A Lower Bound on Cycle-Finding in Sparse Digraphs". Symposium on Discrete Algorithms (2020).
- X. Chen, A. Freilich, R. Servedio, T. Sun, "Sample-based high-dimensional convexity testing". RANDOM (2017).
WebsiteDr. Sun's website