@InProceedings{dorfman_et_al:LIPIcs.MFCS.2018.13,
author = {Dorfman, Dani and Kaplan, Haim and Kozma, L\'{a}szl\'{o} and Zwick, Uri},
title = {{Pairing heaps: the forward variant}},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)},
pages = {13:1--13:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-086-6},
ISSN = {1868-8969},
year = {2018},
volume = {117},
editor = {Potapov, Igor and Spirakis, Paul and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.13},
URN = {urn:nbn:de:0030-drops-95956},
doi = {10.4230/LIPIcs.MFCS.2018.13},
annote = {Keywords: data structure, priority queue, pairing heap}
}