UC Santa Barbara computer scientist Daniel Lokshtanov is advancing fundamental understanding of computational efficiency through groundbreaking research on quasi-polynomial time algorithms, supported ...

The accuracy and robustness of computational models is only one side of the equation. The field of algorithmic fairness and accountability investigates the decision-making capabilities of data-driven ...

A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the ...

Computational thinking is increasingly recognised as a fundamental approach to problem solving that transcends traditional disciplinary boundaries. It involves organising complex challenges into ...