Skip to search formSkip to main contentSkip to account menu

Finger search

In computer science, a finger search on a data structure is an extension of any search operation that structure supports, where a reference (finger… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
In this paper we present two versions of a parallel finger structure FS on p processors that supports searches, insertions and… 
2019
2019
This paper describes the features of a free, open-source software tool, Sign Language Phonetic Annotator+Analyzer (SLP-AA), which… 
2015
2015
Grammar-based compression, where one replaces a long string by a small context-free grammar that generates the string, is a… 
2014
2014
A method for detecting and tracking multiple fingers in a two dimensional set of results using oversampling hill climbing and… 
2009
2009
This thesis introduces the concept of heterogeneous decompositions of a degree-balanced search tree and applies this concept to… 
2006
2006
This thesis introduces the concept of a heterogeneous decomposition of a balanced search tree and apply it to the following… 
2005
2005
University of Aarhus 11.1 Finger Searching. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11-1 11.2… 
2004
2004
For the random binary search tree with n nodes inserted the number of ancestors of the elements with ranks k and $\ell$, $1 \le k… 
1993
1993
The authors consider the problem of finding the minimum cost of a feasible flow in directed series-parallel networks with real…