Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
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.
