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

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

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

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

Since the very first days of computer science — a field known for its methodical approach to problem-solving — randomness has played an important role. The first program to run on the world’s first ...

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