Pages that link to "Item:Q1165006"
From MaRDI portal
The following pages link to Smoothsort, an alternative for sorting in situ (Q1165006):
Displaying 12 items.
- A note on adaptive parallel sorting (Q582114) (← links)
- Space-efficient planar convex hull algorithms (Q596137) (← links)
- Opportunistic algorithms for eliminating supersets (Q758205) (← links)
- On partitions and presortedness of sequences (Q808689) (← links)
- An introduction to three algorithms for sorting in situ (Q1167544) (← links)
- An optimal parallel adaptive sorting algorithm (Q1182099) (← links)
- Exploiting few inversions when sorting: Sequential and parallel algorithms (Q1365941) (← links)
- Smoothsort's behavior on presorted sequences (Q1836983) (← links)
- A framework for adaptive sorting (Q1891925) (← links)
- Context-free languages can be accepted with absolutely no space overhead (Q2581536) (← links)
- Computing and ranking measures of presortedness (Q4323402) (← links)
- Polynomials whose coefficients are generalized Leonardo numbers (Q6550103) (← links)
