Splay tree

Known as: Splaying, Dynamic optimality conjecture, Self-adjusting binary search tree 
A splay tree is a self-adjusting binary search tree with the additional property that recently accessed elements are quick to access again. It… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Web personalization helps in understanding the user interests and creating customized experiences for users. However the user… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table II
Is this relevant?
2009
2009
We show that multi-splay trees have most of the properties that splay trees have. Specifically, we show that multi-splay trees… (More)
  • figure 1
  • figure 2
Is this relevant?
2007
2007
In this paper we present new empirical results for splay trees. These results provide a better understanding of how cache… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
2006
2006
Packet classification forms the backbone on which a variety of Internet applications operate, providing QoS, security, monitoring… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
2006
2006
In this thesis, we introduce a new binary search tree data structure called multi-splay tree and prove that multi-splay trees… (More)
  • figure 2.1
  • figure 2.2
  • figure 3.1
  • figure 3.2
  • figure 3.3
Is this relevant?
2002
2002
Splay trees are self-organizing binary search trees that were introduced by Sleator and Tarjan [12]. In this paper we present a… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
1995
Highly Cited
1995
A special case of the Dynamic Finger Conjecture is proved; this special case introduces a number of useful techniques. 
Is this relevant?
1995
1995
We present applications of splay trees to two topics in data compression. First is a variant of the move-to-front (mtf) data… (More)
  • figure 3
  • figure 5
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1988
Highly Cited
1988
The splay-prefix algorithm is one of the simplest and fastest adaptive data compression algorithms based on the use of a prefix… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1985
Highly Cited
1985
The splay tree, a self-adjusting form of binary search tree, is developed and analyzed. The binary search tree is a data… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 6
  • figure 7
Is this relevant?