Page
%P
![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
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...
-
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...