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

Avi Wigderson and László Lovász won for their work developing complexity theory and graph theory, respectively, and for connecting the two fields. When Avi Wigderson and László Lovász began their ...

Gallai–Ramsey theory lies at the intersection of graph colouring and Ramsey theory, providing a framework for understanding how structures emerge in edge-coloured graphs. Central to this domain is the ...

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

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

Power graphs provide an innovative way to visualise and analyse the algebraic structure of finite groups. In a power graph, the elements of a finite group serve as vertices, and an edge is drawn ...

Drexel's College of Computing & Informatics' Post-Baccalaureate/Graduate Certificate in Computer Science Theory & Practice provides a technical basis for the study of computer science, both ...

These past few months have not been kind to any of us. The ripples caused by the COVID-19 crisis are felt far and wide, and the world's economies have taken a staggering blow. As with most things in ...