Qilin Ye

This page is under construction. Come back later! Last updated June 2026.

I am an incoming Computer Science Ph.D. student at Stanford University, starting in Fall 2026. I’m broadly interested in theoretical computer science, especially approximation algorithms and algorithmic game theory.

Previously, I earned my degrees at the University of Southern California and Duke University, where I had the great fortune to be advised by Robin Jia (USC), Vatsal Sharan (USC), and Kamesh Munagala (Duke).

I can be reached at qilin.ye@stanford.edu.

For lecture notes I’ve taken at USC or at Duke, visit here.


Publications

(Most papers in theory venues have alphabetical author ordering)

Cutting Down the Tower: Single-Exponential Envy-Free Cake Cuttingwith Yannan Bai.

Working paper.

Deliberation via Matchingwith Kamesh Munagala and Ian Zhang.

EC'26 || link

Transformers Provably Learn Algorithmic Solutions for Graph Connectivity, But Only with the Right Datawith Deqing Fu, Robin Jia, Vatsal Sharan.

ICML'26 || link