We meet every Thursday 12:00pm – 1:30pm at room E2-553. If you want to give a talk contact vaggos@ucsc.edu.
Spring 2025
April 10th: Lorenzo Beretta (UC Santa Cruz): Earth Mover’s Distance as fast as Closest Pair
April 17th: Juspreet Singh Sandhu (UC Santa Cruz): Hessians, entropy & free probability: Designing spectral algorithms
April 24th: Aditya Petety (UC Santa Cruz): Random order load balancing
May 1st: Ray Li (Santa Clara University): Recent work on quantum error correcting codes
May 8th: Omkar Bhalerao (UC Santa Cruz): Triadic First-Order Logic Queries in Large Temporal Networks
May 15th: Julian Mestre (University of Sydney): Title: Algorithmic aspects of Profile Guided Optimization
May 29th: Qingyun Chen (UC Santa Cruz): Survivable Network Design Revisited: Group-Connectivity.
June 5th: Daniel Paul-Pena (UC Santa Cruz): Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs
Winter 2025
February 13th: Sabyasachi Basu (UC Santa Cruz): Shortest paths in real networks, and related problems.
February 20th: Zackary Jorquera (UC Santa Cruz): Approximations for Quantum CSPs via Maximal Matchings.
February 27th: C. Seshadhri (UC Santa Cruz): Directed Hypercube Routing, a Generalized Lehman-Ron Theorem, and Monotonicity Testing.
March 6th: Srinivasan Seshadri (Aerospike): Combinatorial Problems in Databases.
March 13th: Daniel Paul-Pena (UC Santa Cruz): A Dichotomy Hierarchy for Linear Time Subgraph Counting in Bounded Degeneracy Graphs.