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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1998-2015
012319982015

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Grammar-based compression, where one replaces a long string by a small context-free grammar that generates the string, is a… (More)
  • figure 1
  • figure 2
Is this relevant?
2012
2012
We address the problem of creating a dictionary with the finger search property in the strict implicit model, where no… (More)
  • figure 1
  • figure 2
  • figure 3
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2004
2004
University of Aarhus 11.1 Finger Searching. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11-1 11.2… (More)
  • figure 11.2
  • figure 11.3
  • figure 11.4
  • figure 11.5
Is this relevant?
2004
2004
For the random binary search tree with n nodes inserted the number of ancestors of the elements with ranks k and `, 1 ≤ k < ` ≤ n… (More)
Is this relevant?
2003
2003
We present a new finger search tree with O(loglogd) expected search time in the Random Access Machine (RAM) model of computation… (More)
Is this relevant?
2003
2003
We show how to support the finger search operation on degree-balanced search trees in a space-efficient manner that retains a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
2002
We develop a new finger search tree with worst-case constant update time in the Pointer Machine (PM) model of computation. This… (More)
Is this relevant?
1998
1998
We consider the problem of implementing finger search trees on the pointer machine, i.e., how to maintain a sorted list such that… (More)
Is this relevant?
1998
1998
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that… (More)
Is this relevant?