<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Algorithm on EtaoinWu</title>
    <link>https://etaoinwu.com/tags/algorithm/</link>
    <description>Recent content in Algorithm on EtaoinWu</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>zh-hans-cn</language>
    
    
    <lastBuildDate>Sun, 04 Jul 2021 01:18:00 +0800</lastBuildDate><atom:link href="https://etaoinwu.com/tags/algorithm/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Zipf 分布下 Top-k 问题确定性算法的空间复杂度下界</title>
      <link>https://etaoinwu.com/blog/space-saving-upper-bounds/</link>
      <pubDate>Sun, 04 Jul 2021 01:18:00 +0800</pubDate>
      
      <guid>https://etaoinwu.com/blog/space-saving-upper-bounds/</guid>
      <description>Space Saving 算法在某个意义下是理论最优的。</description>
    </item>
    
    <item>
      <title>无标号图编码</title>
      <link>https://etaoinwu.com/blog/unlabeled-graph-encoding/</link>
      <pubDate>Thu, 24 Jun 2021 15:12:47 +0800</pubDate>
      
      <guid>https://etaoinwu.com/blog/unlabeled-graph-encoding/</guid>
      <description>利用一张无标号图，我们能编码多少信息？</description>
    </item>
    
    <item>
      <title>动态图连通性的 Holm-de Lichtenberg-Thorup 算法</title>
      <link>https://etaoinwu.com/blog/fully-dynamic-connectivity/</link>
      <pubDate>Thu, 17 Oct 2019 21:58:38 +0800</pubDate>
      
      <guid>https://etaoinwu.com/blog/fully-dynamic-connectivity/</guid>
      <description>算是LOJ
122的一个官方题解吧…带加边删边地维护一张图，支持连通性查询。</description>
    </item>
    
    <item>
      <title>Top Tree 学习笔记</title>
      <link>https://etaoinwu.com/blog/top-tree-notes/</link>
      <pubDate>Mon, 20 Aug 2018 17:34:00 +0000</pubDate>
      
      <guid>https://etaoinwu.com/blog/top-tree-notes/</guid>
      <description>一篇写给自己看的 top tree 的笔记，慎入</description>
    </item>
    
    <item>
      <title>欧拉回路树</title>
      <link>https://etaoinwu.com/blog/euler-tour-tree/</link>
      <pubDate>Wed, 16 Nov 2016 19:44:00 +0000</pubDate>
      
      <guid>https://etaoinwu.com/blog/euler-tour-tree/</guid>
      <description>以边为中心、子树为导向的动态数——欧拉回路树</description>
    </item>
    
  </channel>
</rss>