</span>. </span><span class="publisher"><span class="publishername">
Addison-Wesley Publishing Company
. </span></span></p></div><div class="biblioentry"><a id="biblio.kt99fat_heaps"></a><p>[biblio.kt99fat_heaps] <span class="title"><em>
- <a class="link" href="https://www.cs.princeton.edu/research/techreps/TR-597-99" target="_top">
+ <a class="link" href="https://www.cs.princeton.edu/research/techreps/293" target="_top">
New Heap Data Structures
</a>
</em>. </span><span class="date">
</span>. </span><span class="publisher"><span class="publishername">
Addison-Wesley Publishing Company
. </span></span></p></div><div class="biblioentry"><a id="biblio.nelson96stlpq"></a><p>[biblio.nelson96stlpq] <span class="title"><em>
- <a class="link" href="https://marknelson.us/posts/1996/01/01/priority-queues.html" target="_top">Priority Queues and the STL
+ <a class="link" href="https://web.archive.org/web/20240806213010/https://marknelson.us/posts/1996/01/01/priority-queues.html" target="_top">Priority Queues and the STL
</a>
</em>. </span><span class="date">
January 1996
<biblioentry xml:id="biblio.kt99fat_heaps">
<title>
<link xmlns:xlink="http://www.w3.org/1999/xlink"
- xlink:href="https://www.cs.princeton.edu/research/techreps/TR-597-99">
+ xlink:href="https://www.cs.princeton.edu/research/techreps/293">
New Heap Data Structures
</link>
</title>
<biblioentry xml:id="biblio.nelson96stlpq">
<title>
<link xmlns:xlink="http://www.w3.org/1999/xlink"
- xlink:href="https://marknelson.us/posts/1996/01/01/priority-queues.html">Priority Queues and the STL
+ xlink:href="https://web.archive.org/web/20240806213010/https://marknelson.us/posts/1996/01/01/priority-queues.html">Priority Queues and the STL
</link>
</title>
<date>