Events Calendar

Due to public health concerns related to COVID-19, many university-sponsored events have been canceled until further notice. Many events are held remotely via Zoom. For updates regarding S&T and COVID-19, visit

Computer Science Seminar

Wednesday, February 6, 2019 at 10:00am to 10:50am

Parallel Balanced Binary Trees Using Just Join

 Yihan Sun, CMU

With the evolution of hardware and growth in the volume of data, parallelism has become imperative and the key to improving performance. As such, it is of great interest to have simple and efficient parallel algorithms and data structures for programmers to easily organize and process data. My research designs such simple and efficient parallel algorithms and data structures, with provable guarantees in theory, good performance in practice, as well as simplicity in programming. In particular, this talk will introduce my work on parallel tree structures, that are highly-parallelized, safe for concurrency, theoretically work-efficient, supporting a wide range of functions and augmentations and multi-versioned. The tree structure is also implemented in a C++ library called PAM, and applied to various areas such as computational geometry and databases.
Bio: Yihan Sun is currently a Ph.D. student in Computer Science Department at Carnegie Mellon University, advised by Prof. Guy Blelloch. Prior to that, she received her Bachelor’s degree in Computer Science from Tsinghua University, working on data mining and social network analysis. Her research interests broadly lie in the theory and practice of parallel algorithms, data structures, as well as their implementations and applications.

Event Type

Meetings, Lectures and Conferences


College of Engineering and Computing, Computer Science

CEC Distinguished Speakers
Add to calendar

Recent Activity