<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Ideas on EtaoinWu</title>
    <link>https://etaoinwu.com/en/categories/ideas/</link>
    <description>Recent content in Ideas on EtaoinWu</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en</language>
    
    
    <lastBuildDate>Sat, 03 Jul 2021 23:07:00 +0800</lastBuildDate><atom:link href="https://etaoinwu.com/en/categories/ideas/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Lower bound of deterministic Zipfian top-k problem</title>
      <link>https://etaoinwu.com/en/blog/space-saving-upper-bounds/</link>
      <pubDate>Sat, 03 Jul 2021 23:07:00 +0800</pubDate>
      
      <guid>https://etaoinwu.com/en/blog/space-saving-upper-bounds/</guid>
      <description>Space Saving algorithm is optimal. Here’s why.</description>
    </item>
    
    <item>
      <title>Unlabeled Graph Encoding</title>
      <link>https://etaoinwu.com/en/blog/unlabeled-graph-encoding/</link>
      <pubDate>Thu, 24 Jun 2021 16:43:47 +0800</pubDate>
      
      <guid>https://etaoinwu.com/en/blog/unlabeled-graph-encoding/</guid>
      <description>How many bits of information can we encode into a unlabeled
graph?</description>
    </item>
    
  </channel>
</rss>