Skip to search formSkip to main contentSkip to account menu

Finger search tree

In computer science, finger search trees are a type of binary search tree that keeps pointers to interior nodes, called fingers. The fingers speed up… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
AVL treeB-treeFinger searchFinger tree

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Quantifying Spatiotemporal Patterns in the Expansion of Twitching Bacterial Colonies
QUANTIFYING SPATIOTEMPORAL PATTERNS IN THE EXPANSION OF TWITCHING BACTERIAL COLONIES Erin Shelton Advisor: University of Guelph… 
2006
2006
A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME
In this paper we show how a slight modification of (a, 2b)-trees allows us to perform member and neighbor queries in O(log n… 
2003
2003
New Dynamic Balanced Search Trees with Worst-Case Constant Update Time
We present new search trees with worst-case O(1) update time and O(log n) search time, storing n elements in linear space, in the… 
1998
1998
A Tree-based Mergesort
Abstract. We demonstrate that if standard Mergesort is implemented using finger search trees instead of arrays it optimally… 
1997
1997
Purely functional lists
We describe an efficient purely functional implementation of deques with catenation. In addition to being an intriguing problem… 
1981
1981
Relationship of finger size and typing speed and errors
Dennis J. LaBonty, Summer, 1981 Business Education The Relationship of Finger Size and Typing Speed and Errors Director: Donald B… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)