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) |