Abstract
The complexity of computing modes and of sorting multisets is considered. Previous lower bounds are improved and an algorithm is given to determine the mode of a multiset in a number of comparisons differing from the lower bound by only a ‘lower order term’.
Original language | English (US) |
---|---|
Pages (from-to) | 255-263 |
Number of pages | 9 |
Journal | Theoretical Computer Science |
Volume | 12 |
Issue number | 3 |
DOIs | |
State | Published - 1980 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- General Computer Science