
handle: 11572/30445
In this paper, the canonical signed digit (CSD)coding and the generalized non-adjacent form (GNAF)-coding of signed integers are reduced to a prefix computation. Hence, these coding operations. Which seem at first glance strictly sequential, can be optirnally perallelized.
Analysis of Algorithms and Problem Complexity, CSD-coding
Analysis of Algorithms and Problem Complexity, CSD-coding
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
