Explore the concept of balancing straight-line programs in this 20-minute IEEE conference talk. Delve into grammar-based compression techniques, starting with an introduction and moving through definitions and simple examples. Learn about efficient algorithms for handling grammars, considering factors like size and depth. Discover the importance of random access and tree decomposition in this context. Examine applications and extensions to trees and circuits before concluding with key insights on the topic.
Overview
Syllabus
Introduction
GrammarBased Compression
Definition
Simple Examples
Grammars
Efficient Algorithms
Size and Depth
Random Access
Tree Decomposition
Applications Extensions
Trees
Circuits
Conclusion
Taught by
IEEE FOCS: Foundations of Computer Science
