Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Range Majority in Constant Time and Linear Space

    Given an array A of size n, we consider the problem of answering range majority queries: given a query range [i..j] where 1 ≤ i ≤ j ≤ n, return the majority element of the subarray A[i..j] if it exists. We descri...

    Stephane Durocher, Meng He, J. Ian Munro in Automata, Languages and Programming (2011)