<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/styles/rss-style.xsl"?>

<rss version="2.0"
 xmlns:blogChannel="http://backend.userland.com/blogChannelModule"
>

<channel>
<title>houstonperlmongers.org</title>
<link>http://houstonperlmongers.org//posts/ea7f4c7d-14d7-11ec-852a-8f498c34203c?format=xml</link>
<description>houstonperlmongers.org : /posts/ea7f4c7d-14d7-11ec-852a-8f498c34203c</description>
<language>en</language>
<pubDate>2026-05-26T07:45:28</pubDate>
<lastBuildDate>2026-05-26T07:45:28</lastBuildDate>

<image>
<title>houstonperlmongers.org</title>
<url>/favicon.ico</url>
<link>http://houstonperlmongers.org</link>
<width>32</width>
<height>32</height>
<description>houstonperlmongers.org favicon</description>
</image>
<item>
<title>Algorithmic Complexity Made Simple</title>
<link>http://houstonperlmongers.org/posts/ea7f4c7d-14d7-11ec-852a-8f498c34203c</link>
<description><![CDATA[
    <div class="date">March</div>
    <div class="topic"><span class="label">Topic:</span>
      <a href="/talks/2016talks/1603Talk/index.html">Algorithmic Complexity Made Simple</a></div>
      
      <div class="presenter"><span class="label">Presenter:</span>
      G. Wade Johnson</div>
      <div class="abstract">G. Wade Johnson introduced the idea that analyzing the complexity of algorithms
is more than just an academic exercise. He shows how to do relatively simple
analysis for quick wins.</div>
    
    
    
  ]]></description>
<author>Nobody</author>
<guid isPermaLink="true">http://houstonperlmongers.org/posts/ea7f4c7d-14d7-11ec-852a-8f498c34203c</guid>
<pubDate>2016-03-21T00:00:00</pubDate>
<enclosure url="http://houstonperlmongers.org/posts/ea7f4c7d-14d7-11ec-852a-8f498c34203c" type="text/html" />
</item>
<item>
<title>Algorithmic Complexity Made Simple</title>
<link>http://houstonperlmongers.org/posts/1458518400</link>
<description><![CDATA[
    <div class="date">March</div>
    <div class="topic"><span class="label">Topic:</span>
      <a href="/talks/2016talks/1603Talk/index.html">Algorithmic Complexity Made Simple</a></div>
      
      <div class="presenter"><span class="label">Presenter:</span>
      G. Wade Johnson</div>
      <div class="abstract">G. Wade Johnson introduced the idea that analyzing the complexity of algorithms
is more than just an academic exercise. He shows how to do relatively simple
analysis for quick wins.</div>
    
    
    
  ]]></description>
<author>Nobody</author>
<guid isPermaLink="true">http://houstonperlmongers.org/posts/1458518400</guid>
<pubDate>2016-03-21T00:00:00</pubDate>
<enclosure url="http://houstonperlmongers.org/posts/1458518400" type="text/html" />
</item>
</channel>
</rss>
