Trans-Dichotomous Algorithms without Multiplication - some Upper and
Lower Bounds
Andrej Brodnik May 1997 |
Abstract:We show that on a RAM with addition, subtraction, bitwise
Boolean operations and shifts, but no multiplication, there is a
trans-dichotomous solution to the static dictionary problem using linear
space and with query time Available as PostScript, PDF, DVI. |