{"id":700798,"date":"2020-10-23T14:43:48","date_gmt":"2020-10-23T21:43:48","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/?post_type=msr-event&#038;p=700798"},"modified":"2020-10-23T14:43:48","modified_gmt":"2020-10-23T21:43:48","slug":"focs-2020","status":"publish","type":"msr-event","link":"https:\/\/www.microsoft.com\/en-us\/research\/event\/focs-2020\/","title":{"rendered":"Microsoft at FOCS 2020"},"content":{"rendered":"<p>Website: <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/focs2020.cs.duke.edu\/\" target=\"_blank\" rel=\"noopener noreferrer\">FOCS 2020<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Microsoft is proud to be a sponsor of the 61st Annual IEEE Symposium on Foundations of Computer Science.<\/p>\n","protected":false},"featured_media":0,"template":"","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"_classifai_error":"","msr_startdate":"2020-11-16","msr_enddate":"2020-11-19","msr_location":"Virtual","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,243138],"msr-region":[256048],"msr-event-type":[197941],"msr-video-type":[],"msr-locale":[268875],"msr-program-audience":[],"msr-post-option":[],"msr-impact-theme":[],"class_list":["post-700798","msr-event","type-msr-event","status-publish","hentry","msr-research-area-algorithms","msr-research-area-quantum","msr-region-global","msr-event-type-conferences","msr-locale-en_us"],"msr_about":"Website: <a href=\"https:\/\/focs2020.cs.duke.edu\/\" target=\"_blank\" rel=\"noopener noreferrer\">FOCS 2020<\/a>","tab-content":[{"id":0,"name":"About","content":"Microsoft is proud to be a sponsor of the <a href=\"https:\/\/focs2020.cs.duke.edu\/\" target=\"_blank\" rel=\"noopener\">61st Annual IEEE Symposium on Foundations of Computer Science<\/a>. See more details on our contributions on the sessions tab."},{"id":1,"name":"Sessions","content":"<em>All times are displayed in UTC \u2013 05:00<\/em>\r\n<h2>Monday, November 16<\/h2>\r\n15:15 \u2013 16:00 | Session 2B\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/an-olog-log-m-prophet-inequality-for-subadditive-combinatorial-auctions\/\"><strong>An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions<\/strong><\/a>\r\nPaul Duetting, Thomas Kesselheim, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/brlucier\/\">Brendan Lucier<\/a>\r\n\r\n24:00 \u2013 1:30 | Poster Session 2B\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/an-olog-log-m-prophet-inequality-for-subadditive-combinatorial-auctions\/\"><strong>An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions<\/strong><\/a>\r\nPaul Duetting, Thomas Kesselheim, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/brlucier\/\">Brendan Lucier<\/a>\r\n<h2>Monday, November 17<\/h2>\r\n14:15 \u2013 14:30 | Session 4A\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/deterministic-and-efficient-interactive-coding-from-hard-to-decode-tree-codes\/\"><strong>Deterministic and Efficient Interactive Coding from Hard-to-Decode Tree Codes<\/strong><\/a>\r\nZvika Brakerski, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/yael\/\">Yael Tauman Kalai<\/a>, Raghuvansh Saxena\r\n\r\n24:00 \u2013 1:30 | Poster Session 4A\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/deterministic-and-efficient-interactive-coding-from-hard-to-decode-tree-codes\/\"><strong>Deterministic and Efficient Interactive Coding from Hard-to-Decode Tree Codes<\/strong><\/a>\r\nZvika Brakerski, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/yael\/\">Yael Tauman Kalai<\/a>, Raghuvansh Saxena\r\n<h2>Wednesday, November 18<\/h2>\r\n12:00 \u2013 12:15 | Session 5C\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/scheduling-with-communication-delays-via-lp-hierarchies-and-clustering\/\"><strong>Scheduling with Communication Delays via LP Hierarchies and Clustering<\/strong><\/a>\r\nSami Davies, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/jakul\/\">Janardhan Kulkarni<\/a>, Thomas Rothvoss, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/jatarnaw\/\">Jakub Tarnawski<\/a>, Yihao Zhang\r\n\r\n12:15 \u2013 12:30 | Session 5A\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/entanglement-is-necessary-for-optimal-quantum-property-testing\/\"><strong>Entanglement Is Necessary for Optimal Quantum Property Testing<\/strong><\/a>\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/sebubeck\/\">Sebastien Bubeck<\/a>, Sitan Chen, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/jerrl\/\">Jerry Li<\/a>\r\n\r\n14:15 \u2013 14:30 | Session 6B\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/bipartite-matching-in-nearly-linear-time-on-moderately-dense-graphs\/\"><strong>Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs<\/strong><\/a>\r\nJan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang\r\n\r\n24:00 \u2013 1:30 | Poster Session 5A\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/entanglement-is-necessary-for-optimal-quantum-property-testing\/\"><strong>Entanglement Is Necessary for Optimal Quantum Property Testing<\/strong><\/a>\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/sebubeck\/\">Sebastien Bubeck<\/a>, Sitan Chen, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/jerrl\/\">Jerry Li<\/a>\r\n\r\n24:00 \u2013 1:30 | Poster Session 5C\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/scheduling-with-communication-delays-via-lp-hierarchies-and-clustering\/\"><strong>Scheduling with Communication Delays via LP Hierarchies and Clustering<\/strong><\/a>\r\nSami Davies, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/jakul\/\">Janardhan Kulkarni<\/a>, Thomas Rothvoss, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/jatarnaw\/\">Jakub Tarnawski<\/a>, Yihao Zhang\r\n\r\n24:00 \u2013 1:30 | Poster Session 6B\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/bipartite-matching-in-nearly-linear-time-on-moderately-dense-graphs\/\"><strong>Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs<\/strong><\/a>\r\nJan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang"}],"msr_startdate":"2020-11-16","msr_enddate":"2020-11-19","msr_event_time":"","msr_location":"Virtual","msr_event_link":"","msr_event_recording_link":"","msr_startdate_formatted":"November 16, 2020","msr_register_text":"Watch now","msr_cta_link":"","msr_cta_text":"","msr_cta_bi_name":"","featured_image_thumbnail":null,"event_excerpt":"Microsoft is proud to be a sponsor of the 61st Annual IEEE Symposium on Foundations of Computer Science.","msr_research_lab":[],"related-researchers":[],"msr_impact_theme":[],"related-academic-programs":[],"related-groups":[],"related-projects":[],"related-opportunities":[],"related-publications":[656511,700822,700834,700843,700852],"related-videos":[],"related-posts":[],"_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event\/700798","targetHints":{"allow":["GET"]}}],"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":2,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event\/700798\/revisions"}],"predecessor-version":[{"id":700858,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event\/700798\/revisions\/700858"}],"wp:attachment":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media?parent=700798"}],"wp:term":[{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=700798"},{"taxonomy":"msr-region","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-region?post=700798"},{"taxonomy":"msr-event-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event-type?post=700798"},{"taxonomy":"msr-video-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video-type?post=700798"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=700798"},{"taxonomy":"msr-program-audience","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-program-audience?post=700798"},{"taxonomy":"msr-post-option","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-post-option?post=700798"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=700798"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}