Explicit Constructions

In recent years, the field of explicit constructions in theoretical computer science has achieved several major milestones.  We have seen continued progress in explicit construction of classical objects such as expander graphs, extractors and dispersers, and error-correcting codes.  But on top of this, we now have explicit constructions of high-powered versions of these objects with properties that once seemed out of reach: unique-neighbor and lossless expanders, agreement testers and quantum codes (from high-dimensional expanders), extractors for highly adversarial sources, locally-testable and list-decodable LDPC codes, and more.

This workshop will bring together researchers working at the forefront of explicit constructions in TCS.  Our goals are to:

• present some of the latest research in the area in an accessible way;

• unify and relate explicit constructions from different areas;

• highlight mathematical tools and techniques of relevance for explicit constructions in TCS; and, 

• to identify important challenges for the future of the area.