Selection from read-only memory and sorting with minimum data movement
From MaRDI portal
(Redirected from Publication:671520)
Recommendations
- Selection from read-only memory with limited workspace
- Selection from read-only memory with limited workspace
- Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers
- Publication:4028918
- Sorting with minimum data movement
- Stable in situ sorting and minimum data movement
- Sorting and searching in the presence of memory faults (without redundancy)
- Selection in the presence of memory faults, with applications to in-place resilient sorting
Cites work
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3548141 (Why is no real title available?)
- scientific article; zbMATH DE number 910857 (Why is no real title available?)
- scientific article; zbMATH DE number 3405492 (Why is no real title available?)
- Expected time bounds for selection
- Fast stable in-place sorting with \(O(n)\) data moves
- Finding the median
- Selection and sorting with limited storage
- Sorting with minimum data movement
- Time bounds for selection
- Upper bounds for time-space trade-offs in sorting and selection
Cited in
(39)- Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers
- Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array?
- Asymptotically efficient in-place merging
- Selection and sorting in the ``restore model
- Finding the Median (Obliviously) with Bounded Space
- Selection from read-only memory with limited workspace
- A framework for in-place graph algorithms
- Space-time trade-offs for stack-based algorithms
- Selection from read-only memory with limited workspace
- scientific article; zbMATH DE number 140497 (Why is no real title available?)
- Selection and sorting in the ``restore model
- Strictly in-place algorithms for permuting and inverting permutations
- Stable in situ sorting and minimum data movement
- Sublinear-space approximation algorithms for Max \(r\)-SAT
- Time-space trade-off for finding the \(k\)-visibility region of a point in a polygon
- Improved space efficient algorithms for BFS, DFS and applications
- Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\)
- Space efficient linear time algorithms for BFS, DFS and applications
- Computing a visibility polygon using few variables
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits
- Linear-time in-place selection with \(\varepsilon \cdot n\) element moves
- Memory-constrained algorithms for simple polygons
- Time-space trade-offs for triangulations and Voronoi diagrams
- Time-space trade-offs for triangulations and Voronoi diagrams
- A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon
- Approximation in (Poly-) Logarithmic Space
- Constant work-space algorithms for facility location problems
- Rectilinear path problems in restricted memory setup
- Frameworks for designing in-place graph algorithms
- Improved upper bounds for time-space tradeoffs for selection with limited storage
- Computing the Burrows-Wheeler transform in place and in small space
- Computing (and Life) Is All about Tradeoffs
- In-place sorting
- Approximation in (poly-) logarithmic space
- Reprint of: Memory-constrained algorithms for simple polygons
- A refinement of replacement selection
- Finding median in read-only memory on integer input
- Prune-and-search with limited workspace
- Sorting with minimum data movement
This page was built for publication: Selection from read-only memory and sorting with minimum data movement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671520)
