<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Resources on rkempe’s blog</title>
    <link>https://blog.rkempe.ca/tags/resources/</link>
    <description>Recent content in Resources on rkempe’s blog</description>
    <generator>Hugo</generator>
    <language>en-ca</language>
    <copyright>&amp;copy; Copyright 2026 Rebecca Kempe</copyright>
    <lastBuildDate>Thu, 22 May 2025 21:34:31 -0400</lastBuildDate>
    <atom:link href="https://blog.rkempe.ca/tags/resources/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Why Does Theory Matter in Computer Science? (Part 5)</title>
      <link>https://blog.rkempe.ca/posts/2025/05/why-does-theory-matter-in-computer-science-part-5/</link>
      <pubDate>Thu, 22 May 2025 21:34:31 -0400</pubDate>
      <guid>https://blog.rkempe.ca/posts/2025/05/why-does-theory-matter-in-computer-science-part-5/</guid>
      <description>Here is a long list of sources I consulted at various points while doing research for this project. As it might have become clear through reading the previous installments of this series, this was more a talk about the densest subgraph problem than it was about theory being useful in computer science. There are a few reasons for that, which I might explain in more detail at some point in the future. This means that I presented a lot of information that I borrowed from other people! Here’s an annotated bibliography of sorts, in case you were interested in going deeper, for whatever reason.</description>
    </item>
  </channel>
</rss>
