On the public citation graph

Modular SIMD arithmetic in M athemagix

0 signed · 57 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jsco.1996.0125openalex-snapshot
The Magma Algebra System I: The User Language
inferredcites →https://doi.org/10.1007/3-540-47721-7_24openalex-snapshot
Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor
inferredcites →https://doi.org/10.1007/3-540-48329-2_16openalex-snapshot
Comparison of three modular reduction functions
inferredcites →https://doi.org/10.1007/978-3-642-01001-9_28openalex-snapshot
ECM on Graphics Cards
inferredcites →https://doi.org/10.1007/978-3-642-12659-8_28openalex-snapshot
FFT-Based Dense Polynomial Arithmetic on Multi-cores
inferredcites →https://doi.org/10.1007/978-3-642-14623-7openalex-snapshot
Advances in Cryptology – CRYPTO 2010
inferredcites →https://doi.org/10.1007/978-3-642-15582-6openalex-snapshot
Mathematical software--ICMS 2010 : third International Congress on Mathematical Software, Kobe, Japan, September 13-17, 2010 : proceedings
inferredcites →https://doi.org/10.1007/978-3-642-15582-6_16openalex-snapshot
LinBox Founding Scope Allocation, Parallel Building Blocks, and Separate Compilation
inferredcites →https://doi.org/10.1007/978-3-642-15582-6_52openalex-snapshot
Mathemagix: Towards Large Scale Programming for Symbolic and Certified Numeric Computations
inferredcites →https://doi.org/10.1007/978-3-642-16318-0_73openalex-snapshot
Accelerated Modular Multiplication Algorithm of Large Word Length Numbers with a Fixed Module
inferredcites →https://doi.org/10.1007/978-3-642-16324-1_58openalex-snapshot
Accelerated Modular Multiplication Algorithm of Large Word Length Numbers with a Fixed Module
inferredcites →https://doi.org/10.1007/bf02307376openalex-snapshot
Optimal initial approximations for the Newton-Raphson division algorithm
inferredcites →https://doi.org/10.1007/s00200-013-0200-5openalex-snapshot
Polynomial root finding over local rings and application to error correcting codes
inferredcites →https://doi.org/10.1007/s10208-014-9214-zopenalex-snapshot
Degeneracy Loci and Polynomial Equation Solving
inferredcites →https://doi.org/10.1016/j.jsc.2012.06.004openalex-snapshot
On the bit-complexity of sparse polynomial and series multiplication
inferredcites →https://doi.org/10.1016/j.jsc.2013.09.002openalex-snapshot
Faster arithmetic for number-theoretic transforms
inferredcites →https://doi.org/10.1016/j.jsc.2017.11.001openalex-snapshot
On the complexity of integer matrix multiplication
inferredcites →https://doi.org/10.1016/j.tcs.2009.03.014openalex-snapshot
A cache-friendly truncated FFT
inferredcites →https://doi.org/10.1049/ip-cdt:19941291openalex-snapshot
Montgomery reduction with even modulus
inferredcites →https://doi.org/10.1088/1742-6596/385/1/012014openalex-snapshot
Plain Polynomial Arithmetic on GPU
inferredcites →https://doi.org/10.1090/s0025-5718-1971-0301966-0openalex-snapshot
The Fast Fourier Transform in a Finite Field
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777282-xopenalex-snapshot
Modular Multiplication Without Trial Division
inferredcites →https://doi.org/10.1109/40.502403openalex-snapshot
Analyzing and comparing Montgomery multiplication algorithms
inferredcites →https://doi.org/10.1109/arith.1991.145558openalex-snapshot
Integer division using reciprocals
inferredcites →https://doi.org/10.1109/arith.2007.18openalex-snapshot
Fast Modular Reduction
inferredcites →https://doi.org/10.1109/arith.2015.10openalex-snapshot
Faster FFTs in Medium Precision
inferredcites →https://doi.org/10.1109/jproc.2004.840301openalex-snapshot
The Design and Implementation of FFTW3
inferredcites →https://doi.org/10.1109/tc.2010.143openalex-snapshot
Improved Division by Invariant Integers
inferredcites →https://doi.org/10.1112/s1461157014000187openalex-snapshot
Computing Hasse–Witt matrices of hyperelliptic curves in average polynomial time
inferredcites →https://doi.org/10.1137/030601818openalex-snapshot
Accurate Sum and Dot Product
inferredcites →https://doi.org/10.1145/1005285.1005304openalex-snapshot
FFPACK
inferredcites →https://doi.org/10.1145/1005285.1005327openalex-snapshot
The truncated fourier transform and applications
inferredcites →https://doi.org/10.1145/1236463.1236468openalex-snapshot
MPFR
inferredcites →https://doi.org/10.1145/130722.130735openalex-snapshot
Computing A*B (mod N) efficiently in ANSI C
inferredcites →https://doi.org/10.1145/1391989.1391992openalex-snapshot
Dense Linear Algebra over Word-Size Prime Fields
inferredcites →https://doi.org/10.1145/178243.178249openalex-snapshot
Division by invariant integers using multiplication
inferredcites →https://doi.org/10.1145/1837210.1837235openalex-snapshot
Spiral-generated modular FFT algorithms
inferredcites →https://doi.org/10.1145/1837934.1837996openalex-snapshot
An in-place truncated fourier transform and applications to polynomial multiplication
inferredcites →https://doi.org/10.1145/1995896.1995938openalex-snapshot
Automatic SIMD vectorization of fast fourier transforms for the larrabee and AVX instruction sets
inferredcites →https://doi.org/10.1145/2110170.2110180openalex-snapshot
Mathemagix
inferredcites →https://doi.org/10.1145/2465506.2465511openalex-snapshot
Interfacing mathemagix with C++
inferredcites →https://doi.org/10.1145/2608628.2608647openalex-snapshot
Online order basis algorithm and its impact on the block Wiedemann algorithm
inferredcites →https://doi.org/10.1145/2608628.2608661openalex-snapshot
High performance implementation of the TFT
inferredcites →https://doi.org/10.2307/2317055openalex-snapshot
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
inferredcites →https://doi.org/10.5802/jtnb.777openalex-snapshot
Relaxed algorithms for p -adic numbers
inferredcites →https://doi.org/10.5860/choice.37-5723openalex-snapshot
Modern computer algebra

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cpe.6270openalex-snapshot
High‐performance SIMD modular arithmetic for polynomial evaluation
inferred← citeshttps://doi.org/10.1002/cpe.7882openalex-snapshot
Vectorizing and distributing number‐theoretic transform to count Goldbach partitions on Arm‐based supercomputers
inferred← citeshttps://doi.org/10.1007/978-3-319-72453-9_7openalex-snapshot
Fast Chinese Remaindering in Practice
inferred← citeshttps://doi.org/10.1007/978-981-96-1542-1_12openalex-snapshot
Parallel Implementation of Number-Theoretic Transform on GPU Clusters
inferred← citeshttps://doi.org/10.1016/j.jsc.2018.04.017openalex-snapshot
On the complexity of the Lickteig–Roy subresultant algorithm
inferred← citeshttps://doi.org/10.1109/tetc.2025.3582551openalex-snapshot
Improved Modular Multiplication Algorithms Using Solely IEEE 754 Binary Floating-Point Operations
inferred← citeshttps://doi.org/10.1145/3145573openalex-snapshot
Simultaneous Conversions with the Residue Number System Using Linear Algebra
inferred← citeshttps://doi.org/10.1145/3457341.3457342openalex-snapshot
Computing one billion roots using the tangent Graeffe method
inferred← citeshttps://doi.org/10.1145/3474366.3486926openalex-snapshot
Intel HEXL
inferred← citeshttps://doi.org/10.1145/3614408.3614411openalex-snapshot
Modular Matrix Multiplication on GPU for Polynomial System Solving
inferred← citeshttps://doi.org/10.48550/arxiv.2103.16400openalex-snapshot
Intel HEXL: Accelerating Homomorphic Encryption with Intel AVX512-IFMA52
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.