Sorting and Searching in Multisets

DOI10.1137/0205001zbMath0324.68018OpenAlexW2075620352MaRDI QIDQ4088267

J. Ian Munro, P. M. Spira

Publication date: 1976

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0205001

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items (21)

Sorting multisets stably in minimum space ⋮ Distribution-sensitive algorithms ⋮ Large alphabets and incompressibility ⋮ Dynamic Shannon coding ⋮ A general lower bound on the I/O-complexity of comparison-based algorithms ⋮ Finding modes with equality comparisons ⋮ On compressing permutations and adaptive sorting ⋮ Determining the mode ⋮ Unnamed Item ⋮ Smooth Heaps and a Dual View of Self-Adjusting Data Structures ⋮ Range Majority in Constant Time and Linear Space ⋮ Stable minimum space partitioning in linear time ⋮ Parameterizing by the number of numbers ⋮ Linear-space data structures for range mode query in arrays ⋮ Tight bounds for online stable sorting ⋮ Sorting streamed multisets ⋮ Sorting multisets stably in minimum space ⋮ Finding Mode Using Equality Comparisons ⋮ From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures ⋮ Array Range Queries ⋮ Probabilistic counting algorithms for data base applications

This page was built for publication: Sorting and Searching in Multisets