FOCS 2014 Workshop on The Sparse Fourier Transform:
Theory and Applications

The workshop is dedicated to the theory and applications of efficient algorithms for finding large Fourier coefficients. This question is of longstanding interest in TCS. Recently, the topic has attracted considerable attention in applied computer science, electrical engineering and applied mathematics. The goal of the workshop is to facilitate interactions between these areas and disseminate recent developments and ideas related to this topic.

Time	Speaker	Title
Session 1
9:00-9:40 am	Eric Price (University of Texas at Austin)	Overview of Sparse Fourier Transform Algorithms [SLIDES]
9:40-10:05 am	Anna Gilbert (University of Michigan, Ann Arbor)	Discrete Inverse Problems and Fourier Sampling [SLIDES]
10:05-10:30 am	Mark Iwen (Michigan State University)	Computing Sparse Chebyshev and Legendre Coefficient Expansions via SFTs [SLIDES]
10:30-11:00 am	Coffee Break
Session 2
11:00-11:45 am	Kannan Ramchandran (University of California, Berkeley)	Sparse Fourier Transforms Based on Sparse-Graph Alias Codes [SLIDES]
11:45-12:30 am	Haitham Hassanieh (MIT) Dina Katabi (MIT)	Overview of Sparse Fourier Transform Applications [SLIDES PART 1]
12:30-2:00 pm	Lunch Break
Session 3
2:00-3:00 pm	Eric Blais (University of Waterloo)	Overview of Fourier Sampling Over the Boolean Cube [SLIDES]
3:00-3:30 pm	Ankur Moitra (MIT)	The Threshold for Super-resolution [SLIDES]
Bonus Talk
Monday 10:40 am	Michael Kapralov (IBM Watson)	Sample-Optimal Fourier Sampling in Any Constant Dimension [SLIDES] (as a part of the regular FOCS program)

Algorithms and Signal Processing Course: https://stellar.mit.edu/S/course/6/fa14/6.893/materials.html