On the public citation graph
On fast multiplication of polynomials over arbitrary algebras
0 signed · 349 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-08921-7_72openalex-snapshot
Multiplicative complexity of a pair of bilinear forms and of the polynomial multiplication
inferredcites →https://doi.org/10.1007/bf00289470openalex-snapshot
Schnelle Multiplikation von Polynomen �ber K�rpern der Charakteristik 2
inferredcites →https://doi.org/10.1007/bf02242355openalex-snapshot
Schnelle Multiplikation großer Zahlen
inferredcites →https://doi.org/10.1016/0097-3165(89)90020-4openalex-snapshot
On arithmetical algorithms over finite fields
inferredcites →https://doi.org/10.1016/0196-6774(88)90010-7openalex-snapshot
An algorithm for polynomial multiplication that does not depend on the ring constants
inferredcites →https://doi.org/10.1016/0304-3975(83)90108-1openalex-snapshot
On the complexity of multiplication in finite fields
inferredcites →https://doi.org/10.1016/0885-064x(88)90012-xopenalex-snapshot
Algebraic complexities and algebraic curves over finite fields
inferredcites →https://doi.org/10.1090/s0002-9939-1970-0251010-xopenalex-snapshot
Resultants of Cyclotomic Polynomials
inferredcites →https://doi.org/10.1109/tassp.1980.1163372openalex-snapshot
Fast polynomial transform algorithms for digital convolution
inferredcites →https://doi.org/10.1137/1.9781611970364openalex-snapshot
Arithmetic Complexity of Computations
inferredcites →https://doi.org/10.1145/42267.45069openalex-snapshot
Greatest common divisors of polynomials given by straight-line programs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.10011openalex-snapshot
Analysis of Rabin's irreducibility test for polynomials over finite fields
inferred← citeshttps://doi.org/10.1006/ffta.1999.0267openalex-snapshot
New Techniques for the Computation of Linear Recurrence Coefficients
inferred← citeshttps://doi.org/10.1006/jagm.2000.1091openalex-snapshot
Computing Jacobi Symbols modulo Sparse Integers and Polynomials and Some Applications
inferred← citeshttps://doi.org/10.1006/jcss.2000.1740openalex-snapshot
Parallel Output-Sensitive Algorithms for Combinatorial and Linear Algebra Problems
inferred← citeshttps://doi.org/10.1006/jsco.1994.1025openalex-snapshot
Fast Construction of Irreducible Polynomials over Finite Fields
inferred← citeshttps://doi.org/10.1006/jsco.1998.0216openalex-snapshot
Composing Power Series Over a Finite Ring in Essentially Linear Time
inferred← citeshttps://doi.org/10.1006/jsco.1998.0224openalex-snapshot
Factoring in Skew-polynomial Rings over Finite Fields
inferred← citeshttps://doi.org/10.1006/jsco.1999.0309openalex-snapshot
Algorithms for Exponentiation in Finite Fields
inferred← citeshttps://doi.org/10.1006/jsco.1999.1002openalex-snapshot
Factoring Polynomials Over Finite Fields: A Survey
inferred← citeshttps://doi.org/10.1007/3-540-45455-1_5openalex-snapshot
On p-adic Point Counting Algorithms for Elliptic Curves over Finite Fields
inferred← citeshttps://doi.org/10.1007/3-540-54522-0_93openalex-snapshot
On wiedemann's method of solving sparse linear systems
inferred← citeshttps://doi.org/10.1007/3-540-56686-4_44openalex-snapshot
Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems
inferred← citeshttps://doi.org/10.1007/3-540-58691-1_59openalex-snapshot
On orders of optimal normal basis generators
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_98openalex-snapshot
Gauss periods and fast exponentiation in finite fields
inferred← citeshttps://doi.org/10.1007/3-540-63163-1_8openalex-snapshot
Exponentiation in finite fields: Theory and practice
inferred← citeshttps://doi.org/10.1007/978-3-030-36030-6_19openalex-snapshot
Efficient Information-Theoretic Secure Multiparty Computation over $$\mathbb {Z}/p^k\mathbb {Z}$$ via Galois Rings
inferred← citeshttps://doi.org/10.1007/978-3-030-64837-4_16openalex-snapshot
An Algebraic Attack on Ciphers with Low-Degree Round Functions: Application to Full MiMC
inferred← citeshttps://doi.org/10.1007/978-3-030-81293-5_6openalex-snapshot
On the Effect of Projection on Rank Attacks in Multivariate Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-031-09234-3_41openalex-snapshot
Carry-Less to BIKE Faster
inferred← citeshttps://doi.org/10.1007/978-3-031-34652-1_1openalex-snapshot
Background and Fundamental Concepts
inferred← citeshttps://doi.org/10.1007/978-3-031-34652-1_2openalex-snapshot
The Recurrence Case in One Variable
inferred← citeshttps://doi.org/10.1007/978-3-031-34652-1_3openalex-snapshot
The Differential Case in One Variable
inferred← citeshttps://doi.org/10.1007/978-3-031-34652-1_5openalex-snapshot
Summation and Integration
inferred← citeshttps://doi.org/10.1007/978-3-031-41724-5_8openalex-snapshot
On the Complexity of Linear Algebra Operations over Algebraic Extension Fields
inferred← citeshttps://doi.org/10.1007/978-3-031-68385-5_5openalex-snapshot
The Algebraic FreeLunch: Efficient Gröbner Basis Attacks Against Arithmetization-Oriented Primitives
inferred← citeshttps://doi.org/10.1007/978-3-031-82841-6_7openalex-snapshot
A Univariate Attack Against the Limited-Data Instance of Ciminion
inferred← citeshttps://doi.org/10.1007/978-3-032-01901-1_11openalex-snapshot
Improved Resultant Attack Against Arithmetization-Oriented Primitives
inferred← citeshttps://doi.org/10.1007/978-3-032-25330-9_13openalex-snapshot
Oblivious Ciphertext Compression via Linear Codes
inferred← citeshttps://doi.org/10.1007/978-3-319-02297-0_5openalex-snapshot
Faster Sparse Interpolation of Straight-Line Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-24633-6_4openalex-snapshot
Linear Recurrences with Polynomial Coefficients and Computation of the Cartier-Manin Operator on Hyperelliptic Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-04103-7_6openalex-snapshot
Code Generation for Polynomial Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-642-14518-6_16openalex-snapshot
On the Complexity of the Montes Ideal Factorization Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-17373-8_22openalex-snapshot
Faster Fully Homomorphic Encryption
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_8openalex-snapshot
Faster Polynomial Multiplication via Discrete Fourier Transforms
inferred← citeshttps://doi.org/10.1007/978-3-642-20807-2_22openalex-snapshot
Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation
inferred← citeshttps://doi.org/10.1007/978-3-642-31662-3_16openalex-snapshot
Improving the Berlekamp Algorithm for Binomials x n − a
inferred← citeshttps://doi.org/10.1007/978-3-642-34062-8_23openalex-snapshot
On Fast Division Algorithm for Polynomials Using Newton Iteration
inferred← citeshttps://doi.org/10.1007/978-3-642-57189-3_10openalex-snapshot
A Public Key Cryptosystem Based on Sparse Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-642-57201-2_30openalex-snapshot
Computing the Frobenius Normal Form of a Sparse Matrix
inferred← citeshttps://doi.org/10.1007/978-3-642-60539-0_27openalex-snapshot
Tests and Constructions of Irreducible Polynomials over Finite Fields
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_23openalex-snapshot
Algorithms and Complexity for Turaev-Viro Invariants
inferred← citeshttps://doi.org/10.1007/978-3-7643-8996-3_16openalex-snapshot
Unified Nearly Optimal Algorithms for Structured Integer Matrices
inferred← citeshttps://doi.org/10.1007/978-981-96-0875-1_5openalex-snapshot
Faster BGV Bootstrapping for Power-of-Two Cyclotomics Through Homomorphic NTT
inferred← citeshttps://doi.org/10.1007/978-981-96-1093-8_23openalex-snapshot
A Space Efficient Algorithm for Multiset Multicover with Multiplicity Constraints Problem via Algebraic Method
inferred← citeshttps://doi.org/10.1007/978-981-97-0407-1_9openalex-snapshot
MRMM-Based Keystream Generators for Information Security
inferred← citeshttps://doi.org/10.1007/bf01272074openalex-snapshot
Computing Frobenius maps and factoring polynomials
inferred← citeshttps://doi.org/10.1007/bf01277957openalex-snapshot
The computational complexity of recognizing permutation functions
inferred← citeshttps://doi.org/10.1007/bfb0054305openalex-snapshot
Analysis of Rabin's polynomial irreducibility test
inferred← citeshttps://doi.org/10.1007/s00037-004-0185-3openalex-snapshot
On the complexity of computing determinants
inferred← citeshttps://doi.org/10.1007/s00037-010-0294-0openalex-snapshot
Interpolation of Shifted-Lacunary Polynomials
inferred← citeshttps://doi.org/10.1007/s00145-023-09481-3openalex-snapshot
Rinocchio: SNARKs for Ring Arithmetic
inferred← citeshttps://doi.org/10.1007/s00200-011-0144-6openalex-snapshot
Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
inferred← citeshttps://doi.org/10.1007/s00200-012-0179-3openalex-snapshot
Multi-point evaluation in higher dimensions
inferred← citeshttps://doi.org/10.1007/s00200-013-0200-5openalex-snapshot
Polynomial root finding over local rings and application to error correcting codes
inferred← citeshttps://doi.org/10.1007/s00200-015-0269-0openalex-snapshot
On the complexity of skew arithmetic
inferred← citeshttps://doi.org/10.1007/s00200-015-0280-5openalex-snapshot
Deterministic root finding over finite fields using Graeffe transforms
inferred← citeshttps://doi.org/10.1007/s00200-018-0370-2openalex-snapshot
From implicit to recursive equations
inferred← citeshttps://doi.org/10.1007/s00200-019-00389-9openalex-snapshot
Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals
inferred← citeshttps://doi.org/10.1007/s00200-024-00669-zopenalex-snapshot
Approximate contact factorization of germs of plane curves
inferred← citeshttps://doi.org/10.1007/s00200-025-00690-wopenalex-snapshot
Optimizing the half-gcd algorithm
inferred← citeshttps://doi.org/10.1007/s00200-025-00704-7openalex-snapshot
Faster multi-point evaluation over any field
inferred← citeshttps://doi.org/10.1007/s002000000037openalex-snapshot
On Short Multiplications and Divisions
inferred← citeshttps://doi.org/10.1007/s00453-012-9640-8openalex-snapshot
Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation
inferred← citeshttps://doi.org/10.1007/s00453-016-0202-3openalex-snapshot
Efficiently Correcting Matrix Products
inferred← citeshttps://doi.org/10.1007/s10208-003-0093-yopenalex-snapshot
Counting Solutions to Equations in Many Variables over Finite Fields
inferred← citeshttps://doi.org/10.1007/s10208-020-09453-0openalex-snapshot
On the Complexity Exponent of Polynomial System Solving
inferred← citeshttps://doi.org/10.1007/s10623-013-9875-7openalex-snapshot
Computing in degree $$2^k$$ 2 k -extensions of finite fields of odd characteristic
inferred← citeshttps://doi.org/10.1007/s10623-022-01175-4openalex-snapshot
An improved method for predicting truncated multiple recursive generators with unknown parameters
inferred← citeshttps://doi.org/10.1007/s10958-013-1350-5openalex-snapshot
Complexity of computation in finite fields
inferred← citeshttps://doi.org/10.1007/s41468-018-0016-2openalex-snapshot
Algorithms and complexity for Turaev–Viro invariants
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00030-8openalex-snapshot
Parallel computation of polynomial GCD and some related parallel computations over abstract fields
inferred← citeshttps://doi.org/10.1016/0895-7177(94)90216-xopenalex-snapshot
Algebraic improvements of numerical algorithms: Interpolation and economization of Taylor series
inferred← citeshttps://doi.org/10.1016/j.dam.2017.01.033openalex-snapshot
A note on the multiple-recursive matrix method for generating pseudorandom vectors
inferred← citeshttps://doi.org/10.1016/j.ffa.2008.07.004openalex-snapshot
Elliptic periods for finite fields
inferred← citeshttps://doi.org/10.1016/j.ffa.2017.10.003openalex-snapshot
Factoring polynomials of the form f(xn)∈Fq[x]
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2012.11.033openalex-snapshot
Computing the Hermite form of a matrix of Ore polynomials
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2023.01.022openalex-snapshot
The equivariant complexity of multiplication in finite field extensions
inferred← citeshttps://doi.org/10.1016/j.jco.2003.08.009openalex-snapshot
Computing zeta functions of Artin-Schreier curves over finite fields II
inferred← citeshttps://doi.org/10.1016/j.jco.2004.03.005openalex-snapshot
Essentially optimal computation of the inverse of generic polynomial matrices
inferred← citeshttps://doi.org/10.1016/j.jco.2004.09.009openalex-snapshot
Polynomial evaluation and interpolation on special sets of points
inferred← citeshttps://doi.org/10.1016/j.jco.2018.05.002openalex-snapshot
Modular composition via factorization
inferred← citeshttps://doi.org/10.1016/j.jco.2019.03.002openalex-snapshot
Accelerated tower arithmetic
inferred← citeshttps://doi.org/10.1016/j.jco.2019.03.004openalex-snapshot
Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
inferred← citeshttps://doi.org/10.1016/j.jco.2019.04.001openalex-snapshot
Fast multivariate multi-point evaluation revisited
inferred← citeshttps://doi.org/10.1016/j.jco.2021.101572openalex-snapshot
Deterministic computation of the characteristic polynomial in the time of matrix multiplication
inferred← citeshttps://doi.org/10.1016/j.jco.2021.101574openalex-snapshot
Fast amortized multi-point evaluation
inferred← citeshttps://doi.org/10.1016/j.jco.2022.101693openalex-snapshot
Amortized multi-point evaluation of multivariate polynomials
inferred← citeshttps://doi.org/10.1016/j.jco.2023.101803openalex-snapshot
High-order lifting for polynomial Sylvester matrices
inferred← citeshttps://doi.org/10.1016/j.jco.2025.101934openalex-snapshot
Factoring sparse polynomials fast
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.12.010openalex-snapshot
Efficient parallel factorization and solution of structured and unstructured linear systems
inferred← citeshttps://doi.org/10.1016/j.jnt.2022.01.013openalex-snapshot
Root repulsion and faster solving for very sparse polynomials over p-adic fields
inferred← citeshttps://doi.org/10.1016/j.jsc.2005.07.001openalex-snapshot
Fast computation of special resultants
inferred← citeshttps://doi.org/10.1016/j.jsc.2007.04.004openalex-snapshot
New algorithms for relaxed multiplication
inferred← citeshttps://doi.org/10.1016/j.jsc.2007.10.011openalex-snapshot
An efficient sparse adaptation of the polytope method over Fp and a record-high binary bivariate factorisation
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.04.019openalex-snapshot
Fast arithmetic for triangular sets: From theory to practice
inferred← citeshttps://doi.org/10.1016/j.jsc.2010.03.005openalex-snapshot
Newton’s method and FFT trading
inferred← citeshttps://doi.org/10.1016/j.jsc.2010.08.012openalex-snapshot
Kaltofen’s division-free determinant algorithm differentiated for matrix adjoint computation
inferred← citeshttps://doi.org/10.1016/j.jsc.2010.08.013openalex-snapshot
Chunky and equal-spaced polynomial multiplication
inferred← citeshttps://doi.org/10.1016/j.jsc.2011.08.006openalex-snapshot
Detecting lacunary perfect powers and computing their roots
inferred← citeshttps://doi.org/10.1016/j.jsc.2011.08.015openalex-snapshot
Homotopy techniques for multiplication modulo triangular sets
inferred← citeshttps://doi.org/10.1016/j.jsc.2012.05.008openalex-snapshot
On the complexity of computing with zero-dimensional triangular sets
inferred← citeshttps://doi.org/10.1016/j.jsc.2012.06.004openalex-snapshot
On the bit-complexity of sparse polynomial and series multiplication
inferred← citeshttps://doi.org/10.1016/j.jsc.2014.09.012openalex-snapshot
Relaxed Hensel lifting of triangular sets
inferred← citeshttps://doi.org/10.1016/j.jsc.2015.11.005openalex-snapshot
Faster sparse multivariate polynomial interpolation of straight-line programs
inferred← citeshttps://doi.org/10.1016/j.jsc.2015.11.012openalex-snapshot
An isomorphism test for modules over a non-commutative PID. Applications to similarity of Ore polynomials
inferred← citeshttps://doi.org/10.1016/j.jsc.2016.11.015openalex-snapshot
Computing minimal interpolation bases
inferred← citeshttps://doi.org/10.1016/j.jsc.2017.11.001openalex-snapshot
On the complexity of integer matrix multiplication
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.1016/j.jsc.2018.04.018openalex-snapshot
Computing the bound of an Ore polynomial. Applications to factorization
inferred← citeshttps://doi.org/10.1016/j.jsc.2018.08.005openalex-snapshot
Fast systematic encoding of multiplicity codes
inferred← citeshttps://doi.org/10.1016/j.jsc.2019.07.002openalex-snapshot
Normal bases from 1-dimensional algebraic groups
inferred← citeshttps://doi.org/10.1016/j.jsc.2019.07.011openalex-snapshot
Fast computation of approximant bases in canonical form
inferred← citeshttps://doi.org/10.1016/j.jsc.2019.07.014openalex-snapshot
Fast Hermite interpolation and evaluation over finite fields of characteristic two
inferred← citeshttps://doi.org/10.1016/j.jsc.2019.07.026openalex-snapshot
Algorithms for simultaneous Hermite–Padé approximations
inferred← citeshttps://doi.org/10.1016/j.jsc.2020.06.006openalex-snapshot
Verification protocols with sub-linear communication for polynomial matrix operations
inferred← citeshttps://doi.org/10.1016/j.jsc.2020.06.007openalex-snapshot
Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields
inferred← citeshttps://doi.org/10.1016/j.jsc.2021.07.002openalex-snapshot
Polynomial-division-based algorithms for computing linear recurrence relations
inferred← citeshttps://doi.org/10.1016/j.jsc.2021.10.002openalex-snapshot
An in-place truncated Fourier transform
inferred← citeshttps://doi.org/10.1016/j.jsc.2021.11.001openalex-snapshot
Guessing Gröbner bases of structured ideals of relations of sequences
inferred← citeshttps://doi.org/10.1016/j.jsc.2022.07.008openalex-snapshot
Fast computation of the N-th term of a q-holonomic sequence and applications
inferred← citeshttps://doi.org/10.1016/j.jsc.2022.08.011openalex-snapshot
Polynomial modular product verification and its implications
inferred← citeshttps://doi.org/10.1016/j.jsc.2023.102240openalex-snapshot
Skew-polynomial-sparse matrix multiplication
inferred← citeshttps://doi.org/10.1016/j.jsc.2025.102507openalex-snapshot
Early termination for sparse interpolation of polynomials in Chebyshev bases
inferred← citeshttps://doi.org/10.1016/j.laa.2009.08.002openalex-snapshot
Fast conversion algorithms for orthogonal polynomials
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.09.002openalex-snapshot
On the complexities of multipoint evaluation and interpolation
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.10.003openalex-snapshot
Change of order for regular chains in positive dimension
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.05.014openalex-snapshot
Solving structured linear systems with large displacement rank
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.03.030openalex-snapshot
Interpolation of polynomials given by straight-line programs
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.07.013openalex-snapshot
Efficient computation of the characteristic polynomial of a threshold graph
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.04.029openalex-snapshot
Improved method for finding optimal formulas for bilinear maps in a finite field
inferred← citeshttps://doi.org/10.1016/s0024-3795(00)00041-0openalex-snapshot
Superfast algorithms for Cauchy-like matrix computations and extensions
inferred← citeshttps://doi.org/10.1016/s0024-3795(98)10126-xopenalex-snapshot
Hardness results and spectral techniques for combinatorial problems on circulant graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)80001-1openalex-snapshot
Univariate polynomial factorization over finite fields
inferred← citeshttps://doi.org/10.1017/9781139049801.011openalex-snapshot
Fast multiplication and its applications
inferred← citeshttps://doi.org/10.1023/a:1021878507303openalex-snapshot
Computation of Determinants, Adjoint Matrices, and Characteristic Polynomials without Division
inferred← citeshttps://doi.org/10.1080/00207170600726477openalex-snapshot
Asymptotically fast polynomial matrix algorithms for multivariable systems
inferred← citeshttps://doi.org/10.1088/1742-6596/256/1/012009openalex-snapshot
Fast polynomial multiplication on a GPU
inferred← citeshttps://doi.org/10.1089/cmb.2024.0854openalex-snapshot
An Algorithm to Calculate the p -Value of the Monge-Elkan Distance
inferred← citeshttps://doi.org/10.1090/conm/796/16008openalex-snapshot
Deuring for the people: Supersingular elliptic curves with prescribed endomorphism ring in general characteristic
inferred← citeshttps://doi.org/10.1090/mcom/3231openalex-snapshot
On the evaluation of some sparse polynomials
inferred← citeshttps://doi.org/10.1090/mcom/3328openalex-snapshot
Faster integer multiplication using plain vanilla FFT primes
inferred← citeshttps://doi.org/10.1090/mcom/3363openalex-snapshot
Computing isomorphisms and embeddings of finite fields
inferred← citeshttps://doi.org/10.1090/mcom/3517openalex-snapshot
A fast randomized geometric algorithm for computing Riemann-Roch spaces
inferred← citeshttps://doi.org/10.1090/s0025-5718-01-01393-xopenalex-snapshot
Hensel lifting and bivariate polynomial factorisation over finite fields
inferred← citeshttps://doi.org/10.1090/s0025-5718-02-01421-7openalex-snapshot
Polynomial factorization over 𝔽₂
inferred← citeshttps://doi.org/10.1090/s0025-5718-02-01428-xopenalex-snapshot
Factoring multivariate polynomials via partial differential equations
inferred← citeshttps://doi.org/10.1090/s0025-5718-08-02066-8openalex-snapshot
Fast algorithms for computing isogenies between elliptic curves
inferred← citeshttps://doi.org/10.1090/s0025-5718-1994-1216262-2openalex-snapshot
Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases
inferred← citeshttps://doi.org/10.1090/s0025-5718-1994-1218344-8openalex-snapshot
An Acceleration of the Niederreiter Factorization Algorithm in Characteristic 2
inferred← citeshttps://doi.org/10.1090/s0025-5718-1995-1270621-1openalex-snapshot
Analysis of Coppersmith’s block Wiedemann algorithm for the parallel solution of sparse linear systems
inferred← citeshttps://doi.org/10.1090/s0025-5718-1995-1297469-6openalex-snapshot
On orders of optimal normal basis generators
inferred← citeshttps://doi.org/10.1090/s0025-5718-2013-02715-9openalex-snapshot
Taking roots over high extensions of finite fields
inferred← citeshttps://doi.org/10.1090/s0025-5718-98-00944-2openalex-snapshot
Subquadratic-time factoring of polynomials over finite fields
inferred← citeshttps://doi.org/10.1109/12.805153openalex-snapshot
Fast arithmetic for public-key algorithms in Galois fields with composite exponents
inferred← citeshttps://doi.org/10.1109/allerton.2017.8262778openalex-snapshot
Coded fourier transform
inferred← citeshttps://doi.org/10.1109/arith.2005.21openalex-snapshot
Fast Modular Reduction for Large Wordlengths via One Linear and One Cyclic Convolution
inferred← citeshttps://doi.org/10.1109/focs.2012.57openalex-snapshot
Quasi-optimal Multiplication of Linear Differential Operators
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00127openalex-snapshot
Power Series Composition in Near-Linear Time
inferred← citeshttps://doi.org/10.1109/globalsip.2018.8645965openalex-snapshot
ON THE CAPACITY OF SECURE DISTRIBUTED FAST FOURIER TRANSFORM
inferred← citeshttps://doi.org/10.1109/icdsp.1997.628507openalex-snapshot
Algorithms and the multiplicative complexity of the reduction a modulo arbitrary polynomial, generalized K/sub N/-convolution and fast Vandermonde transform
inferred← citeshttps://doi.org/10.1109/icpects56089.2022.10047793openalex-snapshot
Twiddle Factor Normalization Based Radix-2k Factorization for Improved Spectral Efficiency in Subcarrier Mapping
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267811openalex-snapshot
Improved parallel polynomial division and its extensions
inferred← citeshttps://doi.org/10.1109/sips.2011.6088940openalex-snapshot
Computational complexity of cyclotomic fast Fourier transforms over characteristic-2 fields
inferred← citeshttps://doi.org/10.1109/tc.2005.49openalex-snapshot
Five, six, and seven-term Karatsuba-like formulae
inferred← citeshttps://doi.org/10.1109/tc.2011.110openalex-snapshot
On Polynomial Multiplication in Chebyshev Basis
inferred← citeshttps://doi.org/10.1109/tcomm.2025.3534584openalex-snapshot
Trimmed FFTs and Applications to Coding and Secret Sharing
inferred← citeshttps://doi.org/10.1109/tit.2013.2264797openalex-snapshot
On Generalized Reed–Solomon Codes Over Commutative and Noncommutative Rings
inferred← citeshttps://doi.org/10.1109/tit.2015.2416068openalex-snapshot
Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations
inferred← citeshttps://doi.org/10.1109/tit.2016.2600417openalex-snapshot
FFT Algorithm for Binary Extension Finite Fields and Its Application to Reed–Solomon Codes
inferred← citeshttps://doi.org/10.1109/tit.2017.2655029openalex-snapshot
Construction and Encoding of QC-LDPC Codes Using Group Rings
inferred← citeshttps://doi.org/10.1109/tit.2020.3042248openalex-snapshot
Fast Encoding of AG Codes Over CabCurves
inferred← citeshttps://doi.org/10.1109/tit.2025.3619049openalex-snapshot
Encoding and Decoding of Reed–Muller Codes With Quasi-Linear Complexity
inferred← citeshttps://doi.org/10.1109/tkde.2010.132openalex-snapshot
Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters
inferred← citeshttps://doi.org/10.1109/tsp.2011.2178844openalex-snapshot
On Algorithms and Complexities of Cyclotomic Fast Fourier Transforms Over Arbitrary Finite Fields
inferred← citeshttps://doi.org/10.1112/s0024611503014461openalex-snapshot
Deformation theory and the computation of zeta functions
inferred← citeshttps://doi.org/10.1112/s1461157000000681openalex-snapshot
Computing Zeta Functions of Artin–schreier Curves over Finite Fields
inferred← citeshttps://doi.org/10.1134/s0001434615030256openalex-snapshot
Arithmetic complexity of certain linear transformations
inferred← citeshttps://doi.org/10.1134/s1990478911020074openalex-snapshot
On the complexity of linear boolean operators with thin matrices
inferred← citeshttps://doi.org/10.1137/0222041openalex-snapshot
Improved Parallel Polynomial Division
inferred← citeshttps://doi.org/10.1137/120893677openalex-snapshot
On the Fast Computation of the Weight Enumerator Polynomial and the $t$ Value of Digital Nets over Finite Abelian Groups
inferred← citeshttps://doi.org/10.1137/s0097539704443793openalex-snapshot
Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator
inferred← citeshttps://doi.org/10.1137/s0097539793252687openalex-snapshot
Nearly Optimal Algorithms for Canonical Matrix Forms
inferred← citeshttps://doi.org/10.1137/s0097539797349959openalex-snapshot
Parallel Complexity of Computations with General and Toeplitz-Like Matrices Filled with Integers and Extensions
inferred← citeshttps://doi.org/10.1142/9789814533584_0023openalex-snapshot
Parallel Solution of Toeplitz and Toeplitz-Like Linear Systems Over Fields of Small Positive Characteristic
inferred← citeshttps://doi.org/10.1142/s1793042111004034openalex-snapshot
MEMORY EFFICIENT HYPERELLIPTIC CURVE POINT COUNTING
inferred← citeshttps://doi.org/10.1145/1005285.1005327openalex-snapshot
The truncated fourier transform and applications
inferred← citeshttps://doi.org/10.1145/1073884.1073925openalex-snapshot
Multivariate power series multiplication
inferred← citeshttps://doi.org/10.1145/1073884.1073927openalex-snapshot
Computing the rank and a small nullspace basis of a polynomial matrix
inferred← citeshttps://doi.org/10.1145/1113439.1113457openalex-snapshot
On the complexity of the D5 principle
inferred← citeshttps://doi.org/10.1145/113379.113396openalex-snapshot
Processor efficient parallel solution of linear systems over an abstract field
inferred← citeshttps://doi.org/10.1145/1145768.1145785openalex-snapshot
Solving sparse rational linear systems
inferred← citeshttps://doi.org/10.1145/1145768.1145814openalex-snapshot
Change of order for bivariate triangular sets
inferred← citeshttps://doi.org/10.1145/1182553.1182558openalex-snapshot
Solving structured linear systems of large displacement rank
inferred← citeshttps://doi.org/10.1145/1277548.1277554openalex-snapshot
Solving toeplitz- and vandermonde-like linear systems with large displacement rank
showing the first 200 of 336 · page through all 336
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.