<?xml version="1.0" encoding="UTF-8" ?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>complexityweblog at Yahoo! Groups</title>
    <link>http://tech.groups.yahoo.com/group/complexityweblog/</link>
    <description>Computational Complexity Weblog</description>

    <item>
      <title>[Computational Complexity] If FACEBOOK the new email?</title>
      <pubDate>Mon, 09 Nov 2009 21:28:05 GMT</pubDate>
      <dc:creator>GASARCH</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1470</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1470</guid>
      <description>Back in 1993 I had the following conversation with one of my relatives: BILL: Just give me your email address and I&#39;ll email it to you. RELATIVE: I don&#39;t have</description>
    </item>
    <item>
      <title>[Computational Complexity] Button Button</title>
      <pubDate>Fri, 06 Nov 2009 13:29:38 GMT</pubDate>
      <dc:creator>Lance</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1469</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1469</guid>
      <description>Here is the offer: If you press the button you will receive $200,000. The caveat: Someone you don&#39;t know will die. I was born during run of the original</description>
    </item>
    <item>
      <title>[Computational Complexity] Innovation</title>
      <pubDate>Thu, 05 Nov 2009 12:22:27 GMT</pubDate>
      <dc:creator>Lance</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1468</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1468</guid>
      <description>The new Innovations in Computer Science conference announced their accepted papers earlier this week including my paper with Rahul Santhanam &quot;Bounding</description>
    </item>
    <item>
      <title>[Computational Complexity] Amir Pnueli (1941-2009)</title>
      <pubDate>Wed, 04 Nov 2009 11:26:09 GMT</pubDate>
      <dc:creator>Lance</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1467</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1467</guid>
      <description>Amir Pnueli, an expert in temporal logic and program verification who won the 1996 Turing Award, passed away Monday from a brain hemorrhage. His colleague</description>
    </item>
    <item>
      <title>[Computational Complexity] Really Liked Bertinoro- Ramsey Thing</title>
      <pubDate>Tue, 03 Nov 2009 18:58:32 GMT</pubDate>
      <dc:creator>GASARCH</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1466</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1466</guid>
      <description>(Reminder: STOC Deadline Thursday Nov 5, 7:00PM, Eastern: link.) After yesterday&#39;s post about RaTLoCC 2009 (Ramsey Theory in Logic, Combinatorics, and</description>
    </item>
    <item>
      <title>[Computational Complexity] Report From Ramsey-Logic-Complexity Works</title>
      <pubDate>Mon, 02 Nov 2009 18:49:13 GMT</pubDate>
      <dc:creator>GASARCH</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1465</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1465</guid>
      <description>Back from RaTLoCC 2009 which is Ramsey Theory in Logic, Combinatorics, and Complexity. - Here are the list of talks: here. - Reverse Mathematics tries to</description>
    </item>
    <item>
      <title>[Computational Complexity] FOCS News</title>
      <pubDate>Fri, 30 Oct 2009 09:36:03 GMT</pubDate>
      <dc:creator>Lance</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1464</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1464</guid>
      <description>Last month I suggested that students should go to FOCS even if they didn&#39;t have a paper there. I doubt my post had much to do with it, but I heard FOCS did</description>
    </item>
    <item>
      <title>[Computational Complexity] Proud to be a Monomath</title>
      <pubDate>Thu, 29 Oct 2009 10:42:50 GMT</pubDate>
      <dc:creator>Lance</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1463</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1463</guid>
      <description>A girl told her father that history was much easier when he was in school. &quot;Why?&quot; he asked. She responded &quot;Because there was so much less of it.&quot; An old joke,</description>
    </item>
    <item>
      <title>[Computational Complexity] FOCS Last Day</title>
      <pubDate>Wed, 28 Oct 2009 11:07:38 GMT</pubDate>
      <dc:creator>Lance</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1462</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1462</guid>
      <description>Last (but surely not least) day at FOCS 09! Jan Vondrak talked about some nice results that unify previous query complexity approaches in proving lower bounds</description>
    </item>
    <item>
      <title>[Computational Complexity] FOCS Day 2</title>
      <pubDate>Tue, 27 Oct 2009 10:26:23 GMT</pubDate>
      <dc:creator>Lance</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1461</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1461</guid>
      <description>After an early morning injection of much needed caffeine, Team Northwestern was ready for the next round of talks. Today&#39;s program consisted of talks more</description>
    </item>
    <item>
      <title>[Computational Complexity] FOCS Day 1</title>
      <pubDate>Mon, 26 Oct 2009 10:20:37 GMT</pubDate>
      <dc:creator>Lance</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1460</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1460</guid>
      <description>Michele and Michael continue their guest posts from Atlanta. The first day of FOCS is officially over. 8 sessions, 26 talks and 270 proceedings pages have</description>
    </item>
    <item>
      <title>[Computational Complexity] FOCS Day 0</title>
      <pubDate>Sun, 25 Oct 2009 22:39:38 GMT</pubDate>
      <dc:creator>Lance</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1459</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1459</guid>
      <description>Alas, I&#39;m not in Atlanta but in New York City for another meeting. Something different this time--FOCS through the eyes of two Northwestern students, Michele</description>
    </item>
    <item>
      <title>[Computational Complexity] Notes on Dagstuhl</title>
      <pubDate>Fri, 23 Oct 2009 18:30:42 GMT</pubDate>
      <dc:creator>GASARCH</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1458</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1458</guid>
      <description>A few notes on Dagshul which Lance and I were at last week. - I could tell you about the talks, but the website does a better job: here - I value going to</description>
    </item>
    <item>
      <title>[Computational Complexity] Need a Roomate for a conference?</title>
      <pubDate>Thu, 22 Oct 2009 16:18:31 GMT</pubDate>
      <dc:creator>GASARCH</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1457</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1457</guid>
      <description>(Guest Post by Dave Doty pointing to a blog by ***SORELLE*** which points to a roomate finding service for conferences.) Sorelle has announced a new roommate</description>
    </item>
    <item>
      <title>[Computational Complexity] The Humbling Power of P v NP</title>
      <pubDate>Wed, 21 Oct 2009 10:57:59 GMT</pubDate>
      <dc:creator>Lance</dc:creator>
      <link>http://tech.groups.yahoo.com/group/complexityweblog/message/1456</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/complexityweblog/message/1456</guid>
      <description>[Note from Bill: He now has an on-line list of papers who still need reviewers] Noam Nisan, back in grad school in the 80&#39;s made the following </description>
    </item>

  </channel>
</rss>
<!-- wr1.grp.sp2.yahoo.com uncompressed/chunked Mon Nov  9 14:13:36 PST 2009 -->
