560 search results - page 1 / 112 » Multiplication by a Constant is Sublinear |
ARITH
2007
IEEE
14 years 5 months ago
2007
IEEE
Abstract— This paper explores the use of the double-base number system (DBNS) for constant integer multiplication. The DBNS recoding scheme represents integers – in this case c...
PODC
2010
ACM
14 years 2 months ago
2010
ACM
We study Reader-Writer Exclusion [1], a well-known variant of the Mutual Exclusion problem [2] where processes are divided into two classes–readers and writers–and multiple re...
SODA
2010
ACM
13 years 9 months ago
2010
ACM
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
TC
2008
13 years 10 months ago
2008
We describe algorithms for point multiplication on Koblitz curves using multiple-base expansions of the form k = P
MYCRYPT
2005
Springer
14 years 4 months ago
2005
Springer
In this paper we produce a practical and efficient algorithm to find a decomposition of type n = k i=1 2si 3ti , si, ti ∈ N ∪ {0} with k ≤ c + o(1) ¡ log n log log n ....