Microsoft @ Symposium on Discrete Algorithms 2020
Location: Salt Lake City, Utah
Microsoft presentation schedule
Sunday, January 5
9:00 AM–11:05 AM | Alpine East
SODA Session 1B
Finding a Latent k−simplex in O*(k • Nnz (data)) Time Via Subset Smoothing
Chiranjib Bhattacharyya, Ravindran Kannan
2:50 PM-3:10 PM | Alpine East
SODA Session 2B
Sample Efficient Toeplitz Covariance Estimation
Yonina Eldar, Jerry Li, Cameron Musco, Christopher Musco
5:45 PM-6:05 PM | Grand Ballroom C
SODA Session 3A
Differentially Private Release of Synthetic Graphs
Marek Elias and Michael Kapralov, Janardhan Kulkarni, Yin Tat Lee
Monday, January 6
5:45 PM-6:05 PM | Grand Ballroom C
SODA Session 6A
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds
Laxman Dhulipala, Janardhan Kulkarni, Richard Peng, Saurabh Sawlani, Xiaorui Sun
Tuesday, January 7
9:00-9:20 | Grand Ballroom C
SODA Session 7A
Chasing Nested Convex Bodies Nearly Optimally
Mark Sellke, Yin Tat Lee, Sébastien Bubeck, Yuanzhi Li, Bo’az Klartag
Wednesday, January 8
9:50 AM-10:10 AM | Alpine West
SODA Session 10C
Algorithmic Price Discrimination
Rachel Cummings, Nikhil R. Devanur, Zhiyi Huang, Xiangning Wang
10:15 AM -10:35 AM | Alpine West
SODA Session 10C
Bulow-Klemperer-Style Results for Welfare Maximization in Two-Sided Markets
Moshe Babaioff, Kira Goldner, Yannai A. Gonczarowski
2:25 PM -2:45 PM | Grand Ballroom C
SODA Session 11A
An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs
Sayan Bhattacharya, Janardhan Kulkarni
5:20 PM-5:40 PM | Grand Ballroom C
SODA Session 12A
Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints
Janardhan Kulkarni, Shi Li, Jakub Tarnawski, Minwei Ye