On the number of iterations required by Von Neumann addition

DOI10.1051/ita:2001115zbMath1053.68051OpenAlexW2144429968MaRDI QIDQ2771496

Anke Reimers, Rudolf Grübel

Publication date: 2001

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2001__35_2_187_0

zbMATH Keywords

multiprecision arithmetic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity and performance of numerical algorithms (65Y20)

Related Items (4)

Cumulative record times in a Poisson process ⋮ Carry propagation in signed digit representations ⋮ On the multiplicity of the maximum in a discrete random sample ⋮ Renewals for exponentially increasing lifetimes, with an application to digital search trees

Uses Software

• ARIBAS

Cites Work

• Mellin transforms and asymptotics: Harmonic sums
• Die mittlere Additionsdauer eines Paralleladdierwerks
• A stochastically quasi-optimal search algorithm for the maximum of the simple random walk
• A limiting distribution for quicksort
• Large Deviations for Quicksort
• On the median-of-k version of Hoare's selection algorithm
• Hoare's Selection Algorithm: A Markov Chain Approach
• Asymptotic distribution theory for Hoare's selection algorithm
• A limit theorem for “quicksort”
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of iterations required by Von Neumann addition