Splay tree (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Splay tree" in English language version.

Last modified: 22:44:28, 3 June 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

2610doi.org

2^nd place

195semanticscholar.org

15^th place

8^th place

141cmu.edu

2,125^th place

1,347^th place

53psu.edu

299^th place

159^th place

31ugent.be

3,681^st place

3,778^th place

31hdl.handle.net

66^th place

34^th place

11tum.de

6,595^th place

8,480^th place

11acm.org

1,200^th place

821^st place

11researchgate.net

96^th place

89^th place

11umich.edu

429^th place

307^th place

11arxiv.org

49^th place

31^st place

acm.org (Global: 1,200^th place; English: 821^st place)

dl.acm.org

Grinberg et al. (1995). Grinberg, Dennis; Rajagopalan, Sivaramakrishnan; Venkatesan, Ramarathnam; Wei, Victor K. (1995). "Splay trees for data compression". In Clarkson, Kenneth L. (ed.). Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 22–24 January 1995. San Francisco, California, USA. ACM/SIAM. pp. 522–530. Average depth of access in a splay tree is proportional to the entropy.

arxiv.org (Global: 49^th place; English: 31^st place)

Pettie 2008. Pettie, Seth (2008). "Splay Trees, Davenport-Schinzel Sequences, and the Deque Conjecture". Proc. 19th ACM-SIAM Symposium on Discrete Algorithms (PDF). pp. 1115–1124. arXiv:0707.2160.

cmu.edu (Global: 2,125^th place; English: 1,347^th place)

cs.cmu.edu

Sleator & Tarjan 1985. Sleator, Daniel D.; Tarjan, Robert E. (1985). "Self-Adjusting Binary Search Trees" (PDF). Journal of the ACM. 32 (3): 652–686. doi:10.1145/3828.3835. S2CID 1165848.

doi.org (Global: 2^nd place; English: 2^nd place)

Sleator & Tarjan 1985. Sleator, Daniel D.; Tarjan, Robert E. (1985). "Self-Adjusting Binary Search Trees" (PDF). Journal of the ACM. 32 (3): 652–686. doi:10.1145/3828.3835. S2CID 1165848.
Brinkmann, Degraer & De Loof 2009. Brinkmann, Gunnar; Degraer, Jan; De Loof, Karel (January 2009). "Rehabilitation of an unloved child: semi-splaying" (PDF). Software: Practice and Experience. 39 (1): 33–45. CiteSeerX 10.1.1.84.790. doi:10.1002/spe.v39:1. hdl:11382/102133. The results show that semi-splaying, which was introduced in the same paper as splaying, performs better than splaying under almost all possible conditions. This makes semi-splaying a good alternative for all applications where normally splaying would be applied. The reason why splaying became so prominent while semi-splaying is relatively unknown and much less studied is hard to understand. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Albers & Karpinski 2002. Albers, Susanne; Karpinski, Marek (28 February 2002). "Randomized Splay Trees: Theoretical and Experimental Results" (PDF). Information Processing Letters. 81 (4): 213–221. doi:10.1016/s0020-0190(01)00230-7.
Allen & Munro 1978. Allen, Brian; Munro, Ian (October 1978). "Self-organizing binary search trees". Journal of the ACM. 25 (4): 526–535. doi:10.1145/322092.322094. S2CID 15967344.
Cole et al. 2000. Cole, Richard; Mishra, Bud; Schmidt, Jeanette; Siegel, Alan (January 2000). "On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences". SIAM Journal on Computing. 30 (1): 1–43. CiteSeerX 10.1.1.36.4558. doi:10.1137/s0097539797326988. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Cole 2000. Cole, Richard (January 2000). "On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof". SIAM Journal on Computing. 30 (1): 44–85. CiteSeerX 10.1.1.36.2713. doi:10.1137/S009753979732699X. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Tarjan 1985. Tarjan, Robert E. (1985). "Sequential access in splay trees takes linear time". Combinatorica. 5 (4): 367–378. doi:10.1007/BF02579253. S2CID 34757821.
Elmasry 2004. Elmasry, Amr (April 2004). "On the sequential access theorem and Deque conjecture for splay trees". Theoretical Computer Science. 314 (3): 459–466. doi:10.1016/j.tcs.2004.01.019.
Sundar 1992. Sundar, Rajamani (1992). "On the Deque conjecture for the splay algorithm". Combinatorica. 12 (1): 95–124. doi:10.1007/BF01191208. S2CID 27422556.
Bender et al. 2023. Bender, Michael A.; Conway, Alex; Farach-Colton, Martin; Kuszmaul, William; Tagliavini, Guido (2023). "Tiny Pointers". Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). pp. 477–508. doi:10.1137/1.9781611977554.ch21. ISBN 978-1-61197-755-4. S2CID 244709005.

hdl.handle.net (Global: 66^th place; English: 34^th place)

Brinkmann, Degraer & De Loof 2009. Brinkmann, Gunnar; Degraer, Jan; De Loof, Karel (January 2009). "Rehabilitation of an unloved child: semi-splaying" (PDF). Software: Practice and Experience. 39 (1): 33–45. CiteSeerX 10.1.1.84.790. doi:10.1002/spe.v39:1. hdl:11382/102133. The results show that semi-splaying, which was introduced in the same paper as splaying, performs better than splaying under almost all possible conditions. This makes semi-splaying a good alternative for all applications where normally splaying would be applied. The reason why splaying became so prominent while semi-splaying is relatively unknown and much less studied is hard to understand. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)

psu.edu (Global: 299^th place; English: 159^th place)

citeseerx.ist.psu.edu

Brinkmann, Degraer & De Loof 2009. Brinkmann, Gunnar; Degraer, Jan; De Loof, Karel (January 2009). "Rehabilitation of an unloved child: semi-splaying" (PDF). Software: Practice and Experience. 39 (1): 33–45. CiteSeerX 10.1.1.84.790. doi:10.1002/spe.v39:1. hdl:11382/102133. The results show that semi-splaying, which was introduced in the same paper as splaying, performs better than splaying under almost all possible conditions. This makes semi-splaying a good alternative for all applications where normally splaying would be applied. The reason why splaying became so prominent while semi-splaying is relatively unknown and much less studied is hard to understand. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Cole et al. 2000. Cole, Richard; Mishra, Bud; Schmidt, Jeanette; Siegel, Alan (January 2000). "On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences". SIAM Journal on Computing. 30 (1): 1–43. CiteSeerX 10.1.1.36.4558. doi:10.1137/s0097539797326988. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Cole 2000. Cole, Richard (January 2000). "On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof". SIAM Journal on Computing. 30 (1): 44–85. CiteSeerX 10.1.1.36.2713. doi:10.1137/S009753979732699X. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)

researchgate.net (Global: 96^th place; English: 89^th place)

Elmasry 2004. Elmasry, Amr (April 2004). "On the sequential access theorem and Deque conjecture for splay trees". Theoretical Computer Science. 314 (3): 459–466. doi:10.1016/j.tcs.2004.01.019.

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Sleator & Tarjan 1985. Sleator, Daniel D.; Tarjan, Robert E. (1985). "Self-Adjusting Binary Search Trees" (PDF). Journal of the ACM. 32 (3): 652–686. doi:10.1145/3828.3835. S2CID 1165848.
Allen & Munro 1978. Allen, Brian; Munro, Ian (October 1978). "Self-organizing binary search trees". Journal of the ACM. 25 (4): 526–535. doi:10.1145/322092.322094. S2CID 15967344.
Tarjan 1985. Tarjan, Robert E. (1985). "Sequential access in splay trees takes linear time". Combinatorica. 5 (4): 367–378. doi:10.1007/BF02579253. S2CID 34757821.
Sundar 1992. Sundar, Rajamani (1992). "On the Deque conjecture for the splay algorithm". Combinatorica. 12 (1): 95–124. doi:10.1007/BF01191208. S2CID 27422556.
Bender et al. 2023. Bender, Michael A.; Conway, Alex; Farach-Colton, Martin; Kuszmaul, William; Tagliavini, Guido (2023). "Tiny Pointers". Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). pp. 477–508. doi:10.1137/1.9781611977554.ch21. ISBN 978-1-61197-755-4. S2CID 244709005.

tum.de (Global: 6,595^th place; English: 8,480^th place)

www14.in.tum.de

Albers & Karpinski 2002. Albers, Susanne; Karpinski, Marek (28 February 2002). "Randomized Splay Trees: Theoretical and Experimental Results" (PDF). Information Processing Letters. 81 (4): 213–221. doi:10.1016/s0020-0190(01)00230-7.

ugent.be (Global: 3,681^st place; English: 3,778^th place)

caagt.ugent.be

Brinkmann, Degraer & De Loof 2009. Brinkmann, Gunnar; Degraer, Jan; De Loof, Karel (January 2009). "Rehabilitation of an unloved child: semi-splaying" (PDF). Software: Practice and Experience. 39 (1): 33–45. CiteSeerX 10.1.1.84.790. doi:10.1002/spe.v39:1. hdl:11382/102133. The results show that semi-splaying, which was introduced in the same paper as splaying, performs better than splaying under almost all possible conditions. This makes semi-splaying a good alternative for all applications where normally splaying would be applied. The reason why splaying became so prominent while semi-splaying is relatively unknown and much less studied is hard to understand. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)

umich.edu (Global: 429^th place; English: 307^th place)

web.eecs.umich.edu

Pettie 2008. Pettie, Seth (2008). "Splay Trees, Davenport-Schinzel Sequences, and the Deque Conjecture". Proc. 19th ACM-SIAM Symposium on Discrete Algorithms (PDF). pp. 1115–1124. arXiv:0707.2160.

Splay tree (English Wikipedia)

acm.org (Global: 1,200th place; English: 821st place)

dl.acm.org

arxiv.org (Global: 49th place; English: 31st place)

cmu.edu (Global: 2,125th place; English: 1,347th place)

cs.cmu.edu

doi.org (Global: 2nd place; English: 2nd place)

hdl.handle.net (Global: 66th place; English: 34th place)

psu.edu (Global: 299th place; English: 159th place)