将堆与无成本合并配对
Pairing Heaps with Costless Meld
摘要：
改进\cite{elm0}中的结构和分析，我们给出了配对堆的变体，该变体具有摊销的每合并成本为零（与\cite{elm0}中的$O(\log \log{n})$相比），并且对于所有其他操作具有相同的摊销界限。更准确地说，新的配对堆要求：每个meld没有成本，每个find-min和insert的O（1），每个delete-min的$O(\log{n})$，以及每个decrease-key的$O(\log\log{n})$。这些边界是任何自调整堆中最著名的，并且与Fredman证明的此类堆族的下限相匹配。此外，我们所做的更改使我们的结构比\cite{elm0}中的结构更简单。
英文摘要：
Improving the structure and analysis in \cite{elm0}, we give a variation of the pairing heaps that has amortized zero cost per meld (compared to an $O(\log \log{n})$ in \cite{elm0}) and the same amortized bounds for all other operations. More precisely, the new pairing heap requires: no cost per meld, O(1) per find-min and insert, $O(\log{n})$ per delete-min, and $O(\log\log{n})$ per decrease-key. These bounds are the best known for any self-adjusting heap, and match the lower bound proved by Fredman for a family of such heaps. Moreover, the changes we have done make our structure even simpler than that in \cite{elm0}.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
