The award recognizes the outstanding contributions of a young scientist in the field of theoretical computer science.

Thatchaphol Saranurak and collaborators were recognized at SODA ’23 for their work that broke an approximation barrier in dynamic graph matching.

Probabilities with a negative sign have been of great use in quantum physics.

Baris Kasikci plans to improve software fuzzers by learning how deployed software is most commonly run by users.

Prof. Greg Bodwin has devised a solution to an important open question in graph theory that offers promising new options for repairing and constructing resilient networks.

The thesis completely solves a longstanding open problem in the theory of distributed computing.

Through his work, Tim hopes to dramatically accelerate genomic sequencing analysis, enabling the use of handheld genomic sequencers to produce actionable diagnostic data within minutes.

The Michigan Game Studios database, developed by lecturer Austin Yarger, helps organize the state’s rapidly growing scene.

How automated guarantees that our most complex programs are secure and trustworthy can save us time, money, and anxiety.

The new technique automatically constructs policies for applications that keep them from compromising other programs.