November 16, 2020 November 19, 2020

Microsoft at FOCS 2020

Location: Virtual

All times are displayed in UTC – 05:00

Monday, November 16

15:15 – 16:00 | Session 2B
An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions
Paul Duetting, Thomas Kesselheim, Brendan Lucier

24:00 – 1:30 | Poster Session 2B
An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions
Paul Duetting, Thomas Kesselheim, Brendan Lucier

Monday, November 17

14:15 – 14:30 | Session 4A
Deterministic and Efficient Interactive Coding from Hard-to-Decode Tree Codes
Zvika Brakerski, Yael Tauman Kalai, Raghuvansh Saxena

24:00 – 1:30 | Poster Session 4A
Deterministic and Efficient Interactive Coding from Hard-to-Decode Tree Codes
Zvika Brakerski, Yael Tauman Kalai, Raghuvansh Saxena

Wednesday, November 18

12:00 – 12:15 | Session 5C
Scheduling with Communication Delays via LP Hierarchies and Clustering
Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Jakub Tarnawski, Yihao Zhang

12:15 – 12:30 | Session 5A
Entanglement Is Necessary for Optimal Quantum Property Testing
Sebastien Bubeck, Sitan Chen, Jerry Li

14:15 – 14:30 | Session 6B
Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs
Jan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang

24:00 – 1:30 | Poster Session 5A
Entanglement Is Necessary for Optimal Quantum Property Testing
Sebastien Bubeck, Sitan Chen, Jerry Li

24:00 – 1:30 | Poster Session 5C
Scheduling with Communication Delays via LP Hierarchies and Clustering
Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Jakub Tarnawski, Yihao Zhang

24:00 – 1:30 | Poster Session 6B
Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs
Jan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang