Edit Distance in Near-Linear Time - It’s a Constant Factor
Offered By: IEEE via YouTube
Course Description
Overview
Explore a groundbreaking approach to computing edit distance in near-linear time through this 26-minute IEEE conference talk by Columbia University researchers Alexandr Andoni and Negev Shekel Nosatzki. Delve into the problem setup, potential solutions, and the innovative approach that achieves this computational feat. Gain insights into the underlying data structure and its guarantees, understanding why this method works and its implications for algorithmic efficiency.
Syllabus
Introduction
Problem set up
What can be done
Approach
Why
Solution
Data Structure
Guarantees
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against NatureIEEE via YouTube Computation in the Brain Tutorial - Part 2
IEEE via YouTube Computation in the Brain - Part 1
IEEE via YouTube Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
IEEE via YouTube Cookbook Lower Bounds for Statistical Inference in Distributed and Constrained Settings - Part 1
IEEE via YouTube