Kai Li
Paul M. Wythes '55, P'86 and Marcia R. Wythes P'86 Professor
Department of Computer Science, Princeton University
Please note: This master’s thesis presentation will be given in person in DC as well as online.
Karthik Murali, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Therese Biedl
Please note: This PhD seminar will be given online.
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:
Please note: This PhD seminar will be given online.
Abhinav Bommireddi, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Eric Blais
Please note: This master’s thesis presentation will be given online.
Venkatraman Arumugam, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Mei Nagappan
Please note: This seminar will be given online and recorded. Please register to attend.
Kaladhar Voruganti, Senior Fellow
Technology and Architecture, Office of the CTO, Equinix
Please note: This PhD seminar will be given online.
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.
Please note: This PhD defence will take place online.
Chang Ge, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Ihab Ilyas
Please note: This PhD defence will take place online.
Jiayi Chen, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Urs Hengartner
Please note: This PhD defence will take place online.
Venkata Abhinav Bommireddi, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Eric Blais
Convexity plays a prominent role in both mathematics and computer science. It is defined for sets and functions, and many problems related to them can be solved efficiently given the guarantee that the set/function is convex. In this thesis, we focus on three problems related to convexity where we don’t have that guarantee.
