DecreaseKeys are expensive for external memory priority queues

DOI10.1145/3055399.3055437zbMath1369.68170arXiv1611.00911OpenAlexW2546455469MaRDI QIDQ4978049

Huacheng Yu, Kasper Green Larsen, Kasper Eenberg

Publication date: 17 August 2017

Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

lower boundcommunication complexityexternal memorypriority queues

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (1)

Lower Bounds for External Memory Integer Sorting via Network Coding

This page was built for publication: DecreaseKeys are expensive for external memory priority queues