Innovations in Theoretical Computer Science 2018

Poster Session

When: Thursday, January 11 at 6:30-8pm (co-located with the conference reception)
Where: Boston Marriott Cambridge.

Instructions for Poster Presenters. The poster presenters should print their posters and bring them to the reception. We will provide everything else. If you wish to print your poster here in Cambridge, please contact MIT Copy Tech(Phone: 617 258 0859) by January 9, so they have enough time to print your poster. You can have it delivered to Debbie Goodwin, 32 Vassar St, Rm. G675A and we will make sure to bring it to the poster session.

List of Posters

Itay Berman
Zero-knowledge Proofs of Proximity
Lucas Boczkowski
Limits for Rumor Spreading in Stochastic Populations
Serdar Boztas
On the Complexity of 3XORSUM
Venkata Gandikota
Lattice-based Locality Sensitive Hashing is Optimal
Yingyu Liang
Matrix Completion and Related Problems via Strong Duality
Quanquan Liu
Fine-Grained I/O Complexity via Reductions: New lower bounds, faster algorithms, and a time hierarchy
Frederik Mallmann
Hierarchical Clustering Beyond the Worst-Case
Cameron Musco
Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness
Govind Ramnarayan
Relaxed Locally Correctable Codes
Cyrus Rashtchian
Edge Estimation with Independent Set Oracles