<node id="565411">
  <nid>565411</nid>
  <type>news</type>
  <uid>
    <user id="32895"><![CDATA[32895]]></user>
  </uid>
  <created>1471607345</created>
  <changed>1475896924</changed>
  <title><![CDATA[ARC has 5 papers in top algorithms conference FOCS]]></title>
  <body><![CDATA[<p>Georgia Tech faculty, postdocs, and students had 5 papers accepted to appear at the upcoming <em><a href="http://dimacs.rutgers.edu/FOCS16/">57th Annual Symposium on Foundations of Computer Science</a> (FOCS)</em> conference in New Brunswick, New Jersey from October 9-11, 2016. &nbsp;FOCS (together with&nbsp;<em>STOC&nbsp;</em>which occurs in the spring) are the premier venues for publishing algorithms research. &nbsp;</p><p>The authors included ACO Ph.D. students David Durfee and Kevin Lai, ARC Postdoctoral Fellows Charilaos Efthymiou and Anup Rao, and ARC Professors Richard Peng, Santosh Vempala, and Eric Vigoda. &nbsp;In addition, Anand Louis is a recent graduate from Georgia Tech with an ACO PhD, and is now a postdoc at Princeton University.</p><p>The five <em>FOCS&nbsp;</em>papers are the following:&nbsp;</p><ul><li><strong><em> <a href="http://arxiv.org/abs/1511.03186">Accelerated Newton Iteration for Roots of Black Box Polynomials</a></em></strong></li></ul><p>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;- Anand Louis (Princeton) and&nbsp;Santosh Vempala (Georgia Tech).</p><ul><li><strong><em><a href="http://arxiv.org/abs/1604.06968">Agnostic Estimation of Mean and Covariance</a></em></strong></li></ul><p>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; - Kevin Lai (Georgia Tech), Anup Rao (Georgia Tech), and Santosh Vempala (Georgia Tech).</p><ul><li><strong><em><a href="https://arxiv.org/abs/1604.01422">Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model</a>&nbsp;&nbsp;</em></strong></li></ul><p>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; - Charilaos Efthymiou (Georgia Tech), Thomas P. Hayes (New Mexico), Daniel Stefankovic (University of Rochester),&nbsp;Eric Vigoda (Georgia Tech), and Yitong Yin (Nanjing University).</p><ul><li><a href="https://arxiv.org/abs/1608.03270"><strong><em>Faster</em></strong><strong><em>&nbsp;Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More</em></strong></a></li></ul><p>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;- Michael B. Cohen (MIT), Jonathan Kelner (MIT), &nbsp;John Peebles (MIT), Richard Peng (Georgia Tech),&nbsp;Aaron Sidford (Microsoft), and Adrian Vladu (MIT).</p><ul><li><strong><em><a href="https://arxiv.org/abs/1604.02094">On Fully Dynamic Graph Sparsifiers</a>&nbsp; &nbsp;</em></strong></li></ul><p>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;- Ittai Abraham (VMware),&nbsp;David Durfee (Georgia Tech), Ioannis Koutis (Puerto Rico),&nbsp;Sebastian Krinninger (Max Planck), and&nbsp;Richard Peng (Georgia Tech).</p><p>&nbsp;</p>&nbsp;]]></body>
  <field_subtitle>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_subtitle>
  <field_dateline>
    <item>
      <value>2016-08-19T00:00:00-04:00</value>
      <timezone><![CDATA[America/New_York]]></timezone>
    </item>
  </field_dateline>
  <field_summary_sentence>
    <item>
      <value><![CDATA[5 papers accepted to FOCS '16]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_summary>
  <field_media>
      </field_media>
  <field_contact_email>
    <item>
      <email><![CDATA[]]></email>
    </item>
  </field_contact_email>
  <field_location>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_location>
  <field_contact>
    <item>
      <value><![CDATA[<p>Eric Vigoda</p>]]></value>
    </item>
  </field_contact>
  <field_sidebar>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_sidebar>
  <field_boilerplate>
    <item>
      <nid><![CDATA[]]></nid>
    </item>
  </field_boilerplate>
  <!--  TO DO: correct to not conflate categories and news room topics  -->
  <!--  Disquisition: it's funny how I write these TODOs and then never
         revisit them. It's as though the act of writing the thing down frees me
         from the responsibility to actually solve the problem. But what can I
         say? There are more problems than there's time to solve.  -->
  <links_related> </links_related>
  <files> </files>
  <og_groups>
          <item>70263</item>
      </og_groups>
  <og_groups_both>
      </og_groups_both>
  <field_categories>
      </field_categories>
  <core_research_areas>
      </core_research_areas>
  <field_news_room_topics>
      </field_news_room_topics>
  <links_related>
      </links_related>
  <files>
      </files>
  <og_groups>
          <item>70263</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[ARC]]></item>
      </og_groups_both>
  <field_keywords>
      </field_keywords>
  <field_userdata>
      <![CDATA[]]>
  </field_userdata>
</node>
