Finding modes with equality comparisons

DOI10.1016/j.tcs.2017.09.007zbMath1382.68057OpenAlexW2754950191MaRDI QIDQ1680532

J. Ian Munro, Varukumar Jayapaul, Venkatesh Raman, Srinivas Rao Satti

Publication date: 16 November 2017

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.09.007

zbMATH Keywords

lower boundTurán's theoremDirac's theoremadversary argumentequality comparisonsmode finding

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Combinatorics in computer science (68R05)

Cites Work

• Determining the majority
• Determining the mode
• Finding repeated elements
• On computing majority by comparisons
• Analysis of Boyer and Moore's \texttt{MJRTY} algorithm
• Finding Mode Using Equality Comparisons
• Sorting and Selection with Equality Comparisons
• Compressed Data Structures for Dynamic Sequences
• Sorting and Searching in Multisets
• The Average-Case Complexity of Determining the Majority
• On the Optimality of Some Set Algorithms
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding modes with equality comparisons