Algorithms for Memory Hierarchies

The trend towards increasingly powerful computers with multi-core processors continues, but the sizes of the data sets we collect and process increase even faster. Traditional algorithms prove unable to fully utilize the power of modern computers in order to process massive data sets in a timely fashion. In particular, there is a need for algorithms that combine parallelism with efficient use of caches, main memory, and hard drives. This is the focus of the applicant's research with particular emphasis on geometric and graph problems motivated by applications in areas including business intelligence, geographic information systems, database systems, and web technology.