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

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

Descriptive set theorists study the niche mathematics of infinity. Now, they’ve shown that their problems can be rewritten in the concrete language of algorithms. All of modern mathematics is built on ...

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

A research team has developed a new technology that enables to process a large-scale graph algorithm without storing the graph in the main memory or on disks. A KAIST research team has developed a new ...