Speaker:

Yan Gu（University of California, Riverside)

Time:

• 16:20-17:20 (Time in Beijing)
• September 8, 2023 (Friday)

Venue:

518, Research Building 4

Abstract:

This talk will cover some new advances in recent parallel algorithm research.  We will introduce a few new parallel algorithms on classic graph problems such as single-source shortest paths (the rho-stepping and the delta*-stepping algorithms), biconnectivity (the FAST-BCC algorithm), and strongly connected components (the BGSS algorithm). These algorithms are simple and have good theoretical guarantees on work, span, and space.  If time permits, we will cover recent advances in computational models for modern architectures, parallel data structures, machine learning applications, etc.

Speaker Bio:

Yan Gu is an Assistant Professor in the Computer Science and Engineering (CSE) Department at the University of California, Riverside (UCR), since 2020. Prior to that, he was a postdoc associate at MIT CSAIL in 2019. Before that, he received his Ph.D. degree and Bachelor’s degree from Carnegie Mellon University in 2018 and Tsinghua University in 2012, respectively, both in computer science. His research interest is algorithm design, broadly on both the most canonical problems, and applications in databases, machine learning, graphics, architecture, etc. He has recently received the Best Paper Awards in PPoPP 2023 and ESA 2023, the Best Technical Paper Runner-up at VLDB 2023, and an Outstanding Paper Award from SPAA 2020.