In-place linear probing sort

DOI10.1007/3-540-55210-3_214zbMath1494.68075OpenAlexW1535880852MaRDI QIDQ5096812

Jukka Teuhola, Svante Carlsson, Jyrki Katajainen

Publication date: 18 August 2022

Published in: STACS 92 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55210-3_214

zbMATH Keywords

sortingaverage-case analysisanalysis of algorithmdistributive sorting

Mathematics Subject Classification ID

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

Related Items

In-place calculation of minimum-redundancy codes

Cites Work

• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Sorting numbers in linear expected time and optimal extra space
• The analysis of linear probing sort by the use of a new mathematical transform
• Expected time bounds for selection
• Ordered hash tables
• Internal Sorting by Radix Plus Sifting
• Unnamed Item
• Unnamed Item
• Unnamed Item