Researchers thought that they were five years away from solving a math riddle from the 1980's. In reality, and without knowing, they had nearly cracked the problem and had just given away much of the ...

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

From powering search engines to securing data and optimizing networks, algorithms underpin nearly every aspect of modern technology. Understanding how efficiently they can solve problems — and where ...

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

The Saint Louis University Department of Computer Science offers courses at the undergraduate and graduate level. Content below is provided by SLU Academic Catalog. A broad survey of the computer ...

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

Graph out-of-distribution (OOD) generalization remains a major challenge in graph neural networks (GNNs). Invariant learning, aiming to extract invariant features across varied distributions, has ...