스플레이 트리
출처

Afek, Yehuda; Kaplan, Haim; Korenfeld, Boris; Morrison, Adam; Tarjan, Robert E. (2014). “The CB tree: a practical concurrent self-adjusting search tree”. 《Distributed Computing》 27 (6): 393–417. doi:10.1007/s00446-014-0229-0.
Albers, Susanne; Karpinski, Marek (2002년 2월 28일). “Randomized Splay Trees: Theoretical and Experimental Results” (PDF). 《Information Processing Letters》 81 (4): 213–221. doi:10.1016/s0020-0190(01)00230-7.
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.
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.
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.
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.
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.
Goodrich, Michael; Tamassia, Roberto; Goldwasser, Michael (2014). 《Data Structures and Algorithms in Java》 (영어) 6판. Wiley. 506쪽. ISBN 978-1-118-77133-4.
Grinberg, Dennis; Rajagopalan, Sivaramakrishnan; Venkatesan, Ramarathnam; Wei, Victor K. (1995). 〈Splay trees for data compression〉.   Clarkson, Kenneth L. 《Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 22–24 January 1995. San Francisco, California, USA》. ACM/SIAM. 522–530쪽. Average depth of access in a splay tree is proportional to the entropy.
Knuth, Donald (1997). 《The Art of Computer Programming》. 3: Sorting and Searching 3판. Addison-Wesley. 478쪽. ISBN 0-201-89685-0. The time needed to access data in a splay tree is known to be at most a small constant multiple of the access time of a statically optimum tree, when amortized over any series of operations.
Lucas, Joan M. (1991). 〈On the Competitiveness of Splay Trees: Relations to the Union-Find Problem〉. 《On-line Algorithms: Proceedings of a DIMACS Workshop, February 11–13, 1991》. Series in Discrete Mathematics and Theoretical Computer Science 7. Center for Discrete Mathematics and Theoretical Computer Science. 95–124쪽. ISBN 0-8218-7111-0.
Pettie, Seth (2008). 《Splay Trees, Davenport-Schinzel Sequences, and the Deque Conjecture》 (PDF). 《Proc. 19th ACM-SIAM Symposium on Discrete Algorithms》 0707. 1115–1124쪽. arXiv:0707.2160. Bibcode:2007arXiv0707.2160P.
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.
Sundar, Rajamani (1992). “On the Deque conjecture for the splay algorithm”. 《Combinatorica》 12 (1): 95–124. doi:10.1007/BF01191208. S2CID 27422556.
Tarjan, Robert E. (1985). “Sequential access in splay trees takes linear time”. 《Combinatorica》 5 (4): 367–378. doi:10.1007/BF02579253. S2CID 34757821.
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)》: 477–508. doi:10.1137/1.9781611977554.ch21. ISBN 978-1-61197-755-4. S2CID 244709005.