Pages that link to "Item:Q744087"
From MaRDI portal
The following pages link to Selection from read-only memory with limited workspace (Q744087):
Displaying 11 items.
- Prune-and-search with limited workspace (Q473192) (← links)
- Selection from read-only memory and sorting with minimum data movement (Q671520) (← links)
- Space-efficient Euler partition and bipartite edge coloring (Q1628587) (← links)
- Constant work-space algorithms for facility location problems (Q2192101) (← links)
- Frameworks for designing in-place graph algorithms (Q2237887) (← links)
- Space efficient linear time algorithms for BFS, DFS and applications (Q2322695) (← links)
- Finding median in read-only memory on integer input (Q2342680) (← links)
- Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers (Q2872104) (← links)
- A Framework for In-place Graph Algorithms (Q5009570) (← links)
- Optimal In-place Algorithms for Basic Graph Problems (Q5041185) (← links)
- Improved upper bounds for time-space tradeoffs for selection with limited storage (Q5054849) (← links)