Space complexity in on-line computation

Abstract

AbstractA technique is developed for determining space complexity in on-line computation. It is shown that each of the following functions requires linear space: (i) the conversion of binary numbers into ternary numbers, (ii) the multiplication of integers and (iii) the translation of arithmetic expressions in infix notation into Polish notation