Daniel Lokshtanov’s work explores the limits of what computers can solve, paving the way for advances in artificial intelligence and computational efficiency.
For decades, the graph isomorphism problem has held a special status within complexity theory. While thousands of other computational problems have meekly succumbed to categorization as either hard or ...
Professor Ian Davidson's research in the Department of Computer Science focuses on making artificial intelligence systems 'fair' and trustworthy. (Graphic by Bangon Pitipong via Getty Images) In 2017, ...
What do encrypted messages, recognizing speech commands and running simulations to predict the weather have in common? They all rely on matrix multiplication for accurate calculations. DeepMind, an ...
A 20-year-old algorithm that demonstrated the benefit of using quantum mechanics to solve certain problems has finally been run on a quantum computer. Simon’s algorithm, proposed by computer scientist ...
Become an experienced problem solver who is well-versed in computing theory and programming paradigms by majoring in computer science. You gain substantive research experience and learn how to think ...
When Nathan Klein started graduate school two years ago, his advisers proposed a modest plan: to work together on one of the most famous, long-standing problems in theoretical computer science. Even ...
Become an adaptable thinker and prepare to meet the challenges of an ever-changing field. Define the future of computing with a Computer Science degree. Join a program that emphasizes community and ...
Like his work or hate it, it’s clear that the painter Jackson Pollock pioneered a distinctive visual style with his drip paintings. If you admire his work (which I do), then you probably admire his ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results