Stable minimum space partitioning in linear time

DOI10.1007/BF01994842zbMath0756.68025MaRDI QIDQ1195932

Jyrki Katajainen, Tomi A. Pasanen

Publication date: 26 January 1993

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

stable \(0-1\) sorting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (9)

Sorting multisets stably in minimum space ⋮ In-place algorithms for computing (Layers of) maxima ⋮ Line-segment intersection made in-place ⋮ Space-efficient planar convex hull algorithms ⋮ Space-efficient geometric divide-and-conquer algorithms ⋮ Variations of largest rectangle recognition amidst a bichromatic point set ⋮ Convex-hull algorithms: implementation, testing, and experimentation ⋮ Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time ⋮ Sorting multisets stably in minimum space

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stable in situ sorting and minimum data movement
• A generalized, one-way, stackless quicksort
• Stable unmerging in linear time and constant space
• Quicksort for Equal Keys
• Sorting and Searching in Multisets

This page was built for publication: Stable minimum space partitioning in linear time