scientific article; zbMATH DE number 177571

MaRDI QIDQ4037442zbMATH OpenFDO

Authors J. Ian Munro, Venkatesh Raman

Publication date 18 May 1993

zbMATH Keywords

heapsortin-place algorithmsmultisets

Mathematics Subject Classification ID

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

Recommendations

• Sorting multisets stably in minimum space
• Sorting multisets stably in minimum space
• Automata, Languages and Programming
• Sorting streamed multisets
• Sorting by multi-cut rearrangements
• Sorting algorithms for the implementation of a generalized vector product
• Fast and Robust Vectorized In-Place Sorting of Primitive Types
• Multi-sorted residuation
• An optimal parallel algorithm for sorting multisets
• A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset

Cited in

(14)

• Stable minimum space partitioning in linear time
• Sorting multisets stably in minimum space
• A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset
• scientific article; zbMATH DE number 5630647 (Why is no real title available?)
• scientific article; zbMATH DE number 4110087 (Why is no real title available?)
• On demand string sorting over unbounded alphabets
• Sorting Multidimensional Types: Theory and Application
• Distribution-sensitive algorithms
• Sorting multisets stably in minimum space
• A general lower bound on the I/O-complexity of comparison-based algorithms
• Algorithms – ESA 2005
• Tight bounds for online stable sorting
• Automata, Languages and Programming
• Sorting streamed multisets

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037442)