Finger search tree

<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Finger_search/X0z9SxyW">Finger search</a></li>
<li><a href="/facts/Finger_tree/XkeWM77c">Finger tree</a></li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>Guibas, L.J. (1977). "A new representation for linear lists". Proceedings of the ninth annual ACM symposium on Theory of computing - STOC '77. pp. 49–60. CiteSeerX 10.1.1.527.7294. doi:10.1145/800105.803395. S2CID 2414154. <a href="/wiki/CiteSeerX_(identifier)" target="_blank">/wiki/CiteSeerX_(identifier)</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>Huddleston; Mehlhorn, Kurt (1982). "A New Data Structure for Representing Sorted Lists". Acta Informatica. 17 (2): 157–184. doi:10.1007/BF00288968. S2CID 10397918. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
<li id="fn:3"><p>Tsakalidis, Athanasios K. (1985). "AVL-Trees for Localized Search". Information and Control. 67 (1–3): 173–194. doi:10.1016/S0019-9958(85)80034-6. <a href="https://doi.org/10.1016%2FS0019-9958%2885%2980034-6" target="_blank">https://doi.org/10.1016%2FS0019-9958%2885%2980034-6</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li>
<li id="fn:4"><p>Brodal, Gerth Stølting (2005). "11. Finger Search" (PDF). In Mehta, Dinesh P.; Sahni, Sartaj (eds.). Handbook of Data Structures and Applications. Chapman & Hall / CRC Press. ISBN 978-1584884354. Retrieved 1 January 2013. <a href="978-1584884354" target="_blank">978-1584884354</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li>
<li id="fn:5"><p>Seidel, R.; Aragon, C.R. (1996). "Randomized search trees". Algorithmica. 16 (4–5): 464–497. CiteSeerX 10.1.1.122.6185. doi:10.1007/BF01940876. S2CID 9370259. <a href="/wiki/Raimund_Seidel" target="_blank">/wiki/Raimund_Seidel</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li>
<li id="fn:6"><p>Tsakalidis, Athanasios K. (1985). "AVL-Trees for Localized Search". Information and Control. 67 (1–3): 173–194. doi:10.1016/S0019-9958(85)80034-6. <a href="https://doi.org/10.1016%2FS0019-9958%2885%2980034-6" target="_blank">https://doi.org/10.1016%2FS0019-9958%2885%2980034-6</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li>
<li id="fn:7"><p>Seidel, R.; Aragon, C.R. (1996). "Randomized search trees". Algorithmica. 16 (4–5): 464–497. CiteSeerX 10.1.1.122.6185. doi:10.1007/BF01940876. S2CID 9370259. <a href="/wiki/Raimund_Seidel" target="_blank">/wiki/Raimund_Seidel</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li>
<li id="fn:8"><p>Brodal, Gerth Stølting (2005). "11. Finger Search" (PDF). In Mehta, Dinesh P.; Sahni, Sartaj (eds.). Handbook of Data Structures and Applications. Chapman & Hall / CRC Press. ISBN 978-1584884354. Retrieved 1 January 2013. <a href="978-1584884354" target="_blank">978-1584884354</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li>
</ol>

Finger search tree open-in-new

Finger search tree