Media Summary: March 25, 2021 talk in the IGAFIT (Interest Group on Algorithmic Foundations of Information Technology) Algorithmic Colloquium. Three motivating examples. Pros and cons of Finish LP decoding of LDPC codes (see Lecture 11 notes).
Beyond Worst Case Analysis Workshop Introduction Tim Roughgarden - Detailed Analysis & Overview
March 25, 2021 talk in the IGAFIT (Interest Group on Algorithmic Foundations of Information Technology) Algorithmic Colloquium. Three motivating examples. Pros and cons of Finish LP decoding of LDPC codes (see Lecture 11 notes). Pricing to maximize expected revenue with an unknown distribution. Full From unknown input distributions to restricted instance optimality. Stable clustering, part 1. The k-median problem and the BBG algorithm. Full
Instance optimality in computational geometry. Full
