<node id="587943">
  <nid>587943</nid>
  <type>news</type>
  <uid>
    <user id="32895"><![CDATA[32895]]></user>
  </uid>
  <created>1487969909</created>
  <changed>1505737333</changed>
  <title><![CDATA[ARC has 4 papers in upcoming STOC '17]]></title>
  <body><![CDATA[<p>Georgia Tech faculty, postdocs, and students had 4&nbsp;papers accepted to appear at the upcoming <a href="http://acm-stoc.org/stoc2017/"><em>49th Annual ACM Symposium on Theory of Computing (STOC)</em></a>&nbsp;conference in Montreal, Canada on June 19-23, 2017. &nbsp;STOC and&nbsp;<a href="http://dimacs.rutgers.edu/FOCS16/">FOCS</a> are the premier venues for publishing algorithms research (STOC occurs annually in the spring and FOCS in the fall). &nbsp;In particular, STOC`17 will be part of a 5-day Theory Festival that brings together the best of algorithmic research from a variety of venues. &nbsp;</p>

<p>The authors include&nbsp;ACO Ph.D. students David Durfee and Sadra Yazdanbod, ARC Postdoctoral Fellow&nbsp;Anup Rao, and ARC Professors Richard Peng, Vijay Vazirani, and Santosh Vempala.&nbsp; In addition, Jugal Garg and Ruta Mehta are former ARC Postdoctoral Fellows. &nbsp;Ruta is now an <a href="http://rutamehta.cs.illinois.edu">Assistant Professor at UIUC</a>. &nbsp;Professor Mohit Singh was on the program committee.</p>

<p>The four&nbsp;<em>STOC&nbsp;</em>papers are the following:&nbsp;</p>

<ul>
	<li><a href="https://arxiv.org/abs/1411.5060">Settling the Complexity of Leontief and PLC Exchange Markets under Exact and Approximate Equilibria</a></li>
</ul>

<p>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;- Jugal Garg (UIUC), Ruta Mehta (UIUC), Vijay V. Vazirani (GT), and Sadra Yazdanbod (GT)</p>

<ul>
	<li><a href="https://arxiv.org/abs/1606.04696">Geodesic Walks in Polytopes</a></li>
</ul>

<p>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; - Yin Tat Lee (Microsoft/Washington), Santosh S. Vempala (GT)</p>

<ul>
	<li><a href="https://arxiv.org/abs/1611.00755">Almost-Linear-Time Algorithms for Markov Chains and New Spectral Primitives for Directed Graphs&nbsp;</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 (GT), Anup Rao (GT), Aaron Sidford (Stanford), and Adrian Vladu (MIT).</p>

<ul>
	<li><a href="https://arxiv.org/abs/1611.07451">Sampling Random Spanning Trees Faster than Matrix Multiplication&nbsp;&nbsp; </a><br />
	&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;- David Durfee (GT), Rasmus Kyng (Yale),&nbsp;John Peebles (MIT), Anup B. Rao (GT), and Sushant Sachdeva (Google).</li>
</ul>
]]></body>
  <field_subtitle>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_subtitle>
  <field_dateline>
    <item>
      <value>2016-10-01T00:00:00-04:00</value>
      <timezone><![CDATA[America/New_York]]></timezone>
    </item>
  </field_dateline>
  <field_summary_sentence>
    <item>
      <value><![CDATA[ ARC has 4 papers in upcoming STOC '17]]></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[]]></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>
