Name
Abstract | ||
|---|---|---|
We investigate the number of iterations needed by an addition algorithm due to Burks et al. if the input is random. Several authors have obtained results on the average case behaviour, mainly using analytic techniques based on generating functions. Here we take a more probabilistic view which leads to a limit theorem for the distribution of the random number of steps required by the algorithm and also helps to explain the limiting logarithmic periodicity as a simple discretization phenomenon. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1051/ita:2001115 | RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS |
Keywords | Field | DocType |
carry propagation,limit distributions,total variation distance,logarithmic periodicity,Gumbel distributions,discretization,large deviations | Total variation,Generating function,Discretization,Combinatorics,Stochastic process,Probability distribution,Large deviations theory,Logarithm,Number theory,Mathematics | Journal |
Volume | Issue | ISSN |
35 | 2 | 0988-3754 |
Citations | PageRank | References |
1 | 0.45 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rudolf Grübel | 1 | 15 | 4.71 |
| Anke Reimers | 2 | 1 | 0.45 |