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 ...
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 ...
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 ...
Expanders graphs are sparse but well-connected. These seemingly contrasting properties have led to many applications in theoretical computer science, from complexity ...
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 ...
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 ...
On the 27th of June 2025, M.Sc. Nicola Rizzo defends his PhD thesis on Indexable Sequence Graphs: Exploiting Uniqueness in the Pangenome Era. The thesis is related to research done in the Department ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results