Determining the mode

DOI10.1016/0304-3975(80)90057-2zbMath0441.68048OpenAlexW1985114981MaRDI QIDQ1143172

J. Ian Munro, David P. Dobkin

Publication date: 1980

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(80)90057-2

zbMATH Keywords

complexity of computing modessorting multisets

Mathematics Subject Classification ID

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

Related Items (6)

Finding modes with equality comparisons ⋮ Range Majority in Constant Time and Linear Space ⋮ Linear-space data structures for range mode query in arrays ⋮ Tight bounds for online stable sorting ⋮ Finding Mode Using Equality Comparisons ⋮ Array Range Queries

Uses Software

• Algorithm 489

Cites Work

• Unnamed Item
• Unnamed Item
• Finding the median
• Time bounds for selection
• Sorting and Searching in Multisets
• Self-Organizing Binary Search Trees
• A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets

This page was built for publication: Determining the mode