Mathematicians have long sought to develop algorithms that can compare any two graphs. In practice, many ...

One computer scientist’s “stunning” proof is the first progress in 50 years on one of the most famous questions in computer ...

My fellow bloggingheads John Horgan and George Johnson took some time on their latest science talk to dissect my New York Times article on swarms (you can jump to that section here). John wonders ...

Avi Wigderson and László Lovász won for their work developing complexity theory and graph theory, respectively, and for connecting the two fields.

COMP_SCI 496: Expander graphs and their applications VIEW ALL COURSE TIMES AND SESSIONS Prerequisites EECS 336-0 (or equivalent) and linear algebra. Exposure to abstract algebra and complexity theory ...

For Shang-Hua Teng, theoretical computer science has never been purely theoretical. Now 58, Teng is a professor of computer science at the University of Southern California and a two-time winner of ...