Pages that link to "Item:Q799115"
From MaRDI portal
The following pages link to On the time-space tradeoff for sorting with linear queries (Q799115):
Displaying 9 items.
- A simple proof of a time-space trade-off for sorting with linear comparisons (Q1079376) (← links)
- Two time-space tradeoffs for element distinctness (Q1095660) (← links)
- Upper bounds for time-space trade-offs in sorting and selection (Q1101238) (← links)
- On-line sorting of twisted sequences in linear time (Q1104753) (← links)
- A time-space tradeoff for sorting on non-oblivious machines (Q1152950) (← links)
- Time-space tradeoffs for set operations (Q1210542) (← links)
- Sorting in linear time? (Q1273863) (← links)
- Space-time trade-offs for some ranking and searching queries (Q1603491) (← links)
- Linear-time in-place selection in less than 3n comparisons (Q6487970) (← links)
