Nicole Wein

Nicole Wein is an Assistant Professor in the Computer Science and Engineering Division of the Department of Electrical Engineering and Computer Science (EECS) at the University of Michigan, College of Engineering. Her research lies in theoretical computer science, focusing on graph algorithms, dynamic algorithms, parameterized algorithms, distributed algorithms, online algorithms, and fine-grained complexity. She is part of the Theory of Computation Lab and advises both PhD and undergraduate researchers.

• PhD, Massachusetts Institute of Technology (MIT), advised by Virginia Vassilevska Williams
• Postdoctoral Fellow, DIMACS
• Research Fellow, Simons Institute, UC Berkeley
• MS, Stanford University
• BS, Computer Science/Math, Harvey Mudd College

Her research explores fundamental algorithmic questions in combinatorial settings, particularly how algorithms handle dynamic data, extract information efficiently (e.g., in linear time), and understand shortest path structures in graphs—especially directed ones. She investigates problems in distance estimation, spanners, hopsets, dynamic graph algorithms, and hardness of approximation. Her work combines theoretical depth with practical implications for algorithm design.

The recent publications reflect a strong trend in fine-grained complexity and graph algorithm design, with a focus on proving tight bounds, developing efficient approximations, and understanding structural limitations in directed and dynamic graphs. Her work frequently appears in top venues such as STOC, FOCS, SODA, and ICALP, often in collaboration with leading researchers in the field.

Scientific Awards and Recognition:

• Invited to special issue of SIAM Journal on Computing (SICOMP) (FOCS 2022 paper)
• Invited to Highlights of Algorithms (HALG) (FOCS 2022 paper)
• Invited to minisymposium at CANADAM (ESA 2022 paper)
• Work featured in Quanta Magazine

Nicole Wein actively mentors students, including current PhD student Jubayer Nirjhor and former undergraduate researchers like Sam Hiken (now pre-doc at MIT). She has served on program committees for major conferences including SODA, FOCS, ICALP, and ITCS, and co-organized the DIMACS workshop on Modern Techniques in Graph Algorithms (2023). She also contributes to the academic community through outreach, such as her article offering reassurance to early-stage PhD students in theoretical computer science.

She leads and participates in collaborative research groups and workshops, emphasizing supercollaboration and interdisciplinary communication in algorithms. Her lab fosters a strong research environment in theoretical computer science at the University of Michigan.