Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,287,014 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
10 relations
Binary search algorithm
Computer science
Data structure
Finger search tree
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Parallel Finger Search Structures
Seth Gilbert
,
Wei Quan Lim
International Symposium on Distributed Computing
2019
Corpus ID: 199472868
In this paper we present two versions of a parallel finger structure FS on p processors that supports searches, insertions and…
Expand
2019
2019
SLP-AA: Tools for Sign Language Phonetic and Phonological Research
R. Lo
,
K. Hall
Interspeech
2019
Corpus ID: 202720058
This paper describes the features of a free, open-source software tool, Sign Language Phonetic Annotator+Analyzer (SLP-AA), which…
Expand
2015
2015
Finger Search, Random Access, and Longest Common Extensions in Grammar-Compressed Strings
Philip Bille
,
Anders Roy Christiansen
,
Patrick Hagge Cording
,
Inge Li Gørtz
arXiv.org
2015
Corpus ID: 17484540
Grammar-based compression, where one replaces a long string by a small context-free grammar that generates the string, is a…
Expand
2014
2014
Multi-dimensional multi-finger search using oversampling hill climbing and descent with range
迈克尔·D·莱顿
2014
Corpus ID: 70098780
A method for detecting and tracking multiple fingers in a two dimensional set of results using oversampling hill climbing and…
Expand
2013
2013
Fast local searches and updates in bounded universes
P. Bose
,
Karim Douïeb
,
V. Dujmović
,
John Howat
,
Pat Morin
Canadian Conference on Computational Geometry
2013
Corpus ID: 917574
2009
2009
Heterogeneous decomposition of degree-balanced search trees and its applications
G. Blelloch
,
B. Maggs
,
Shan Leung Maverick Woo
2009
Corpus ID: 12589668
This thesis introduces the concept of heterogeneous decompositions of a degree-balanced search tree and applies this concept to…
Expand
2006
2006
Finger Search on Balanced Search Trees
Maverick Woo
2006
Corpus ID: 16214535
This thesis introduces the concept of a heterogeneous decomposition of a balanced search tree and apply it to the following…
Expand
2005
2005
11 Finger Search Trees
G. Brodal
2005
Corpus ID: 5694716
University of Aarhus 11.1 Finger Searching. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11-1 11.2…
Expand
2004
2004
Distances and Finger Search in Random Binary Search Trees
L. Devroye
,
Ralph Neininger
SIAM journal on computing (Print)
2004
Corpus ID: 14358014
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…
Expand
1993
1993
An efficient parallel algorithm for min-cost flow on directed series-parallel networks
Amit Jain
,
N. Chandrasekharan
[] Proceedings Seventh International Parallel…
1993
Corpus ID: 18302692
The authors consider the problem of finding the minimum cost of a feasible flow in directed series-parallel networks with real…
Expand
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)
ACCEPT & CONTINUE