Sciweavers

560 search results - page 1 / 112
» Multiplication by a Constant is Sublinear
Sort
View
ARITH
2007
IEEE
14 years 5 months ago
Multiplication by a Constant is Sublinear
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...
Vassil S. Dimitrov, Laurent Imbert, Andrew Zakaluz...
PODC
2010
ACM
14 years 2 months ago
Constant RMR solutions to reader writer synchronization
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...
Vibhor Bhatt, Prasad Jayanti
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
13 years 9 months ago
Near-Optimal Sublinear Time Algorithms for Ulam Distance
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...
Alexandr Andoni, Huy L. Nguyen
TC
2008
13 years 10 months ago
Provably Sublinear Point Multiplication on Koblitz Curves and Its Hardware Implementation
We describe algorithms for point multiplication on Koblitz curves using multiple-base expansions of the form k = P
V. S. Dimitrov, Kimmo U. Järvinen, M. J. Jaco...
MYCRYPT
2005
Springer
189views Cryptology» more  MYCRYPT 2005»
14 years 4 months ago
An Analysis of Double Base Number Systems and a Sublinear Scalar Multiplication Algorithm
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 ....
Mathieu Ciet, Francesco Sica