Resolution of the Burrows-Wheeler Transform Conjecture
Offered By: IEEE via YouTube
Course Description
Overview
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
Probabilistic Graphical Models 1: RepresentationStanford University via Coursera Computer Security
Stanford University via Coursera Intro to Computer Science
University of Virginia via Udacity Introduction to Logic
Stanford University via Coursera Internet History, Technology, and Security
University of Michigan via Coursera