Doubly logarithmic tree

<h2 id="further-reading">Further reading</h2>
<ul><li>M. Frigo, C.E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In <i>Proceedings of the 40th IEEE Symposium on Foundations of Computer Science</i> (FOCS 99), p. 285-297. 1999. <a href="https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=814600">Extended abstract at IEEE</a>, <a href="http://citeseer.ist.psu.edu/307799.html">at Citeseer</a>.</li>
<li><a href="/facts/Erik_Demaine/qby54dWx">Demaine, Erik</a>. <a href="http://courses.csail.mit.edu/6.897/spring03/scribe_notes/L17/lecture17.pdf">Review of the Cache-Oblivious Sorting</a>. Notes for MIT Computer Science 6.897: Advanced Data Structures.</li></ul>

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

<ol>
<li id="fn:1"><p>Berkman, Omer; Schieber, Baruch; Vishkin, Uzi (1993), "Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values", Journal of Algorithms, 14 (3): 344–370, CiteSeerX 10.1.1.55.5669, doi:10.1006/jagm.1993.1018 <a href="/wiki/Baruch_Schieber" target="_blank">/wiki/Baruch_Schieber</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>Harald Prokop. Cache-Oblivious Algorithms. Masters thesis, MIT. 1999. <a href="http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.5650" target="_blank">http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.5650</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
</ol>

Doubly logarithmic tree open-in-new

Doubly logarithmic tree