1. Introduction 2. Sequential Boyer-Moore algorithm 3. Distributed majority voting algorithm Multi-processing Multi-Threading Complexity analysis for distributed version 4. Benchmark 5. Summary 1. Introduction The original majority voting problem is to find the element that appears more than half times in a given array, and if there is no such majority element, algorithm should just return empty result.