9:00 a.m. Maximally recoverable codes. Parikshit Gopalan, VMware Research
Guangda Hu, Google
Swastik Kopparty, Rutgers University
Shubhangi Saraf, Rutgers University
Carol Wang, National University of Singapore
Sergey Yekhanin*, Microsoft Research
(1125-68-2462)
10:00 a.m. Communication Efficient Secret Sharing. Wentao Huang, California Institute of Technology
Michael Langberg, The State University of New York at Buffalo
Joerg Kliewer*, New Jersey Institute of Technology
Jehoshua Bruck, California Institute of Technology
(1125-94-1508)
4:15 p.m. Boolean Intersection Graphs. Hoang Dau, University of Illinois, Urbana-Champaign
Olgica Milenkovic*, University of Illinois, Urbana-Champaign
(1125-05-1019)