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

The exponential growth in computer processing power seen over the past 60 years may soon come to a halt. Complex systems such as those used in weather forecast, for example, require high computing ...

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

People have performed many mathematical proofs to show that a quantum computer will vastly outperform traditional computers on a number of algorithms. But the quantum ...

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include logic and Boolean circuits; sets, ...

18-year-old Ewin Tang has proven that classical computers can solve the “recommendation problem” nearly as fast as quantum computers. The result eliminates one of the best examples of quantum speedup.

Students enrolled in the Professional MS in Computer Science (MSCPS) program with the Algorithms, Network and Optimization (ANO) subplan must complete 30 credit hours of graduate coursework that align ...