Back to Results
First PageMeta Content
Algebra / Mersenne twister / Linear feedback shift register / Time complexity / Matrix multiplication / Horner scheme / Linear algebra / Theoretical computer science / Mathematics / Pseudorandom number generators


A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space ? Hiroshi Haramoto1 , Makoto Matsumoto1 , and Pierre L’Ecuyer2 1 Dept. of Math., Hiroshima University, Hiroshima[removed]JAPAN,
Add to Reading List

Document Date: 2010-03-31 02:27:40


Open Document

File Size: 165,37 KB

Share Result on Facebook

City

Berlin / San Francisco / Spinger-Verlag / Montr´eal / New York / /

Company

NTL / IEEE Press / Cambridge University Press / AMD / Intel / /

Country

Japan / Canada / United Kingdom / /

/

Facility

Hiroshima University / Courant Institute / NTL library / New York University / /

IndustryTerm

parallel computing / matrix-vector product / window algorithm / simulation applications / tricky algorithm / ahead algorithm / simulation software tools / /

Organization

Cambridge University / New York University / New York / Hiroshima University / Hiroshima / Core Duo / Courant Institute / /

Person

George S. Fishman / /

Position

author / Canada Research Chair / Prime Minister / SW PM / /

Product

Fourier / /

ProgrammingLanguage

MATLAB / /

ProvinceOrState

Montana / New York / /

PublishedMedium

Mathematics of Computation / /

RadioStation

Core / /

Technology

cryptography / three algorithms / 64 3800+ processor / Java / 64 3800+ 64-bit processor / Jump Ahead Algorithm / tricky algorithm / jumping-ahead algorithm / simulation / sliding window algorithm / stream cipher / /

URL

http /

SocialTag