Pages that link to "Item:Q1920426"

The following pages link to Fast stable in-place sorting with \(O(n)\) data moves (Q1920426):

Displaying 12 items.

• Selection from read-only memory and sorting with minimum data movement (Q671520) (← links)
• Stable in situ sorting and minimum data movement (Q911311) (← links)
• Stable duplicate-key extraction with optimal time and space bounds (Q1103387) (← links)
• Stable minimum space partitioning in linear time (Q1195932) (← links)
• Selection of good algorithms from a family of algorithms for polynomial derivative evaluation (Q1248372) (← links)
• In-place sorting with fewer moves (Q1606923) (← links)
• Sorting stably, in place, with \(O(n \log n)\) comparisons and \(O(n)\) moves (Q2643133) (← links)
• The number of readings of non-equiprobable files under stable sorting (Q3125950) (← links)
• Sorting with minimum data movement (Q4020351) (← links)
• (Q4028918) (← links)
• STACS 2005 (Q5710714) (← links)
• Automata, Languages and Programming (Q5716846) (← links)