Graph algorithms lie at the heart of modern computational theory, probing how networks of vertices and edges can be explored, optimised or transformed under constraints that often defy efficient ...

A new paper in AI & Society argues that algorithmic systems manufacture our preference for the very curation that degrades ...

Quantum computers promise speedups across a sweeping range of problems, from factoring large integers to simulating molecules ...

Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a public transportation network. Mathematicians have long sought to develop ...

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 time, creating a ...

Back in the hazy olden days of the pre-2000s, navigating between two locations generally required someone to whip out a paper map and painstakingly figure out the most optimal route between those ...

Wenchao Li (ECE, SE, CS) was awarded a National Science Foundation Faculty Early Career Development (CAREER) award to further his research on specification-guided imitation learning (IL). Li uses a ...

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

Many mathematical puzzles in everyday life, like estimating travel time or making a budget, are straightforward. The building blocks that we learn as children — addition, subtraction, multiplication, ...