Finding mode using equality comparisons

DOI10.1007/978-3-319-30139-6_28zbMATH Open1475.68216OpenAlexW2468848154MaRDI QIDQ2803838FDOQ2803838

Authors: Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti 

Publication date: 3 May 2016

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-30139-6_28

Recommendations

• Finding modes with equality comparisons
• Sorting and selection with equality comparisons
• Distributed computation of the mode
• On computing majority by comparisons
• Algorithms – ESA 2005

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Analysis of algorithms (68W40)

Cites Work

• Title not available (Why is that?)
• Finding repeated elements
• On computing majority by comparisons
• Determining the majority
• Time bounds for selection
• Sorting and Searching in Multisets
• Determining the mode
• The Average-Case Complexity of Determining the Majority
• On the Optimality of Some Set Algorithms
• Analysis of Boyer and Moore's \texttt{MJRTY} algorithm
• Sorting and selection with equality comparisons

Cited In (4)

• Distributed computation of the mode
• Algorithms – ESA 2005
• Finding modes with equality comparisons
• Sorting and selection with equality comparisons

This page was built for publication: Finding mode using equality comparisons

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