Determining the mode

DOI10.1016/0304-3975(80)90057-2MaRDI QIDQ1143172zbMATH OpenOpenAlexFDO

Authors David P. Dobkin, J. Ian Munro

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)

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3594653 (Why is no real title available?)
• A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets
• Finding the median
• Self-Organizing Binary Search Trees
• Sorting and Searching in Multisets
• Time bounds for selection

Cited in

(6)

• Tight bounds for online stable sorting
• Array range queries
• Linear-space data structures for range mode query in arrays
• Range Majority in Constant Time and Linear Space
• Finding modes with equality comparisons
• Finding mode using equality comparisons

Describes a project that uses

Uses Software

• Algorithm 489

This page was built for publication: Determining the mode

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1143172)