During my master’s program, I worked on a data structure that I named the block-tree. I utilized the block-tree to develop a linearizable wait-free queue, which exhibited superior worst-case performance compared to all previous linearizable wait-free queues. The results of this work have been published in ACM PODC 2023. Although I did not mention the block-tree by name in my final paper, I wanted to pay tribute to it as it held significance for me during my research. Below, you can find links to my work.
block-tree
first poly-log data-structure to store blocks in a tree