CS Events

Faculty Candidate Talk

Algorithm Design for Massive Graphs

 

Download as iCal file

Monday, February 26, 2018, 10:30am

 

The need to process increasingly large quantities of data has led to the emergence of graphs that are massive in scale. Processing such graphs poses unique algorithmic challenges because even linear time or linear working space can be prohibitively expens

Speaker: Aaron Bernstein

Bio

Aaron Bernstein is a researcher at Berlin University of Technology, focusing on algorithms and theoretical computer science. He received his PhD from Columbia University in 2016, advised by Cliff Stein.

Location : CoRE 301

Committee

Martin Farach-Colton

Event Type: Faculty Candidate Talk

Abstract: 

Organization

Berlin University of Technology