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)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, Inge Li GÃ¸rtz
- Theory of Computing Systems
- 2016

Grammar-based compression, where one replaces a long string by a small context-free grammar that generates the string, is aâ€¦Â (More)

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)

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)

Is this relevant?

2004

2004

- Gerth StÃ¸lting Brodal
- Handbook of Data Structures and Applications
- 2004

University of Aarhus 11.1 Finger Searching. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11-1 11.2â€¦Â (More)

Is this relevant?

2004

2004

- Luc Devroye, Ralph Neininger
- SIAM J. Comput.
- 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

- Alexis C. Kaporis, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas, Christos D. Zaroliagis
- Algorithmica
- 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

- Guy E. Blelloch, Bruce M. Maggs, Maverick Woo
- SODA
- 2003

We show how to support the finger search operation on degree-balanced search trees in a space-efficient manner that retains aâ€¦Â (More)

Is this relevant?

2002

2002

- Gerth StÃ¸lting Brodal, George Lagogiannis, Christos Makris, Athanasios K. Tsakalidis, Kostas Tsichlas
- STOC
- 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

- Gerth StÃ¸lting Brodal
- SODA
- 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

- Sttlting Gerth, Brodal
- 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?