Addition Machines

DOI10.1137/0219022zbMath0697.68057OpenAlexW2914836451MaRDI QIDQ3474894

Robert W. Floyd, Donald E. Knuth

Publication date: 1990

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/f1b9406551cfae2e453823ea7659e68b0910a645

zbMATH Keywords

Fibonacci numberslower boundsadditionexponentiationgcdsubtraction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (11)

Carryless addition ⋮ Fibonacci linear forms and parallel arithmetic algorithms for large numbers ⋮ A computation model with automatic functions and relations as primitive operations ⋮ Addition machines, automatic functions and open problems of Floyd and Knuth ⋮ Alternating automatic register machines ⋮ Parallel methods of representing multidigit numbers in numeral systems for testing multidigit arithmetic operations ⋮ Trusted computing with addition machines. II ⋮ Trusted computing with addition machines. I ⋮ Fibonacci hypercube ⋮ Fast direct computation of modular reduction ⋮ Calculating the sum of multidigit values in a parallel computational model

This page was built for publication: Addition Machines