Strategies for Stable Merge Sorting

DOI10.1137/1.9781611975482.78zbMath1431.68021arXiv1801.04641OpenAlexW2783319652MaRDI QIDQ5236262

Alexander Knop, Samuel R. Buss

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10)

Related Items (3)

A probabilistic model revealing shortcomings in Lua's hybrid tables ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Strategies for Stable Merge Sorting