<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>Concurrent Data Structures on Brian&#39;s Blog</title>
    <link>http://blog.brianmoniaga.com/tags/concurrent-data-structures/</link>
    <description>Recent content in Concurrent Data Structures on Brian&#39;s Blog</description>
    <generator>Hugo -- 0.147.5</generator>
    <language>en</language>
    <lastBuildDate>Fri, 20 Nov 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="http://blog.brianmoniaga.com/tags/concurrent-data-structures/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>f-Arrays for Noobs.</title>
      <link>http://blog.brianmoniaga.com/posts/f_array/</link>
      <pubDate>Fri, 20 Nov 2026 00:00:00 +0000</pubDate>
      <guid>http://blog.brianmoniaga.com/posts/f_array/</guid>
      <description>&lt;p&gt;This post is about the $f$-array data structure, which was introduced by Prasad
Jayanti in &lt;a href=&#34;https://dl.acm.org/doi/pdf/10.1145/571825.571875&#34;&gt;f-arrays: implementation and applications&lt;/a&gt; (PODC 2002).&lt;/p&gt;
&lt;h1 id=&#34;what-is-it&#34;&gt;What is it?&lt;/h1&gt;
&lt;p&gt;An $f$-array is a data structure that can be thought of as similar to a
regular array, except it provides a &lt;code&gt;read()&lt;/code&gt; operation.
This read operation returns the value of some function $f$ applied to the whole array.&lt;/p&gt;
&lt;p&gt;Furthermore, the types of the elements in the array need not be the same, so
a mental model I have for the array is something like the following:&lt;/p&gt;</description>
    </item>
    <item>
      <title>Lazy List for Noobs.</title>
      <link>http://blog.brianmoniaga.com/posts/lazy_list/</link>
      <pubDate>Fri, 13 Nov 2026 00:00:00 +0000</pubDate>
      <guid>http://blog.brianmoniaga.com/posts/lazy_list/</guid>
      <description>&lt;p&gt;This is the first post in which I go over random concurrent data structures.&lt;/p&gt;
&lt;p&gt;This post is based on the Lazy List data structure introduced here:
&lt;a href=&#34;https://people.csail.mit.edu/shanir/publications/Lazy_Concurrent.pdf&#34;&gt;https://people.csail.mit.edu/shanir/publications/Lazy_Concurrent.pdf&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Ideally this post can help you understand at a high level how we can optimize a regular
set data structure and eventually end up with the one described in the paper.&lt;/p&gt;
&lt;h1 id=&#34;what-is-it&#34;&gt;What is it?&lt;/h1&gt;
&lt;p&gt;The data structure presented in the paper is known as the Lazy List.
It functions like a regular sequential set in which as a user you can call
the following APIs:&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
