Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Integer Representation and Counting in the Bit Probe Model

    We examine the problem of integer representation in near minimal number of bits so that increment and decrement (and indeed addition and subtraction) can be performed using few bit inspections and fewer bit ch...

    M. Ziaur Rahman, J. Ian Munro in Algorithms and Computation (2007)

  2. No Access

    Chapter and Conference Paper

    An Optimal Parallel Algorithm for c-Vertex-Ranking of Trees

    For a positive integer c, a c-vertex-ranking of a graph G = (V, E) is a labeling of the vertices of G with integers such that, for any label i, deletion of all vertices with labels > i leaves connected components...

    Md. Abul Kashem, M. Ziaur Rahman in Algorithms and Computation (2003)