PhD Seminar • Computer Graphics • Stippling: A Halloween-type Adventure
Please note: This PhD seminar will be given online.
Gregory Philbrick, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Craig Kaplan
Gregory Philbrick, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Craig Kaplan
Jessy Ceha, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Edith Law
Ayush Sekhari, PhD candidate
Computer Science Department, Cornell University
Daniel Gabric, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Jeffrey Shallit
Eyal de Lara, Department of Computer Science
University of Toronto
Chelsea Komlo, PhD candidate
David R. Cheriton School of Computer Science
Supervisors: Professors Ian Goldberg, Douglas Stebila
Sangho Suh, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Edith Law
Bryant Curto, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Martin Karsten
Thomas Neumann, Department of Computer Science
Technical University of Munich
Join ordering is one of the core problems of query optimization, as differences in join order can affect the execution time of queries by orders of magnitudes. Unfortunately, the problem is NP hard in general, and real-world queries can join hundreds of relations, which makes exact solutions prohibitive expensive.
Sudarsun Kannan, Department of Computer Science
Rutgers University
The last decade has seen a rapid hardware innovation to develop ultra-fast and heterogeneous storage and memory technologies for accelerating data-intensive applications. Unfortunately, current monolithic system software stacks with coarse-grained synchronization, high data movement costs, and inflexible abstractions continue to be Achille’s heel, thereby failing to exploit hardware innovations.