Scholar
Yaqiao Li
Google Scholar ID: QgGUxKgAAAAJ
Assistant Prof, SUAT at Shenzhen
Citations & Impact
Citations
30
H-index
3
i10-index
1
Publications
18
Co-authors
0
Contact
Publications
Resume (English only)
Academic Achievements
- 2025: Paper 'Undecidability of polynomial inequalities in subset densities and additive energies' accepted by COCOON 2025; 2025: Paper 'Diversity-seeking swap games in networks' accepted by AAMAS 2025; 2025: Paper 'Renting servers for multi-parameter jobs in the cloud' won ICDCN 2025 best paper award; 2024: Paper 'Perspective on complexity measures targeting read-once branching programs' accepted by Information and Computation; 2024: Paper 'On the Online Weighted Non-Crossing Matching Problem' accepted by SWAT 2024.
Research Experience
- Currently an Assistant Professor at Shenzhen University of Advanced Technology (SUAT).
Education
- Bachelor's in Computer Science from ECUST; Master's in Pure Math from Peking University, supervised by Jinpeng An; PhD in Computer Science from McGill University, supervised by Hamed Hatami, Pierre McKenzie, Denis Pankratov, and Lata Narayanan; Postdoc at University of Montreal and Concordia University.
Background
- Research Interests: Understanding resource-constrained computation and developing the mathematics that underpin it. Currently investigating branching programs and online graph coloring, as well as exploring a new version of Kakeya sets.
Miscellany
- Email: liyaqiao@suat-sz.edu.cn
Co-authors