Sciweavers

6897 search results - page 36 / 1380
» Parallelization of Modular Algorithms
Sort
View
99
Voted
CORR
2008
Springer
111views Education» more  CORR 2008»
15 years 2 months ago
Fast Integer Multiplication using Modular Arithmetic
We give an O(N
Anindya De, Piyush P. Kurur, Chandan Saha, Rampras...
ICS
2011
Tsinghua U.
14 years 5 months ago
Scalable fine-grained call path tracing
Applications must scale well to make efficient use of even medium-scale parallel systems. Because scaling problems are often difficult to diagnose, there is a critical need for sc...
Nathan R. Tallent, John M. Mellor-Crummey, Michael...
IPL
1998
177views more  IPL 1998»
15 years 1 months ago
A Common-Multiplicand Method to the Montgomery Algorithm for Speeding up Exponentiation
A common-multiplicand method to the Montgomery algorithm makes an improvement in speed when the right-to-left binary exponentiation is applied. The idea is that the same common pa...
JaeCheol Ha, Sang-Jae Moon
ANTS
2000
Springer
117views Algorithms» more  ANTS 2000»
15 years 6 months ago
Modular Forms for GL(3) and Galois Representations
Abstract. A description and an example are given of numerical experiments which look for a relation between modular forms for certain congruence subgroups of SL(3, ZZ) and Galois r...
Bert van Geemen, Jaap Top
126
Voted
SAS
2004
Springer
132views Formal Methods» more  SAS 2004»
15 years 7 months ago
Modular and Constraint-Based Information Flow Inference for an Object-Oriented Language
Abstract. This paper addresses the problem of checking programs written in an object-oriented language to ensure that they satisfy the information flow policies, confidentiality ...
Qi Sun, Anindya Banerjee, David A. Naumann