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 ...
Six years ago, Afonso Bandeira and Shuyang Ling were attempting to come up with a better way to discern clusters in enormous data sets when they stumbled into a surreal world. Ling realized that 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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback