{"606463":{"#nid":"606463","#data":{"type":"news","title":"ARC Hosts Third Workshop on Algorithms and Randomness   ","body":[{"value":"\u003Cp\u003EThe School of Computer Science\u0026rsquo;s \u003Ca href=\u0022http:\/\/arc.gatech.edu\/\u0022\u003EAlgorithms and Randomness Center\u003C\/a\u003E (ARC) hosted its third \u003Ca href=\u0022http:\/\/arc.gatech.edu\/node\/164\u0022\u003EAlgorithms and Randomness Workshop\u003C\/a\u003E from May 14 to 17. More than 70 scholars attended the 27 talks by leading researchers in the field.\u003C\/p\u003E\r\n\r\n\u003Cp\u003EThe workshop brought together\u0026nbsp;researchers from multiple disciplines, including combinatorics, computational complexity,\u0026nbsp;optimization,\u0026nbsp;probability, randomized algorithms, and statistical physics. While some speakers presented recent breakthrough results, others gave overviews on specific\u0026nbsp;research areas or problems.\u003C\/p\u003E\r\n\r\n\u003Cp\u003ESome research highlights:\u003C\/p\u003E\r\n\r\n\u003Cp\u003E-\u003Cstrong\u003EDaniel Dadush\u003C\/strong\u003E, a researcher at Centrum Wiskunde \u0026amp; Informatica (Netherlands) and a GT alumnus, presented \u003Cem\u003E\u003Ca href=\u0022https:\/\/arxiv.org\/pdf\/1711.05667\u0022\u003EA Friendly Smoothed Analysis of the Simplex Method\u003C\/a\u003E, \u003C\/em\u003Eproviding an improved and simpler analysis of the shadow vertex simplex method.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E-Professor \u003Cstrong\u003EMark Jerrum\u003C\/strong\u003E of Queen Mary University of London, a Markov chain Monte Carlo pioneer, presented \u003Cem\u003E\u003Ca href=\u0022https:\/\/arxiv.org\/abs\/1709.08561v2\u0022\u003EA Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability\u003C\/a\u003E\u003C\/em\u003E on all terminal reliability of undirected graphs.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E-\u003Cstrong\u003EWill Perkins\u003C\/strong\u003E, a fellow at University of Birmingham (UK), presented \u003Cem\u003E\u003Ca href=\u0022https:\/\/arxiv.org\/pdf\/1803.02702\u0022\u003ESphere Packings, Codes, and Kissing Numbers via Hard Core Models\u003C\/a\u003E, \u003C\/em\u003Eproving a lower bound on the expected size of spherical code from hard cap models.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E-Professor \u003Cstrong\u003ESofya Raskhodnikova\u003C\/strong\u003E of Boston University, an expert on property testing, presented \u003Cem\u003EFast Algorithms for Testing Geometric Properties\u003C\/em\u003E, which included an introduction and survey of the field.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E-Professor \u003Cstrong\u003EVirginia Vassilevska-Williams\u003C\/strong\u003E of MIT presented \u003Cem\u003ETowards Tight Approximation Bounds for Graph Diameter and Eccentricities\u003C\/em\u003E about breakthrough lower bounds on estimating the diameter of a graph, assuming the strong exponential-time hypothesis.\u003C\/p\u003E\r\n\r\n\u003Cp\u003EThe workshop\u0026mdash;organized by ARC director Professor \u003Ca href=\u0022https:\/\/www.cc.gatech.edu\/home\/vigoda\/\u0022\u003E\u003Cstrong\u003EEric Vigoda\u003C\/strong\u003E\u003C\/a\u003E, Professor \u003Ca href=\u0022https:\/\/www.cc.gatech.edu\/~vempala\/\u0022\u003E\u003Cstrong\u003ESantosh Vempala\u003C\/strong\u003E\u003C\/a\u003E\u003Cstrong\u003E, \u003C\/strong\u003Eand Professor \u003Ca href=\u0022https:\/\/www.cc.gatech.edu\/people\/prasad-tetali\u0022\u003E\u003Cstrong\u003EPrasad Tetali\u003C\/strong\u003E\u003C\/a\u003E\u003Cstrong\u003E\u0026mdash;\u003C\/strong\u003Ealso intended to introduce burgeoning scholars to the larger community and foster collaboration.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026ldquo;Several senior researchers were particularly impressed at the next generation of researchers, judging by the high-quality results and\u0026nbsp;lectures presented,\u0026rdquo; said Tetali. \u0026ldquo;It was gratifying, as well as humbling, to see and hear of breakthrough results by\u0026nbsp;former postdocs and students of Georgia Tech colleagues and their collaborators.\u0026rdquo;\u003C\/p\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"ARC hosted a workshop on algorithms and randomness. "}],"uid":"34541","created_gmt":"2018-05-24 16:08:15","changed_gmt":"2018-06-27 18:11:11","author":"Tess Malone","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2018-05-24T00:00:00-04:00","iso_date":"2018-05-24T00:00:00-04:00","tz":"America\/New_York"},"extras":[],"hg_media":{"606464":{"id":"606464","type":"image","title":"ARC Workshop","body":null,"created":"1527178757","gmt_created":"2018-05-24 16:19:17","changed":"1527179612","gmt_changed":"2018-05-24 16:33:32","alt":"Jerrum talk","file":{"fid":"231312","name":"IMG_4969.jpg","image_path":"\/sites\/default\/files\/images\/IMG_4969_0.jpg","image_full_path":"http:\/\/www.tlwarc.hg.gatech.edu\/\/sites\/default\/files\/images\/IMG_4969_0.jpg","mime":"image\/jpeg","size":832731,"path_740":"http:\/\/www.tlwarc.hg.gatech.edu\/sites\/default\/files\/styles\/740xx_scale\/public\/images\/IMG_4969_0.jpg?itok=KaAlNy5e"}}},"media_ids":["606464"],"groups":[{"id":"47223","name":"College of Computing"},{"id":"50875","name":"School of Computer Science"},{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003ETess Malone, Communications Officer\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Ca href=\u0022mailto:tess.malone@cc.gatech.edu\u0022\u003Etess.malone@cc.gatech.edu\u003C\/a\u003E\u003C\/p\u003E\r\n","format":"limited_html"}],"email":["tess.malone@cc.gatech.edu"],"slides":[],"orientation":[],"userdata":""}}}