When:
Monday, February 23, 2026
12:00 PM - 1:00 PM CT
Where: Mudd Hall ( formerly Seeley G. Mudd Library), 3514, 2233 Tech Drive, Evanston, IL 60208 map it
Audience: Faculty/Staff - Student - Post Docs/Docs - Graduate Students
Cost: free
Contact:
Wynante R Charles
(847) 467-8174
wynante.charles@northwestern.edu
Group: Department of Computer Science (CS)
Category: Academic, Lectures & Meetings
Monday / CS Seminar
February 23 / 12:00 PM
Hybrid / Mudd 3514
Speaker
Xiaorui Sun, UIC
Talk Title
Toward Faster Algebraic Computation: An Isomorphism Perspective
Abstract
"Over the past few decades, linear-algebraic techniques played a central role in the design of faster algorithms, with notable successes in many graph algorithms such as maximum flow and shortest paths. However, for many problems that are not yet known to admit polynomial-time algorithms—such as integer factoring and various isomorphism problems—linear methods alone are often insufficient. In these settings, more general nonlinear algebraic structures, including groups, rings, and modules, naturally arise. Achieving further algorithmic progress requires a deeper understanding of these algebraic objects.
In this talk, I will discuss how algebraic representations have become essential to recent advances in isomorphism problems. I will highlight connections among several central isomorphism problems and survey the techniques that have led to more efficient algorithms. I will conclude by discussing open challenges and outlining promising directions for future research."
Biography
Xiaorui Sun is an Associate Professor of Computer Science at the University of Illinois Chicago. His research interests lie in theoretical computer science, with an emphasis on the intersection of algorithms and algebraic computation. After earning his PhD from Columbia University, he worked at Simons Institute for the Theory of Computing and Microsoft Research. He is a recipient of the NSF CAREER Award, and his work have been featured in Communications of the ACM and Quanta Magazine.
Research Interests: theoretical computer science, algorithms, and algebraic computation