Skip to main content

3 Result(s)

within Stephane Durocher Remove this filter Information Storage and Retrieval Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Local Routing in Convex Subdivisions

    In various wireless networking settings, node locations determine a network’s topology, allowing the network to be modelled by a geometric graph drawn in the plane. Without any additional information, local ge...

    Prosenjit Bose, Stephane Durocher… in SOFSEM 2015: Theory and Practice of Comput… (2015)

  2. No Access

    Chapter and Conference Paper

    Top-k Color Queries on Tree Paths

    We present a data structure for the following problem: Given a tree \(\mathcal{T}\) , with each of its nodes assigned a color in a...

    Stephane Durocher, Rahul Shah, Matthew Skala… in String Processing and Information Retrieval (2013)

  3. 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)