<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Amortized on Massimo Nocentini</title><link>https://massimo-nocentini.github.io/tags/amortized/</link><description>Recent content in Amortized on Massimo Nocentini</description><generator>Hugo</generator><language>en</language><managingEditor>massimo.nocentini@gmail.com (Massimo Nocentini)</managingEditor><webMaster>massimo.nocentini@gmail.com (Massimo Nocentini)</webMaster><lastBuildDate>Fri, 10 Apr 2026 09:58:04 +0100</lastBuildDate><atom:link href="https://massimo-nocentini.github.io/tags/amortized/index.xml" rel="self" type="application/rss+xml"/><item><title>The (aux fds sbral) module</title><link>https://massimo-nocentini.github.io/post/2026-04-10-scm-testsuite-sbral-suite/</link><pubDate>Fri, 10 Apr 2026 09:58:04 +0100</pubDate><author>massimo.nocentini@gmail.com (Massimo Nocentini)</author><guid>https://massimo-nocentini.github.io/post/2026-04-10-scm-testsuite-sbral-suite/</guid><description>A walkthrough of the Scheme module &lt;code&gt;(aux fds sbral)&lt;/code&gt;, showing how skew binary random-access lists support persistent front operations in constant amortized time and indexed lookup and update in logarithmic time.</description></item></channel></rss>