Shortest paths, dynamic algorithms, and fine-grained complexity
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=dGqJXpFh0cE
Nicole Wein (University of Michigan)
https://simons.berkeley.edu/talks/nicole-wein-university-michigan-2023-09-08
Meet the Fellows Welcome Event Fall 2023
I work in graph algorithms and lower bounds including in the areas of shortest paths, dynamic algorithms, and fine-grained complexity. For each of these areas I will mention a few problems that I have worked on (either successfully or unsuccessfully). I hope you will come talk to me if you see an overlap in our interests.
Other Videos By Simons Institute for the Theory of Computing
Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Meet the Fellows Welcome Event Fall 2023
Nicole Wein