A Back-to-Basics Empirical Study of Priority Queues

DOI10.1137/1.9781611973198.7zbMath1430.68050arXiv1403.0252OpenAlexW4205160467WikidataQ56210998 ScholiaQ56210998MaRDI QIDQ5232492

Siddhartha Sen, Daniel H. Larkin, Robert Endre Tarjan

Publication date: 12 September 2019

Published in: 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.0252

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (4)

Unnamed Item ⋮ Smooth Heaps and a Dual View of Self-Adjusting Data Structures ⋮ Pairing heaps: the forward variant. ⋮ Regarding Goal Bounding and Jump Point Search

This page was built for publication: A Back-to-Basics Empirical Study of Priority Queues