Constant-time sorting

DOI10.1016/j.ic.2014.01.017zbMath1360.68391OpenAlexW2049494072MaRDI QIDQ2252525

Michael Brand

Publication date: 18 July 2014

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2014.01.017

zbMATH Keywords

sortingarithmetic complexityrandom access machine

Mathematics Subject Classification ID

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

Related Items (1)

P-RAM vs. RP-RAM

Cites Work

• Upper bounds for sorting integers on random access machines
• Division in idealized unit cost RAMs
• On the power of the shift instruction
• Does indirect addressing matter?
• Lower Bounds for Sorting with Realistic Instruction Sets
• Deterministic sorting in O(nloglogn) time and linear space
• Computing with and without Arbitrary Large Numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Constant-time sorting