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

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

In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

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

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

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

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