Loading [Contrib]/a11y/accessibility-menu.js
CompSci 269S, Spring 2018: Theory Seminar
The Theory Group normally meets Fridays at 1:00pm; this quarter we are
in DBH 1423.
Below is this quarter's schedule.
- Apr 6:
- Organizational meeting
-
- Apr 13:
- Ioannis Panageas
- (Optimistic) Gradient for Min-max optimization:
Limit points, Convergence and Learning
-
- Apr 20:
- Vijay Vazirani
- Distributive lattices, stable matchings, and robust
solutions
-
- Apr 27:
- Timothy Johnson
- Interactive Visualization of Java Programs
-
- May 4:
- Sid Gupta
- Planar Steiner Orientation is NP-complete
-
- May 11:
- Juan Besa
- The amortized complexity of non-blocking binary
search trees
-
- May 18:
- Pedro Matias
- A Polynomial Sized Kernel for Tracking Paths
Problem
-
- May 25:
- Elham Havvaei
- On the fixed-parameter tractability of DNA
reporter strand
- ----
- Martha Osegueda
- Don’t Rock the Boat: Algorithms for Balanced
Dynamic Loading and Unloading
-
- Jun 1:
- Karthik Gajulapalli
- Non-Uniform ACC Circuit Lower Bounds
- ----
- Jordan Jorgensen
- Rollercoasters and Caterpillars
-
- Jun 8:
- Nil Mamano
- On the Hardness of a Pursuit Game in Graphs
-
Previous
quarters' theory seminars