SCS Seminar
— 12:00pm
Location:
In Person
-
Newell-Simon 4305
Speaker:
RICHARD PENG
,
Associate ProfessorCheriton School of Computer ScienceUniversity of Waterloo
https://cs.uwaterloo.ca/people-profiles/richard-peng
A Survey of Fast Flow Algorithms
This talk will survey recent developments in algorithms for computing network flows. Flows, or combinations of paths, have origins in routing and assignment problems, and are closely related to many core primitives in data science. The talk will briefly overview progress in combinatorial data structures, continuous optimization, and graph approximation theory motivated by designing faster flow problems. Then it will discuss ways of combining such tools, with focus on recent developments of speeding up second order optimization methods using dynamic graph data structures. — Richard Peng is an associate professor in the Cheriton School of Computer Science at the University of Waterloo. He is known for fast algorithms for solving graph structured linear systems, and his current research revolves around the design, analysis, and implementation of efficient algorithms. Richard was a recipient of the 2011 Microsoft PhD Fellowship, an NSF CAREER Award, and the 2021 ACM-SIAM Symposium on Discrete Algorithms Best Paper Award.
For More Information:
kschrece@andrew.cmu.edu