Pages that link to "Item:Q671520"
From MaRDI portal
The following pages link to Selection from read-only memory and sorting with minimum data movement (Q671520):
Displaying 29 items.
- Reprint of: Memory-constrained algorithms for simple polygons (Q390167) (← links)
- Computing a visibility polygon using few variables (Q396475) (← links)
- Prune-and-search with limited workspace (Q473192) (← links)
- Space-time trade-offs for stack-based algorithms (Q494797) (← links)
- Selection from read-only memory with limited workspace (Q744087) (← links)
- Strictly in-place algorithms for permuting and inverting permutations (Q832874) (← links)
- Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\) (Q906384) (← links)
- Time-space trade-offs for triangulations and Voronoi diagrams (Q1615777) (← links)
- Approximation in (Poly-) logarithmic space (Q2037114) (← links)
- Constant work-space algorithms for facility location problems (Q2192101) (← links)
- Frameworks for designing in-place graph algorithms (Q2237887) (← links)
- A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon (Q2272372) (← links)
- Space efficient linear time algorithms for BFS, DFS and applications (Q2322695) (← links)
- Finding median in read-only memory on integer input (Q2342680) (← links)
- Computing the Burrows-Wheeler transform in place and in small space (Q2343299) (← links)
- Rectilinear path problems in restricted memory setup (Q2357163) (← links)
- Memory-constrained algorithms for simple polygons (Q2391542) (← links)
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) (← links)
- Sublinear-space approximation algorithms for Max \(r\)-SAT (Q2695279) (← links)
- Improved Space Efficient Algorithms for BFS, DFS and Applications (Q2817855) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon (Q2980918) (← links)
- In-Place Sorting (Q3075523) (← links)
- Finding the Median (Obliviously) with Bounded Space (Q3448777) (← links)
- Time-Space Trade-offs for Triangulations and Voronoi Diagrams (Q3449845) (← links)
- A Framework for In-place Graph Algorithms (Q5009570) (← links)
- Improved upper bounds for time-space tradeoffs for selection with limited storage (Q5054849) (← links)
- Approximation in (Poly-) Logarithmic Space (Q5089177) (← links)
- Asymptotically efficient in-place merging (Q5915346) (← links)
