Sorting and Searching in Multisets
From MaRDI portal
Publication:4088267
DOI10.1137/0205001zbMath0324.68018MaRDI QIDQ4088267
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
68Q25: Analysis of algorithms and problem complexity
68W30: Symbolic computation and algebraic computation
68N01: General topics in the theory of software
68W99: Algorithms in computer science
Related Items
Unnamed Item, Sorting multisets stably in minimum space, Distribution-sensitive algorithms, A general lower bound on the I/O-complexity of comparison-based algorithms, Smooth Heaps and a Dual View of Self-Adjusting Data Structures, On compressing permutations and adaptive sorting, Tight bounds for online stable sorting, Parameterizing by the number of numbers, Large alphabets and incompressibility, Dynamic Shannon coding, Sorting streamed multisets, Probabilistic counting algorithms for data base applications, Determining the mode, Stable minimum space partitioning in linear time, Sorting multisets stably in minimum space, Finding modes with equality comparisons, Linear-space data structures for range mode query in arrays, Finding Mode Using Equality Comparisons, From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures, Array Range Queries, Range Majority in Constant Time and Linear Space