{"id":626610,"date":"2019-12-13T13:43:13","date_gmt":"2019-12-13T21:43:13","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/?post_type=msr-event&p=626610"},"modified":"2019-12-13T13:46:37","modified_gmt":"2019-12-13T21:46:37","slug":"soda-2020","status":"publish","type":"msr-event","link":"https:\/\/www.microsoft.com\/en-us\/research\/event\/soda-2020\/","title":{"rendered":"Microsoft @ Symposium on Discrete Algorithms 2020"},"content":{"rendered":"

Venue:<\/strong> Hilton Salt Lake City Center<\/a>
\n255 South West Temple
\nSalt Lake City, Utah<\/p>\n

Website:<\/strong> SODA 2020<\/a><\/p>\n

Contact us:<\/strong> msrevent@microsoft.com<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

The focus of SODA 2020 is on combinatorics, graph theory, cryptography, discrete optimization, mathematical programming, coding theory, information theory, game theory, and theoretical computer science, including algorithms, complexity, circuit design, robotics, and parallel processing.<\/p>\n","protected":false},"featured_media":627468,"template":"","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"msr_startdate":"2020-01-05","msr_enddate":"2020-01-08","msr_location":"Salt Lake City, Utah","msr_expirationdate":"","msr_event_recording_link":"","msr_event_link":"","msr_event_link_redirect":false,"msr_event_time":"","msr_hide_region":false,"msr_private_event":false,"footnotes":""},"research-area":[13561],"msr-region":[197900],"msr-event-type":[197941],"msr-video-type":[],"msr-locale":[268875],"msr-program-audience":[],"msr-post-option":[],"msr-impact-theme":[],"class_list":["post-626610","msr-event","type-msr-event","status-publish","has-post-thumbnail","hentry","msr-research-area-algorithms","msr-region-north-america","msr-event-type-conferences","msr-locale-en_us"],"msr_about":"Venue:<\/strong> Hilton Salt Lake City Center<\/a>\r\n255 South West Temple\r\nSalt Lake City, Utah\r\n\r\nWebsite:<\/strong> SODA 2020<\/a>\r\n\r\nContact us:<\/strong> msrevent@microsoft.com<\/a>","tab-content":[{"id":0,"name":"About","content":"As a SODA sponsor since 2007, Microsoft continues supporting this symposium jointly sponsored by this SIAM Activity Group on Discrete Mathematics and the ACM Special Interest Group on Algorithms and Computation Theory. The focus of SODA 2020 is on combinatorics, graph theory, cryptography, discrete optimization, mathematical programming, coding theory, information theory, game theory, and theoretical computer science, including algorithms, complexity, circuit design, robotics, and parallel processing. Interesting opportunities are provided to unify pure discrete mathematics and areas of applied research such as computer science, operations research, combinatorics, and the social sciences.\r\n\r\nSteering Committee Chair: Jennifer Chayes<\/a>\r\n\r\nProgram Committee Members:\r\nRavishankar Krishnaswamy<\/a>\r\nJanardhan Kulkarni<\/a>\r\n\r\nMicrosoft Attendees:\r\nJennifer Chayes<\/a>\r\nRavishankar Krishnaswamy<\/a>\r\nJanardhan Kulkarni<\/a>"},{"id":1,"name":"Sessions","content":"

Microsoft presentation schedule<\/h2>\r\n

Sunday, January 5<\/h3>\r\n9:00 AM\u201311:05 AM | Alpine East \r\nSODA Session 1B \r\nFinding a Latent k\u2212simplex in O*(k \u2022 Nnz (data)) Time Via Subset Smoothing<\/strong> \r\nChiranjib Bhattacharyya, Ravindran Kannan<\/a> \r\n\r\n2:50 PM-3:10 PM | Alpine East \r\nSODA Session 2B \r\nSample Efficient Toeplitz Covariance Estimation<\/strong> \r\nYonina Eldar, Jerry Li<\/a>, Cameron Musco, Christopher Musco \r\n\r\n5:45 PM-6:05 PM | Grand Ballroom C \r\nSODA Session 3A \r\nDifferentially Private Release of Synthetic Graphs<\/strong> \r\nMarek Elias and Michael Kapralov, Janardhan Kulkarni<\/a>, Yin Tat Lee\r\n\r\n

Monday, January 6<\/h3>\r\n5:45 PM-6:05 PM | Grand Ballroom C \r\nSODA Session 6A \r\nParallel Batch-Dynamic Graphs: Algorithms and Lower Bounds<\/strong> \r\nLaxman Dhulipala, Janardhan Kulkarni, Richard Peng, Saurabh Sawlani, Xiaorui Sun\r\n\r\n

Tuesday, January 7<\/h3>\r\n9:00-9:20 | Grand Ballroom C \r\nSODA Session 7A \r\nChasing Nested Convex Bodies Nearly Optimally<\/strong> \r\nMark Sellke, Yin Tat Lee, S\u00e9bastien Bubeck<\/a>, Yuanzhi Li, Bo\u2019az Klartag\r\n\r\n

Wednesday, January 8<\/h3>\r\n9:50 AM-10:10 AM | Alpine West \r\nSODA Session 10C \r\nAlgorithmic Price Discrimination<\/strong> \r\nRachel Cummings, Nikhil R. Devanur, Zhiyi Huang, Xiangning Wang \r\n\r\n10:15 AM -10:35 AM | Alpine West \r\nSODA Session 10C \r\nBulow-Klemperer-Style Results for Welfare Maximization in Two-Sided Markets<\/strong> \r\nMoshe Babaioff<\/a>, Kira Goldner, Yannai A. Gonczarowski<\/a> \r\n\r\n2:25 PM -2:45 PM | Grand Ballroom C \r\nSODA Session 11A \r\nAn Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs<\/strong> \r\nSayan Bhattacharya, Janardhan Kulkarni<\/a> \r\n\r\n5:20 PM-5:40 PM | Grand Ballroom C \r\nSODA Session 12A \r\nHierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints<\/strong> \r\nJanardhan Kulkarni<\/a>, Shi Li, Jakub Tarnawski<\/a>, Minwei Ye"}],"msr_startdate":"2020-01-05","msr_enddate":"2020-01-08","msr_event_time":"","msr_location":"Salt Lake City, Utah","msr_event_link":"","msr_event_recording_link":"","msr_startdate_formatted":"January 5, 2020","msr_register_text":"Watch now","msr_cta_link":"","msr_cta_text":"","msr_cta_bi_name":"","featured_image_thumbnail":"\"a","event_excerpt":"The focus of SODA 2020 is on combinatorics, graph theory, cryptography, discrete optimization, mathematical programming, coding theory, information theory, game theory, and theoretical computer science, including algorithms, complexity, circuit design, robotics, and parallel processing.","msr_research_lab":[],"related-researchers":[],"msr_impact_theme":[],"related-academic-programs":[],"related-groups":[],"related-projects":[],"related-opportunities":[],"related-publications":[642618],"related-videos":[],"related-posts":[],"_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event\/626610"}],"collection":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event"}],"about":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/types\/msr-event"}],"version-history":[{"count":3,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event\/626610\/revisions"}],"predecessor-version":[{"id":627471,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event\/626610\/revisions\/627471"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media\/627468"}],"wp:attachment":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media?parent=626610"}],"wp:term":[{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=626610"},{"taxonomy":"msr-region","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-region?post=626610"},{"taxonomy":"msr-event-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event-type?post=626610"},{"taxonomy":"msr-video-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video-type?post=626610"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=626610"},{"taxonomy":"msr-program-audience","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-program-audience?post=626610"},{"taxonomy":"msr-post-option","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-post-option?post=626610"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=626610"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}