Algorithmic complexity and information theory are foundational disciplines that intersect to elucidate how data is structured, transmitted and computed. At its core, algorithmic complexity seeks to ...

Complexity theory is a fundamental branch of theoretical computer science that categorises computational problems according to their inherent difficulty and the resources required to solve them. At ...

WEST LAFAYETTE, Ind. — In 2019, Google claimed it was the first to demonstrate a quantum computer performing a calculation beyond the abilities of today’s most powerful supercomputers. But most of the ...

A new theory could bring a way to make quantum algorithm development less of an accidental process, say scientists. In 2019, Google claimed it was the first to demonstrate a quantum computer ...

Welcome to the website of the CS theory group at CU Boulder! Our faculty and students research all aspects of theoretical computer science, from core areas such as algorithms, complexity, and ...

The most widely used technique for finding the largest or smallest values of a math function turns out to be a fundamentally difficult computational problem. Many aspects of modern applied research ...

Roth, Alvin E. "Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions." Prepared for Gale's Feast: A Day in Honor of the 85th Birthday of David Gale International Journal of ...

Roth, Alvin E. "Deferred Acceptance Algorithms: History, Theory, Practice." In Better Living through Economics, edited by John J. Siegfried, 206–222. Harvard ...

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