Pages that link to "Item:Q2872104"
From MaRDI portal
The following pages link to Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers (Q2872104):
Displaying 9 items.
- Selection from read-only memory and sorting with minimum data movement (Q671520) (← links)
- Selection from read-only memory with limited workspace (Q744087) (← links)
- Frameworks for designing in-place graph algorithms (Q2237887) (← links)
- Finding median in read-only memory on integer input (Q2342680) (← links)
- Rectilinear path problems in restricted memory setup (Q2357163) (← links)
- Memory-Efficient Algorithms for Finding Needles in Haystacks (Q2829215) (← links)
- A Framework for In-place Graph Algorithms (Q5009570) (← links)
- Optimal In-place Algorithms for Basic Graph Problems (Q5041185) (← links)
- Linear-time in-place selection in less than 3n comparisons (Q6487970) (← links)