<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>computer-science on Luis’ Corner</title>
    <link>https://luismtorresv.github.io/tags/computer-science/</link>
    <description>Recent content in computer-science on Luis’ Corner</description>
    <generator>Hugo</generator>
    <language>en-UK</language>
    <lastBuildDate>Wed, 25 Mar 2026 15:48:18 -0500</lastBuildDate>
    <atom:link href="https://luismtorresv.github.io/tags/computer-science/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Tango trees in Computer Science</title>
      <link>https://luismtorresv.github.io/til/20260325-tango-tree/</link>
      <pubDate>Wed, 25 Mar 2026 15:48:18 -0500</pubDate>
      <guid>https://luismtorresv.github.io/til/20260325-tango-tree/</guid>
      <description>&lt;p&gt;I was reading about&#xA;&lt;a href=&#34;https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants&#34;&gt;specialized variants of Dijkstra’s algorithm&lt;/a&gt;&#xA;when I saw the name&#xA;&lt;a href=&#34;https://en.wikipedia.org/wiki/Van_Emde_Boas_tree&#34;&gt;Van Emde Boas&lt;/a&gt;&#xA;and it grabbed my interest.&lt;/p&gt;&#xA;&lt;p&gt;I skimmed that page and saw another article&#xA;in the “See also” section:&#xA;&lt;a href=&#34;https://en.wikipedia.org/wiki/Tango_tree&#34;&gt;&lt;em&gt;Tango tree&lt;/em&gt;&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;A tango tree is a type of binary search tree&#xA;proposed by Erik D. Demaine, Dion Harmon, John Iacono, and Mihai Pătrașcu&#xA;in 2004.[1]&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;As for its etymology:&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;It is named after&#xA;&lt;a href=&#34;https://en.wikipedia.org/wiki/Buenos_Aires&#34;&gt;Buenos Aires&lt;/a&gt;,&#xA;of which the&#xA;&lt;a href=&#34;https://en.wikipedia.org/wiki/Tango&#34;&gt;tango&lt;/a&gt;&#xA;is emblematic.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
