<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Algorithms on TDJ28</title><link>https://www.tdj28.org/categories/algorithms/</link><description>Recent content in Algorithms on TDJ28</description><generator>Hugo -- gohugo.io</generator><language>en-us</language><copyright>© 2026 TJ</copyright><lastBuildDate>Sat, 21 Feb 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://www.tdj28.org/categories/algorithms/index.xml" rel="self" type="application/rss+xml"/><item><title>Searching Without Being Searched: The Architecture of Oblivious Prefix Trees</title><link>https://www.tdj28.org/en/blog/post/computer_science/algorithms/prefix-trees/</link><pubDate>Sat, 21 Feb 2026 00:00:00 +0000</pubDate><guid>https://www.tdj28.org/en/blog/post/computer_science/algorithms/prefix-trees/</guid><description>A rigorous analysis of Prefix Trees (Tries) and Radix Trees, evolving from memory hierarchy constraints to cryptographically secure Data-Oblivious architectures.</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://www.tdj28.org/en/blog/post/computer_science/algorithms/prefix-trees/featured.png"/></item></channel></rss>