Letong Wang

I am an assistant professor in the Jarvis College of Computing and Digital Media (CDM) at DePaul University. I earned my Ph.D. in Computer Science from the University of California, Riverside (UCR), under the supervision of Yan Gu and Yihan Sun. Prior to that, I received my B.E. in Computer Science from ShanghaiTech University.  In the Fall of 2025, I was fortunate to be a research fellow at the Simons Institute for the Theory of Computing at the University of California, Berkeley, for the Algorithmic Foundations for Emerging Computing Technologies program.

My research goal is to design efficient and scalable parallel graph algorithms.  My research focuses both on improving theoretical bounds and providing high-performance software. 

I have several research assistant positions available and am also looking for potential PhD students to join in Fall 2027. If you are interested in working with me, you can find more details here.

News

• [Sep. 2025] I joined the Simons Institute for the Theory of Computing at UC Berkeley as a research fellow.

• [Aug. 2025] I defended my PhD dissertation, "Efficient and Scalable Parallel Graph Algorithms". 

• [Jul. 2025] I gave a conference talk, "Parallel Cluster-BFS and Applications to Shortest Paths," at the HOPC workshop of SPAA'25.

• [May. 2025] Our work, "Parallel Contraction Hierarchies Can Be Efficient and Scalable", was nominated as the best paper final list at ICS'25

• [Apr. 2025] I gave an invited talk, "Algorithm-System Co-Design for Parallel Graph Processing," at DePaul University.

• [Feb. 2025] I was awarded the Research Fellowship for Fall 2025 from the Simons Institute for the Theory of Computing.

• [Jan. 2025] I gave a conference talk, "Parallel Cluster-BFS and Applications to Shortest Paths," at ALENEX'25.

• [Jan. 2025] I gave an invited talk, "Efficient and Parallel Graph Algorithms," at the SIST Youth Forum, hosted by ShanghaiTech University.

• [Nov. 2024] I gave a talk, "Efficient and Parallel Graph Algorithms," at Beijing Academy of Artificial Intelligence (BAAI).

• [Nov. 2024] I gave a talk, "Efficient and Parallel Graph Algorithms," at Huawei Taylor Lab.

• [Oct. 2024] I gave an invited talk, "Efficient and Parallel Graph Algorithms," at Shenzhen Institute of Computing Sciences.

• [Oct. 2024] I gave an invited talk, "Efficient and Parallel Graph Algorithms," at the Young Investigators Symposium on Frontiers in Innovative Technology 2024, organized by the UM-SJTU Joint Institute.

• [Oct. 2024] I was honored with the Dissertation Completion Fellowship Award (DCFA) from UCR.

Selected Work