@InProceedings{dorfman_et_al:LIPIcs.ESA.2018.24,
author = {Dorfman, Dani and Kaplan, Haim and Kozma, L\'{a}szl\'{o} and Pettie, Seth and Zwick, Uri},
title = {{Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {24:1--24:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.24},
URN = {urn:nbn:de:0030-drops-94879},
doi = {10.4230/LIPIcs.ESA.2018.24},
annote = {Keywords: data structure, priority queue, pairing heap, binary search tree}
}