You are currently offline. Some features of the site may not work correctly.

# 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

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
• DISC
• 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
Is this relevant?
2018
2018
• ISAAC
• 2018
• Corpus ID: 52170382
We study multi-finger binary search trees (BSTs), a far-reaching extension of the classical BST model, with connections to the… Expand
Is this relevant?
2017
2017
• Theory of Computing Systems
• 2017
• Corpus ID: 8912842
Grammar-based compression, where one replaces a long string by a small context-free grammar that generates the string, is a… Expand
Is this relevant?
2016
2016
• FSTTCS
• 2016
• Corpus ID: 52078341
Grammar-based compression, where one replaces a long string by a small context-free grammar that generates the string, is a… Expand
Is this relevant?
2015
2015
• ArXiv
• 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
Is this relevant?
2012
2012
• ISAAC
• 2012
• Corpus ID: 13239112
We address the problem of creating a dictionary with the finger search property in the strict implicit model, where no… Expand
Is this relevant?
2010
2010
• CCCG
• 2010
• Corpus ID: 917574
Given a bounded universe { 0 , 1 , ? , U - 1 } , we show how to perform predecessor searches in O ( log log Δ ) expected time… Expand
Is this relevant?
2006
2006
This thesis introduces the concept of a heterogeneous decomposition of a balanced search tree and apply it to the following… Expand
Is this relevant?
2004
2004
• SIAM J. Comput.
• 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
Is this relevant?
2003
2003
• SODA '03
• 2003
• Corpus ID: 782646
We show how to support the finger search operation on degree-balanced search trees in a space-efficient manner that retains a… Expand
Is this relevant?