Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
The CB tree: a practical concurrent self-adjusting search tree
Yehuda Afek
, Haim Kaplan
, Boris Korenfeld
, Adam Morrison
,
Robert E. Tarjan
Computer Science
Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
21
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The CB tree: a practical concurrent self-adjusting search tree'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Self-adjusting
100%
Splay Tree
50%
Non-uniform Memory Access
25%
Sequential Execution
25%
Concurrent Search
25%
Binary Search Tree
25%
Operation Sequence
25%
Real Workloads
25%
Computer Science
Tree Search
100%
Binary Search Tree
50%
Frequently Accessed Item
50%