Events

Filters
Export this event to calendar
iCal
RSS
RSS
Close X

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Friday, June 3, 2022 2:00 pm - 3:00 pm EDT (GMT -04:00)

PhD Seminar • Algorithms and Complexity • On Testing and Robust Characterization of Convexity

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.

Tuesday, June 7, 2022 3:30 pm - 4:30 pm EDT (GMT -04:00)

Master’s Research Paper Presentation • Systems and Networking • PerFaaS: A Discrete-Event Simulator for Serverless Computing Platforms

Please note: This master’s research paper presentation will be given online.

Shahzaib Ali, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Tim Brecht

Wednesday, June 15, 2022 2:00 pm - 3:30 pm EDT (GMT -04:00)

DLS: Tony Chan — A Personal and Historical View of Computational Mathematics

Please note: This DLS presentation will be given in person in DC 1302 and livestreamed over MS Teams.

Tony Chan
President, King Abdullah University of Science and Technology (KAUST)
Professor, Applied Mathematics and Computational Science

In its modern incarnation, computational mathematics is a discipline that blossomed only after WWII. But even in its relatively brief history, there have been some major shifts in its methodology, emphasis, and applications.

Monday, June 20, 2022 1:30 pm - 1:30 pm EDT (GMT -04:00)

PhD Defence • Algorithms and Complexity • Complexity of Sublinear Algorithms for Convexity in Higher Dimensions

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.