论文信息 - Determining the Mode

Determining the Mode

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’.

David P. Dobkin | J. Ian Munro

[1] Manuel Blum,et al. Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[2] David P. Dobkin,et al. Time and Space Bounds for Selection Problems , 1978, ICALP.

[3] Brian Richard Allen. On binary search trees. , 1978 .

[4] Arnold Schönhage,et al. Finding the Median , 1976, J. Comput. Syst. Sci..

[5] Donald E. Knuth,et al. Sorting and Searching , 1973 .

[6] Frank K. Hwang,et al. A Simple Algorithm for Merging Two Disjoint Linearly-Ordered Sets , 1972, SIAM J. Comput..

[7] J. Ian Munro,et al. Sorting and Searching in Multisets , 1976, SIAM J. Comput..

[8] Vaughan R. Pratt,et al. On Lower Bounds for Computing the i-th Largest Element , 1973, SWAT.