Daniel Lokshtanov’s work explores the limits of what computers can solve, paving the way for advances in artificial intelligence and computational efficiency.
Through a Summer Undergraduate Research Fellowship, Jenny Quan is exploring the mathematical principles behind Rubik's cubes.
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 ...
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 ...
On the 19th of February 2025, M.Sc. Andreas Grigorjew defends his PhD thesis on Algorithms and Graph Structures for Splitting Network Flows, in Theory and Practice. The thesis is related to research ...
A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the ...
On the 10th of October 2025, M.Sc. (Tech) Chamalee Wickrama Arachchi defends her PhD thesis on Methods for Finding Structures in Feature-rich Graph Networks. The thesis is related to research done in ...
Programming in assembly language and C for students with prior experience in Java. Topics include binary number encodings, instruction set architecture, assembly language programming, and instruction ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback