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 ...

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

New research from the University of Waterloo is making inroads on one of the biggest problems in theoretical computer science ...

On the 10th of October 2025, M.Sc. (Tech) Chamalee Wickrama Arachchi defends her PhD thesis on Methods for Finding Structures in Feature-rich Graph Networks. The thesis is related to research done in ...

Jacob Holm was flipping through proofs from an October 2019 research paper he and colleague Eva Rotenberg—an associate professor in the department of applied mathematics and computer science at the ...

This is a graduate topics course on learning in networks, focusing in particular on fundamental statistical and computational limits. Topics include the planted clique problem, community detection, ...

Imagine standing atop a mountain, gazing at the vast landscape below, trying to make sense of the world around you. For centuries, explorers relied on such vantage points to map their surroundings.

Drawing from diverse disciplines, including computational social science, computer science, complex systems, and networks, ...