A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

With a $9.2 million grant from Intelligence Advanced Research Projects Activity (IARPA), Prof. Andrew A. Chien will lead a team of University of Chicago computer science researchers building the ...

On the 27th of June 2025, M.Sc. Nicola Rizzo defends his PhD thesis on Indexable Sequence Graphs: Exploiting Uniqueness in the Pangenome Era. The thesis is related to research done in the Department ...

Expanders graphs are sparse but well-connected. These seemingly contrasting properties have led to many applications in theoretical computer science, from complexity ...