PhD Seminar • Algorithms and Complexity • Minimizing Discrete Convex Functions
Please note: This PhD seminar will be given online.
Abhinav Bommireddi, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Eric Blais
Abhinav Bommireddi, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Eric Blais
Kai Li
Paul M. Wythes '55, P'86 and Marcia R. Wythes P'86 Professor
Department of Computer Science, Princeton University
Karthik Murali, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Therese Biedl
Brad Glasbergen, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Khuzaima Daudjee
Data systems are known for their complexity; they contain a vast number of features and configuration parameters to support different use cases. As no single data system can efficiently process all workload types, administrators face a daunting task:
Abhinav Bommireddi, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Eric Blais
Venkatraman Arumugam, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Mei Nagappan
Kaladhar Voruganti, Senior Fellow
Technology and Architecture, Office of the CTO, Equinix
Abhinav Bommireddi, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Eric Blais
A body K ⊂ Rn is convex if and only if the line segment between any two points in K is completely contained within K or, equivalently, if and only if the convex hull of a set of points in K is contained within K.
Chang Ge, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Ihab Ilyas
Genseric Ghiro, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Olga Veksler