Stable unmerging in linear time and constant space
From MaRDI portal
Recommendations
- Stable Linear Time Sublinear Space Merging
- Unstable linear time O(1) space merging
- A practically efficient and almost linear unification algorithm
- Asymptotically efficient in-place merging
- Asymptotically efficient in-place merging
- Stable minimum space partitioning in linear time
- Sublinear merging and natural mergesort
- Time-space optimal parallel merging and sorting
- Disjoint stable matchings in linear time
- Strategies for stable merge sorting
Cites work
Cited in
(10)- Stable minimum space partitioning in linear time
- In-place algorithms for computing (Layers of) maxima
- Stable in situ sorting and minimum data movement
- Sorting multisets stably in minimum space
- Selecting distances in the plane
- Sorting multisets stably in minimum space
- An in-place algorithm for Klee's measure problem in two dimensions
- Stable duplicate-key extraction with optimal time and space bounds
- Line-segment intersection made in-place
- scientific article; zbMATH DE number 1437310 (Why is no real title available?)
This page was built for publication: Stable unmerging in linear time and constant space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108017)