Publication:

Lock-Free Ziptrees: Towards a self-balancing lock-free binary search tree

Simple item page
datacite.rightsrestricted
dc.contributor.advisorParedes, Pedro
dc.contributor.authorRahala, Jasamrit
dc.date.accessioned2026-07-27T13:38:41Z
dc.date.available2026-07-27T13:38:41Z
dc.date.issued2026-04-16
dc.description.abstractIn this paper we investigate how to implement lock-free binary search tree based on the ziptree invented by [1]. We prove linearisability [2] for insertion operations. The techniques used in this paper are motivated by Harris [3] and [4] in their lock-free linked list implementations.
dc.identifier.urihttps://theses-dissertations.princeton.edu/handle/88435/dsp01nc580r18f
dc.language.isoen
dc.titleLock-Free Ziptrees: Towards a self-balancing lock-free binary search tree
dc.typePrinceton University Senior Theses
dspace.entity.typePublication
dspace.workflow.startDateTime2026-04-27T20:41:34.762Z
pu.contributor.authorid920340196
pu.date.classyear2026
pu.departmentComputer Science

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Senior_Thesis_Signed.pdf
Size:
611.17 KB
Format:
Adobe Portable Document Format
Download

License bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
100 B
Format:
Item-specific license agreed to upon submission
Description:
Download

Collections

Computer Science, 1987-2026