YoVDO

Resolution of the Burrows-Wheeler Transform Conjecture

Offered By: IEEE via YouTube

Tags

Data Structures Courses Computer Science Courses Information Theory Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the groundbreaking resolution of the Burrows-Wheeler Transform Conjecture in this 25-minute IEEE conference talk presented by Dominik Kempa from UC Berkeley and Tomasz Kociumaka from Bar-Ilan University. Delve into the details of their research, which addresses a long-standing problem in string compression and data structures. Gain insights into the implications of this resolution for algorithmic theory and practical applications in data compression and text indexing.

Syllabus

Resolution of the Burrows-Wheeler Transform Conjecture


Taught by

IEEE FOCS: Foundations of Computer Science

Tags

Related Courses

Intro to Computer Science
University of Virginia via Udacity Design of Computer Programs
Stanford University via Udacity Analytic Combinatorics, Part I
Princeton University via Coursera Algorithms, Part I
Princeton University via Coursera Algorithms, Part II
Princeton University via Coursera