Agrawal, D.P. (1975) Arithmetic Algorithms in a Negative Base. IEEE Transactions on Computers, 10, 998-1000.

has been cited by the following article:

• TITLE: Non-Recursive Base Conversion Using a Deterministic Markov Process

  AUTHORS: Louis M. Houston

  KEYWORDS: Base Conversion, Recursion, Euclidean Division, Geometric Series, Markov Process

  JOURNAL NAME: Journal of Applied Mathematics and Physics, Vol.12 No.6, June 21, 2024

  ABSTRACT: We prove that non-recursive base conversion can always be implemented by using a deterministic Markov process. Our paper discusses the pros and cons of recursive and non-recursive methods, in general. And we include a comparison between non-recursion and a deterministic Markov process, proving that the Markov process is twice as efficient.