Selection and sorting in the ``restore model
From MaRDI portal
Publication:5384036
Recommendations
Cited in
(10)- A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon
- Frameworks for designing in-place graph algorithms
- A framework for in-place graph algorithms
- scientific article; zbMATH DE number 6874634 (Why is no real title available?)
- Selection and sorting in the ``restore model
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits
- 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
- Optimal in-place suffix sorting
- Selection from read-only memory with limited workspace
This page was built for publication: Selection and sorting in the ``restore model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384036)