{"id":506684,"date":"2018-09-20T15:07:59","date_gmt":"2018-09-20T22:07:59","guid":{"rendered":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/?post_type=msr-event&p=506684"},"modified":"2025-08-06T11:56:51","modified_gmt":"2025-08-06T18:56:51","slug":"focs-2018","status":"publish","type":"msr-event","link":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/event\/focs-2018\/","title":{"rendered":"Microsoft @ FOCS 2018"},"content":{"rendered":"\n\n

Venue:<\/strong> Maison de la Chimie (opens in new tab)<\/span><\/a><\/p>\n

Website:<\/strong> FOCS 2018 (opens in new tab)<\/span><\/a>Opens in a new tab<\/span><\/p>\n","protected":false},"excerpt":{"rendered":"

Microsoft is proud to be a sponsor of the IEEE Symposium on Foundations of Computer Science (FOCS) in Paris October 7-9, 2018.<\/p>\n","protected":false},"featured_media":506693,"template":"","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"_classifai_error":"","msr_startdate":"2018-10-07","msr_enddate":"2018-10-09","msr_location":"Paris, France","msr_expirationdate":"","msr_event_recording_link":"","msr_event_link":"https:\/\/www.irif.fr\/~focs2018\/registration\/","msr_event_link_redirect":false,"msr_event_time":"","msr_hide_region":false,"msr_private_event":false,"msr_hide_image_in_river":0,"footnotes":""},"research-area":[13546],"msr-region":[239178],"msr-event-type":[197941],"msr-video-type":[],"msr-locale":[268875],"msr-program-audience":[],"msr-post-option":[],"msr-impact-theme":[],"class_list":["post-506684","msr-event","type-msr-event","status-publish","has-post-thumbnail","hentry","msr-research-area-computational-sciences-mathematics","msr-region-europe","msr-event-type-conferences","msr-locale-en_us"],"msr_about":"\n\n

Venue:<\/strong> Maison de la Chimie (opens in new tab)<\/span><\/a><\/p>\n

Website:<\/strong> FOCS 2018 (opens in new tab)<\/span><\/a>Opens in a new tab<\/span><\/p>\n","tab-content":[{"id":0,"name":"","content":"Microsoft is proud to be a sponsor of the 59th<\/sup> Annual IEEE Symposium on Foundations of Computer Science (FOCS) in Paris October 7-9, 2018.\r\n

<\/h2>\r\n

Program Committee Member<\/h2>\r\n

Yael Kalai<\/a><\/p>\r\n\r\n

<\/h2>\r\n

Accepted Papers<\/h2>\r\n

Holder Homeomorphisms and Approximate Nearest Neighbors<\/a>\r\nSunday, October 7, 2018 | 2:00 PM\u20132:20 PM | Session 1.3.A | Lavoisier amphitheater<\/h4>\r\n

Alexandr Andoni, Assaf Naor, Aleksandar Nikolov, Ilya Razenshteyn<\/strong><\/a>, Erik Waingarten<\/p>\r\n\r\n

Classical lower bounds from quantum upper bounds<\/a>\r\nMonday, October 8, 2018 | 9:50 AM\u201310:10 AM | Session 2.1.B | Hall 101<\/h4>\r\n

Shalev Ben-David, Adam Bouland, Ankit Garg, Robin Kothari<\/strong><\/a><\/p>\r\n\r\n

Recharging Bandits<\/a>\r\nMonday, October 8, 2018 | 10:15 AM\u201310:35 AM | Session 2.1.A | Lavoisier amphitheater<\/h4>\r\n

Robert Kleinberg, Nicole Immorlica<\/strong><\/a><\/p>\r\n\r\n

Quantum algorithm for simulating real time evolution of lattice Hamiltonians<\/a>\r\n<\/strong>Monday, October 8, 2018 | 10:15 AM\u201310:35 AM | Session 2.1.B | Hall 101<\/h4>\r\n

Jeongwan Haah<\/strong><\/a>, Matthew B. Hastings<\/strong><\/a>, Robin Kothari<\/strong><\/a>, Guang Hao Low<\/strong><\/a><\/p>\r\n\r\n

The Sample Complexity of Up-to-\u0190 Multi-Dimensional Revenue Maximization<\/a>\r\nMonday, October 8, 2018 | 11:45 AM\u201312:05 PM | Session 2.2.B | Hall 101<\/h4>\r\n

Yannai A. Gonczarowski<\/strong>, S. Matthew Weinberg<\/p>\r\n\r\n

Testing Graph Clusterability: Algorithms and Lower Bounds<\/a>\r\nMonday, October 8, 2018 | 2:25 PM\u20132:45 PM | Session 2.3.B | Hall 101<\/h4>\r\n

Ashish Chiplunkar, Michael Kapralov, Sanjeev Khanna, Aida Mousavifar, Yuval Peres<\/strong><\/a><\/p>\r\n\r\n

Revealing network structure, confidentially: Improved Rates for Node-private Graphon Estimation<\/a>\r\nMonday, October 8, 2018 | 3:40 PM\u20134:00 PM | Session 2.3.B | Hall 101<\/h4>\r\n

Christian Borgs<\/strong><\/a>, Jennifer Chayes<\/strong><\/a>, Adam Smith, Ilias Zadik<\/p>\r\n\r\n

Efficient Statistics, in High Dimensions, from Truncated Samples<\/a>\r\nTuesday, October 9, 2018 | 10:15 AM\u201310:35 AM | Session 3.1.A | Lavoisier amphitheater<\/h4>\r\n

Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos<\/strong>, Manolis Zampetakis<\/p>\r\n\r\n

Efficient algorithms for tensor scaling, quantum marginals, and moment polytopes<\/a>\r\nTuesday, October 9, 2018 | 4:20 PM\u20134:40 PM | Session 3.4.A | Lavoisier amphitheater<\/h4>\r\n

Peter Burgisser, Cole Franks, Ankit Garg<\/strong>, Rafael Oliveira, Michael Walter, Avi Wigderson<\/p>"}],"msr_startdate":"2018-10-07","msr_enddate":"2018-10-09","msr_event_time":"","msr_location":"Paris, France","msr_event_link":"https:\/\/www.irif.fr\/~focs2018\/registration\/","msr_event_recording_link":"","msr_startdate_formatted":"October 7, 2018","msr_register_text":"Watch now","msr_cta_link":"https:\/\/www.irif.fr\/~focs2018\/registration\/","msr_cta_text":"Watch now","msr_cta_bi_name":"Event Register","featured_image_thumbnail":"\"Paris","event_excerpt":"Microsoft is proud to be a sponsor of the IEEE Symposium on Foundations of Computer Science (FOCS) in Paris October 7-9, 2018.","msr_research_lab":[199563,199565],"related-researchers":[],"msr_impact_theme":[],"related-academic-programs":[],"related-groups":[],"related-projects":[],"related-opportunities":[],"related-publications":[],"related-videos":[],"related-posts":[],"_links":{"self":[{"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-event\/506684","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-event"}],"about":[{"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/types\/msr-event"}],"version-history":[{"count":3,"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-event\/506684\/revisions"}],"predecessor-version":[{"id":1147077,"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-event\/506684\/revisions\/1147077"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/media\/506693"}],"wp:attachment":[{"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/media?parent=506684"}],"wp:term":[{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=506684"},{"taxonomy":"msr-region","embeddable":true,"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-region?post=506684"},{"taxonomy":"msr-event-type","embeddable":true,"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-event-type?post=506684"},{"taxonomy":"msr-video-type","embeddable":true,"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-video-type?post=506684"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=506684"},{"taxonomy":"msr-program-audience","embeddable":true,"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-program-audience?post=506684"},{"taxonomy":"msr-post-option","embeddable":true,"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-post-option?post=506684"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=506684"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}