A Linear Time Algorithm for Ordered Partition
From MaRDI portal
Recommendations
- A linear time algorithm for graph partition problems
- scientific article; zbMATH DE number 1559404
- scientific article; zbMATH DE number 3908442
- scientific article; zbMATH DE number 3883625
- Generic top-down discrimination for sorting and partitioning in linear time
- Partitioning of sequentially ordered systems using linear programming
- Partitioning arrangements of lines. I: An efficient deterministic algorithm
- scientific article; zbMATH DE number 626017
- A linear partitioning algorithm for hybrid Lyndons using \(V\)-order
Cites work
- A Reliable Randomized Algorithm for the Closest-Pair Problem
- Conservative algorithms for parallel and sequential integer sorting
- Deterministic sorting in O(nloglogn) time and linear space
- Expected linear time sorting for word size \(\Omega (\log ^{2} n \log\log n)\)
- Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs
- Priority queues: small, monotone and trans-dichotomous
- Sorting in linear time?
- Time bounds for selection
- Upper bounds for sorting integers on random access machines
Cited in
(4)
This page was built for publication: A Linear Time Algorithm for Ordered Partition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452555)