<node id="526021">
  <nid>526021</nid>
  <type>news</type>
  <uid>
    <user id="30267"><![CDATA[30267]]></user>
  </uid>
  <created>1460970976</created>
  <changed>1475896881</changed>
  <title><![CDATA[2016 ARC Theory Day]]></title>
  <body><![CDATA[<p>ARC Unites Top Minds from Across the Country, Campus</p><p>Monday, April 11, marked the seventh annual <em>ARC Theory Day</em>, which brought together some of the country’s and Georgia Tech’s furthermost experts in computer science and related fields. The event featured young leaders in the arena of theoretical computer science including Stanford’s Virginia Williams, Rocco Servedio from Columbia University, Aaron Sidford of Microsoft Research, and Luca Trevisan from the University of California at Berkeley.</p><p>“This year’s event was exceptional,” said ARC Director Dana Randall. It showcased “tremendous breakthroughs” and displayed the breadth of activity in the realm of theoretical computer science that is propelling the field, she added.</p><p>Since its inception, ARC Theory Day has been a hallmark event for Georgia Tech’s Algorithms and Randomness Center (ARC). ARC identifies problems connected to algorithms and randomness and suggests provable algorithms and algorithmic explanations. Now in its seventh year, ARC Theory Day is a highly-respected event that attracts top-tier minds in many connected fields.</p><p>“We have many theory-related fields across Georgia Tech, so events like Theory Day are really important to bring everyone together,” said Randall, “This is one of the great events ARC does to bring people together to solve problems.”</p><p>One of the highlights was Williams, assistant professor of computer science at Stanford University, and her presentation on “Fine-Grained Algorithms and Complexity,” which identifies meaningful relationships between computational problems so that bounds on the time required for solutions to one can be related to time required for the other.</p><p>Trevisan, professor of electrical engineering and computer sciences and of mathematics at the University of California at Berkeley, presented a history and recent finding on Ramanujan graphs. He explained the recent discovery that special expanders known as Ramanujan Graphs can be constructed for any number of vertices and degrees.</p><p>Servedio, associate professor of computer science at Columbia University, and Postdoctoral Researcher Aaron Sidford also gave enlightening presentations explaining their recent work on “Circuit Lower Bounds via Random Projections” and “Recent Advances in the Theory of Interior Point Methods,” respectively.</p><p>For more information on the ARC Center or to read the abstracts from this year’s speakers, follow the links provided:</p><p>&nbsp;</p><p>ARC Website: <a href="http://arc.gatech.edu" title="http://arc.gatech.edu">http://arc.gatech.edu</a></p><p>ARC Theory Day: <a href="http://www.cc.gatech.edu/calendar/day/2016/04/11/9941" title="http://www.cc.gatech.edu/calendar/day/2016/04/11/9941">http://www.cc.gatech.edu/calendar/day/2016/04/11/9941</a></p>]]></body>
  <field_subtitle>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_subtitle>
  <field_dateline>
    <item>
      <value>2016-04-18T00:00:00-04:00</value>
      <timezone><![CDATA[America/New_York]]></timezone>
    </item>
  </field_dateline>
  <field_summary_sentence>
    <item>
      <value><![CDATA[ARC Celebrates Seventh Annual Theory Day]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[<p><em>Georgia Tech’s Algorithms and Randomness Center (ARC) celebrates an “exceptional” ARC Theory Day that brought together emerging leaders in theoretical computer science.</em></p>]]></value>
    </item>
  </field_summary>
  <field_media>
          <item>
        <nid>
          <node id="526161">
            <nid>526161</nid>
            <type>image</type>
            <title><![CDATA[ARC Theory Day Banner]]></title>
            <body><![CDATA[]]></body>
                          <field_image>
                <item>
                  <fid>205517</fid>
                  <filename><![CDATA[arc_theory_day_rotator.revised.jpeg]]></filename>
                  <filepath><![CDATA[/sites/default/files/images/arc_theory_day_rotator.revised_0.jpeg]]></filepath>
                  <file_full_path><![CDATA[http://tlwarc.hg.gatech.edu//sites/default/files/images/arc_theory_day_rotator.revised_0.jpeg]]></file_full_path>
                  <filemime>image/jpeg</filemime>
                  <image_740><![CDATA[]]></image_740>
                  <image_alt><![CDATA[ARC Theory Day Banner]]></image_alt>
                </item>
              </field_image>
            
                      </node>
        </nid>
      </item>
      </field_media>
  <field_contact_email>
    <item>
      <email><![CDATA[devin.young@cc.gatech.edu]]></email>
    </item>
  </field_contact_email>
  <field_location>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_location>
  <field_contact>
    <item>
      <value><![CDATA[<p>Devin M. Young</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>47223</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>47223</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[College of Computing]]></item>
      </og_groups_both>
  <field_keywords>
          <item>
        <tid>92341</tid>
        <value><![CDATA[Algorithms and Randomness Center]]></value>
      </item>
          <item>
        <tid>4265</tid>
        <value><![CDATA[ARC]]></value>
      </item>
          <item>
        <tid>171931</tid>
        <value><![CDATA[ARC Theory Day]]></value>
      </item>
          <item>
        <tid>171932</tid>
        <value><![CDATA[Theory Day]]></value>
      </item>
      </field_keywords>
  <field_userdata>
      <![CDATA[]]>
  </field_userdata>
</node>
