On the public citation graph
On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
0 signed · 293 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.1002/cpa.3160230204openalex-snapshot
On the number of multiplications necessary to compute certain functions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/mma.6510openalex-snapshot
Simulation of harmonic oscillators on the lattice
inferred← citeshttps://doi.org/10.1002/mma.7041openalex-snapshot
On Bernoulli series approximation for the matrix cosine
inferred← citeshttps://doi.org/10.1002/zamm.19870670712openalex-snapshot
On a Class of High Order Methods for Inverting Matrices
inferred← citeshttps://doi.org/10.1006/jcom.1997.0435openalex-snapshot
Simplified Lower Bounds for Polynomials with Algebraic Coefficients
inferred← citeshttps://doi.org/10.1006/jcom.1999.0526openalex-snapshot
Time-Space Tradeoffs in Algebraic Complexity Theory
inferred← citeshttps://doi.org/10.1007/3-540-08353-7_133openalex-snapshot
Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials
inferred← citeshttps://doi.org/10.1007/3-540-09118-1_30openalex-snapshot
On the additive complexity of polynomials and some new lower bounds
inferred← citeshttps://doi.org/10.1007/3-540-45455-1_24openalex-snapshot
Fast Elliptic Curve Point Counting Using Gaussian Normal Basis
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-48311-x_1openalex-snapshot
Some Parallel Algorithms for Integer Factorisation
inferred← citeshttps://doi.org/10.1007/3-540-51082-6_85openalex-snapshot
On the computational complexity of polynomials and bilinear mappings. A survey
inferred← citeshttps://doi.org/10.1007/978-3-030-04480-0_12openalex-snapshot
Numerical Evaluation of Elliptic Functions, Elliptic Integrals and Modular Forms
inferred← citeshttps://doi.org/10.1007/978-3-030-17656-3_2openalex-snapshot
Improved Bootstrapping for Approximate Homomorphic Encryption
inferred← citeshttps://doi.org/10.1007/978-3-030-34621-8_15openalex-snapshot
Numerical Method for Comparison on Homomorphically Encrypted Numbers
inferred← citeshttps://doi.org/10.1007/978-3-030-40186-3_16openalex-snapshot
Better Bootstrapping for Approximate Homomorphic Encryption
inferred← citeshttps://doi.org/10.1007/978-3-030-64834-3_8openalex-snapshot
Efficient Homomorphic Comparison Methods with Optimal Complexity
inferred← citeshttps://doi.org/10.1007/978-3-031-06944-4_17openalex-snapshot
Sine Series Approximation of the Mod Function for Bootstrapping of Approximate HE
inferred← citeshttps://doi.org/10.1007/978-3-031-15802-5_26openalex-snapshot
Oblivious Message Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-031-30620-4_9openalex-snapshot
On Polynomial Functions Modulo $$p^e$$ and Faster Bootstrapping for Homomorphic Encryption
inferred← citeshttps://doi.org/10.1007/978-3-031-65494-7_4openalex-snapshot
Approaches for Writing HE Applications
inferred← citeshttps://doi.org/10.1007/978-3-031-76930-6_9openalex-snapshot
Applications of the Fast Matrix Multiplication Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-032-01881-6_10openalex-snapshot
General Functional Bootstrapping Using CKKS
inferred← citeshttps://doi.org/10.1007/978-3-032-10569-1_6openalex-snapshot
A Performance Comparison of the Homomorphic Encryption Schemes CKKS and TFHE
inferred← citeshttps://doi.org/10.1007/978-3-032-25327-9_10openalex-snapshot
High-precision Functional Bootstrapping for CKKS from Fourier Extension
inferred← citeshttps://doi.org/10.1007/978-3-032-35374-0_15openalex-snapshot
Faster Polynomial Evaluations for SIMD FHEs and Application to BGV in HElib
inferred← citeshttps://doi.org/10.1007/978-3-319-49887-4_4openalex-snapshot
Localization in Matrix Computations: Theory and Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-66787-4_8openalex-snapshot
Generalized Polynomial Decomposition for S-boxes with Application to Side-Channel Countermeasures
inferred← citeshttps://doi.org/10.1007/978-3-319-70694-8_15openalex-snapshot
Homomorphic Encryption for Arithmetic of Approximate Numbers
inferred← citeshttps://doi.org/10.1007/978-3-319-78024-5_3openalex-snapshot
Efficient Evaluation of Matrix Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-319-78381-9_12openalex-snapshot
Homomorphic Lower Digits Removal and Improved FHE Bootstrapping
inferred← citeshttps://doi.org/10.1007/978-3-319-78381-9_14openalex-snapshot
Bootstrapping for Approximate Homomorphic Encryption
inferred← citeshttps://doi.org/10.1007/978-3-540-69182-2_41openalex-snapshot
The HLRB Cluster as Quantum CISC Compiler
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_15openalex-snapshot
Few Product Gates But Many Zeros
inferred← citeshttps://doi.org/10.1007/978-3-642-20465-4_9openalex-snapshot
Implementing Gentry’s Fully-Homomorphic Encryption Scheme
inferred← citeshttps://doi.org/10.1007/978-3-642-40349-1_24openalex-snapshot
Analysis and Improvement of the Generic Higher-Order Masking Scheme of FSE 2012
inferred← citeshttps://doi.org/10.1007/978-3-662-44709-3_10openalex-snapshot
Fast Evaluation of Polynomials over Binary Finite Fields and Application to Side-Channel Countermeasures
inferred← citeshttps://doi.org/10.1007/978-3-662-46706-0_25openalex-snapshot
On the Minimum Number of Multiplications Necessary for Universal Hash Functions
inferred← citeshttps://doi.org/10.1007/978-3-662-49301-4_20openalex-snapshot
Polynomial Evaluation and Side Channel Analysis
inferred← citeshttps://doi.org/10.1007/978-90-481-2853-2_12openalex-snapshot
Methods for Hartree-Fock and Density Functional Theory Electronic Structure Calculations with Linearly Scaling Processor Time and Memory Usage
inferred← citeshttps://doi.org/10.1007/978-94-017-1108-1_9openalex-snapshot
An Implementation of the Elliptic Curve Integer Factorization Method
inferred← citeshttps://doi.org/10.1007/978-94-017-7188-7_12openalex-snapshot
Matrix Functions and the Determinant
inferred← citeshttps://doi.org/10.1007/978-981-92-0844-9_7openalex-snapshot
Fast Computing Matrix Function in Numerical Stochastic Perturbation Theory
inferred← citeshttps://doi.org/10.1007/978-981-92-3015-0_3openalex-snapshot
Laurent Polynomial-Based Linear Transformations for Improved Functional Bootstrapping
inferred← citeshttps://doi.org/10.1007/978-981-95-0033-8_12openalex-snapshot
Secure Multicenter Medical Model Inference from Homomorphic Encryption
inferred← citeshttps://doi.org/10.1007/978-981-96-0875-1_11openalex-snapshot
Bootstrapping Small Integers With CKKS
inferred← citeshttps://doi.org/10.1007/978-981-99-8736-8_4openalex-snapshot
Amortized Functional Bootstrapping in Less than 7 ms, with $$\tilde{O}(1)$$ Polynomial Multiplications
inferred← citeshttps://doi.org/10.1007/bf02104745openalex-snapshot
Lower bounds in algebraic computational complexity
inferred← citeshttps://doi.org/10.1007/bfb0055765openalex-snapshot
Combinatorial hardness proofs for polynomial evaluation
inferred← citeshttps://doi.org/10.1007/s00037-004-0185-3openalex-snapshot
On the complexity of computing determinants
inferred← citeshttps://doi.org/10.1007/s000370050001openalex-snapshot
On lower bounds for the complexity of polynomials and their multiples
inferred← citeshttps://doi.org/10.1007/s00145-023-09454-6openalex-snapshot
Bootstrapping for BGV and BFV Revisited
inferred← citeshttps://doi.org/10.1007/s00200-003-0133-5openalex-snapshot
Fast Algorithms for Zero-Dimensional Polynomial Systems using Duality
inferred← citeshttps://doi.org/10.1007/s00200-011-0160-6openalex-snapshot
Polynomial evaluation over finite fields: new algorithms and complexity bounds
inferred← citeshttps://doi.org/10.1007/s00200-021-00536-1openalex-snapshot
Univariate polynomial factorization over large finite fields
inferred← citeshttps://doi.org/10.1007/s00211-025-01454-xopenalex-snapshot
Fast evaluation of real and complex polynomials
inferred← citeshttps://doi.org/10.1007/s00211-025-01493-4openalex-snapshot
Summing divergent matrix series
inferred← citeshttps://doi.org/10.1007/s10092-021-00453-2openalex-snapshot
Efficient and accurate computation for the $$\varphi$$-functions arising from exponential integrators
inferred← citeshttps://doi.org/10.1007/s10208-002-0065-7openalex-snapshot
The Hardness of Polynomial Equation Solving
inferred← citeshttps://doi.org/10.1007/s10409-023-22451-xopenalex-snapshot
Efficient computational method for matrix function in dynamic problems
inferred← citeshttps://doi.org/10.1007/s10543-018-00744-1openalex-snapshot
Computation of matrix gamma function
inferred← citeshttps://doi.org/10.1007/s11075-005-8141-0openalex-snapshot
Efficient algorithms for the matrix cosine and sine
inferred← citeshttps://doi.org/10.1007/s11075-021-01214-6openalex-snapshot
Calculating a function of a matrix with a real spectrum
inferred← citeshttps://doi.org/10.1007/s11075-025-02171-0openalex-snapshot
Efficient algorithm for the oscillatory matrix functions
inferred← citeshttps://doi.org/10.1007/s11227-016-1694-yopenalex-snapshot
Automatic tuning to performance modelling of matrix polynomials on multicore and multi-GPU systems
inferred← citeshttps://doi.org/10.1007/s11227-018-2354-1openalex-snapshot
Computing matrix trigonometric functions with GPUs through Matlab
inferred← citeshttps://doi.org/10.1007/s12083-026-02267-xopenalex-snapshot
Single-server CPA-secure and post-quantum encrypted kNN queries
inferred← citeshttps://doi.org/10.1007/s13389-015-0099-9openalex-snapshot
Fast evaluation of polynomials over binary finite fields and application to side-channel countermeasures
inferred← citeshttps://doi.org/10.1007/s13540-024-00326-9openalex-snapshot
Computing the Mittag-Leffler function of a matrix argument
inferred← citeshttps://doi.org/10.1016/0020-0190(79)90018-8openalex-snapshot
An Ω((n/lgn)1/2) lower bound on the number of additions necessary to compute 0–1 polynomials over the ring of integer polynomials
inferred← citeshttps://doi.org/10.1016/0020-0190(79)90131-5openalex-snapshot
A note on the complexity of approximative evaluation of polynomials
inferred← citeshttps://doi.org/10.1016/0022-0000(78)90041-7openalex-snapshot
Evaluation of polynomials with super-preconditioning
inferred← citeshttps://doi.org/10.1016/0304-3975(76)90051-7openalex-snapshot
Complexity measures and hierarchies for the evaluation of integers and polynomials
inferred← citeshttps://doi.org/10.1016/0304-3975(78)90016-6openalex-snapshot
Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials
inferred← citeshttps://doi.org/10.1016/0304-3975(80)90019-5openalex-snapshot
Lower bounds for polynomials with algebraic coefficients
inferred← citeshttps://doi.org/10.1016/0304-3975(80)90068-7openalex-snapshot
On the additive complexity of polynomials
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90137-4openalex-snapshot
On polynomials with symmetric Galois group which are easy to compute
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90093-5openalex-snapshot
On the representation of rational functions of bounded complexity
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90094-7openalex-snapshot
Lower bounds for the complexity of polynomials
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90380-kopenalex-snapshot
On the algebraic complexity of rational iteration procedures
inferred← citeshttps://doi.org/10.1016/b978-0-12-614150-4.50042-3openalex-snapshot
ON THE LIMITATION AND APPLICATION OF PADÉ APPROXIMATION TO THE MATRIX EXPONENTIAL
inferred← citeshttps://doi.org/10.1016/j.amc.2011.01.004openalex-snapshot
Efficient orthogonal matrix polynomial based method for computing matrix exponential
inferred← citeshttps://doi.org/10.1016/j.amc.2012.05.064openalex-snapshot
Efficient mixed rational and polynomial approximation of matrix functions
inferred← citeshttps://doi.org/10.1016/j.amc.2013.01.043openalex-snapshot
Efficient computation of the matrix cosine
inferred← citeshttps://doi.org/10.1016/j.amc.2017.05.019openalex-snapshot
Two algorithms for computing the matrix cosine function
inferred← citeshttps://doi.org/10.1016/j.amc.2018.08.017openalex-snapshot
Boosting the computation of the matrix exponential
inferred← citeshttps://doi.org/10.1016/j.aml.2021.107246openalex-snapshot
Faster stochastic trace estimation with a Chebyshev product identity
inferred← citeshttps://doi.org/10.1016/j.apm.2015.09.050openalex-snapshot
Solving engineering models using hyperbolic matrix functions
inferred← citeshttps://doi.org/10.1016/j.apnum.2008.03.035openalex-snapshot
The scaling and modified squaring method for matrix functions related to the exponential
inferred← citeshttps://doi.org/10.1016/j.apnum.2008.03.039openalex-snapshot
Comparison of methods for evaluating functions of a matrix exponential
inferred← citeshttps://doi.org/10.1016/j.apnum.2021.01.009openalex-snapshot
Computing the matrix sine and cosine simultaneously with a reduced number of products
inferred← citeshttps://doi.org/10.1016/j.apnum.2022.08.009openalex-snapshot
Computing the Lyapunov operator φ-functions, with an application to matrix-valued exponential integrators
inferred← citeshttps://doi.org/10.1016/j.arcontrol.2023.100913openalex-snapshot
A brief survey on encrypted control: From the first to the second generation and beyond
inferred← citeshttps://doi.org/10.1016/j.cam.2016.05.015openalex-snapshot
Efficient and accurate algorithms for computing matrix trigonometric functions
inferred← citeshttps://doi.org/10.1016/j.cam.2017.11.029openalex-snapshot
A new efficient and accurate spline algorithm for the matrix exponential computation
inferred← citeshttps://doi.org/10.1016/j.cam.2018.08.047openalex-snapshot
An efficient and accurate algorithm for computing the matrix cosine based on new Hermite approximations
inferred← citeshttps://doi.org/10.1016/j.cam.2018.12.041openalex-snapshot
Fast Taylor polynomial evaluation for the computation of the matrix cosine
inferred← citeshttps://doi.org/10.1016/j.cam.2020.113207openalex-snapshot
On Bernoulli matrix polynomials and matrix exponential approximation
inferred← citeshttps://doi.org/10.1016/j.cam.2022.114084openalex-snapshot
New Hermite series expansion for computing the matrix hyperbolic cosine
inferred← citeshttps://doi.org/10.1016/j.cam.2022.114706openalex-snapshot
On the backward and forward error of approximations of analytic functions and applications to the computation of matrix functions
inferred← citeshttps://doi.org/10.1016/j.cam.2023.115074openalex-snapshot
Euler polynomials for the matrix exponential approximation
inferred← citeshttps://doi.org/10.1016/j.cpc.2017.12.010openalex-snapshot
Massively parallel sparse matrix function calculations with NTPoly
inferred← citeshttps://doi.org/10.1016/j.cplett.2012.01.015openalex-snapshot
Reply to Comment on ‘On the optimal symmetric purification scheme of the one-particle density matrix’
inferred← citeshttps://doi.org/10.1016/j.cplett.2012.01.026openalex-snapshot
Comment on “On the optimal symmetric purification scheme of the one-particle density matrix” [Chem. Phys. Lett. 511 (2011) 159–160]
inferred← citeshttps://doi.org/10.1016/j.cplett.2012.10.090openalex-snapshot
Optimized purification for density matrix calculation
inferred← citeshttps://doi.org/10.1016/j.ic.2011.09.001openalex-snapshot
The functions erf and erfc computed with arbitrary precision and explicit error bounds
inferred← citeshttps://doi.org/10.1016/j.jco.2007.01.008openalex-snapshot
Lifting and recombination techniques for absolute factorization
inferred← citeshttps://doi.org/10.1016/j.jco.2012.04.005openalex-snapshot
Software Engineering and complexity in effective Algebraic Geometry
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.04.001openalex-snapshot
Fast multivariate multi-point evaluation revisited
inferred← citeshttps://doi.org/10.1016/j.jco.2021.101574openalex-snapshot
Fast amortized multi-point evaluation
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.jcp.2003.08.027openalex-snapshot
Fast methods for resumming matrix polynomials and Chebyshev matrix polynomials
inferred← citeshttps://doi.org/10.1016/j.jisa.2026.104615openalex-snapshot
Lightweight, practical encrypted face recognition with GPU support
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.2012.07.005openalex-snapshot
On the evaluation of multivariate polynomials over finite fields
inferred← citeshttps://doi.org/10.1016/j.jsc.2017.11.012openalex-snapshot
Fast operations on linearized polynomials and their applications in coding theory
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.laa.2017.11.010openalex-snapshot
Efficient evaluation of matrix polynomials
inferred← citeshttps://doi.org/10.1016/j.laa.2018.09.010openalex-snapshot
Computing primary solutions of equations involving primary matrix functions
inferred← citeshttps://doi.org/10.1016/j.laa.2019.04.001openalex-snapshot
Optimality of the Paterson–Stockmeyer method for evaluating matrix polynomials and rational matrix functions
inferred← citeshttps://doi.org/10.1016/j.laa.2024.10.024openalex-snapshot
Polynomial approximations for the matrix logarithm with computation graphs
inferred← citeshttps://doi.org/10.1016/j.mcm.2009.05.012openalex-snapshot
Computing matrix functions solving coupled differential models
inferred← citeshttps://doi.org/10.1016/j.mcm.2011.11.022openalex-snapshot
Computing matrix functions arising in engineering models with orthogonal matrix polynomials
inferred← citeshttps://doi.org/10.1016/j.neucom.2026.134508openalex-snapshot
Efficient privacy-preserving LSTM inference on encrypted sequential data
inferred← citeshttps://doi.org/10.1016/j.parco.2019.102548openalex-snapshot
Parallelization and scalability analysis of inverse factorization using the chunks and tasks programming model
inferred← citeshttps://doi.org/10.1016/s0024-3795(96)00290-xopenalex-snapshot
On the Computation of Minimal Polynomials, Cyclic Vectors, and Frobenius Forms
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00149-3openalex-snapshot
A new method to obtain lower bounds for polynomial evaluation
inferred← citeshttps://doi.org/10.1016/s0764-4442(99)80042-1openalex-snapshot
Le rapport entre le temps et l'espace pour l'évaluation des polynômes
inferred← citeshttps://doi.org/10.1021/ct200441gopenalex-snapshot
Accelerated Purification Using Generalized Nonpurifying Intermediate Functions for Large-Scale Self-Consistent Field Calculations
inferred← citeshttps://doi.org/10.1051/0004-6361/202556530openalex-snapshot
A highly accurate drag solver for multi-fluid dust and gas hydrodynamics on GPUs
inferred← citeshttps://doi.org/10.1063/1.1590632openalex-snapshot
Improved Fermi operator expansion methods for fast electronic structure calculations
inferred← citeshttps://doi.org/10.1063/1.2841077openalex-snapshot
Direct energy functional minimization under orthogonality constraints
inferred← citeshttps://doi.org/10.1063/1.4972007openalex-snapshot
Perspective: Methods for large-scale density functional calculations on metallic systems
inferred← citeshttps://doi.org/10.1063/5.0164255openalex-snapshot
A fast, dense Chebyshev solver for electronic structure on GPUs
inferred← citeshttps://doi.org/10.1063/5.0189864openalex-snapshot
Positivity preserving density matrix minimization at finite temperatures via square root
inferred← citeshttps://doi.org/10.1063/5.0198797openalex-snapshot
Hybrid programming-model strategies for GPU offloading of electronic structure calculation kernels
inferred← citeshttps://doi.org/10.1070/rm1981v036n06abeh003102openalex-snapshot
Complexity problems in computational theory
inferred← citeshttps://doi.org/10.1070/sm2012v203n10abeh004270openalex-snapshot
A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials
inferred← citeshttps://doi.org/10.1080/00207160.2013.791392openalex-snapshot
Accurate and efficient matrix exponential computation
inferred← citeshttps://doi.org/10.1080/00207160.2026.2697770openalex-snapshot
Computing matrix exponentials via Charlier method
inferred← citeshttps://doi.org/10.1088/1742-6596/574/1/012088openalex-snapshot
Any realistic model of a physical system must be computationally realistic
inferred← citeshttps://doi.org/10.1090/conm/604/12071openalex-snapshot
On the intrinsic complexity of elimination problems in effective algebraic geometry
inferred← citeshttps://doi.org/10.1090/mcom/3363openalex-snapshot
Computing isomorphisms and embeddings of finite fields
inferred← citeshttps://doi.org/10.1090/s0025-5718-1989-0971406-0openalex-snapshot
Efficient Multiple-Precision Evaluation of Elementary Functions
inferred← citeshttps://doi.org/10.1090/s0025-5718-99-00992-8openalex-snapshot
Factorization of the tenth Fermat number
inferred← citeshttps://doi.org/10.1101/2024.04.16.589793openalex-snapshot
Ultra-secure storage and analysis of genetic data for the advancement of precision medicine
inferred← citeshttps://doi.org/10.1103/physrevb.68.233104openalex-snapshot
Implicit purification for temperature-dependent density matrices
inferred← citeshttps://doi.org/10.1109/31.16591openalex-snapshot
Evaluating the matrix polynomial I+A+. . .+A/sup N-1/
inferred← citeshttps://doi.org/10.1109/81.129458openalex-snapshot
A fast algorithm for evaluating the matrix polynomial I+A+. . .+A/sup N-1/
inferred← citeshttps://doi.org/10.1109/81.273926openalex-snapshot
A limited disproof to the conjecture of evaluating the matrix polynomial I+A+A/sup 2/+···+A/sup N-1/
inferred← citeshttps://doi.org/10.1109/access.2020.3014369openalex-snapshot
Near-Optimal Polynomial for Modulus Reduction Using L2-Norm for Approximate Homomorphic Encryption
inferred← citeshttps://doi.org/10.1109/access.2022.3223136openalex-snapshot
Interactive Proofs for Rounding Arithmetic
inferred← citeshttps://doi.org/10.1109/access.2023.3287564openalex-snapshot
Precise Approximation of Convolutional Neural Networks for Homomorphically Encrypted Data
inferred← citeshttps://doi.org/10.1109/aina.2017.85openalex-snapshot
Performance Analysis of Sorting of FHE Data: Integer-Wise Comparison vs Bit-Wise Comparison
inferred← citeshttps://doi.org/10.1109/arith.2011.39openalex-snapshot
Automatic Generation of Fast and Certified Code for Polynomial Evaluation
inferred← citeshttps://doi.org/10.1109/arith.2013.33openalex-snapshot
Multiple-Precision Evaluation of the Airy Ai Function with Reduced Cancellation
inferred← citeshttps://doi.org/10.1109/bigcomp68355.2026.00045openalex-snapshot
Scalable and Efficient Unbalanced PSI from FHE with Client Friendly Overhead
inferred← citeshttps://doi.org/10.1109/candar68384.2025.00032openalex-snapshot
Improving Homomorphic Evaluation of Bivariate Functions in BFV via Tree-Based BSGS with Lazy Relinearization
inferred← citeshttps://doi.org/10.1109/cdc45484.2021.9683401openalex-snapshot
Encrypted Distributed Lasso for Sparse Data Predictive Control
inferred← citeshttps://doi.org/10.1109/cns59707.2023.10288803openalex-snapshot
Homomorphic Comparison Method Based on Dynamically Polynomial Composite Approximating Sign Function
inferred← citeshttps://doi.org/10.1109/icaice68195.2025.11382418openalex-snapshot
Efficient Privacy-Preserving Linear System Solving Based on Homomorphic Encryption
inferred← citeshttps://doi.org/10.1109/iscas.1994.409320openalex-snapshot
Hybrid algorithm for the computation of the matrix polynomial using a fractal number system
inferred← citeshttps://doi.org/10.1109/sfcs.1975.25openalex-snapshot
Polynomials with 0-1 coefficients that are hard to evaluate
inferred← citeshttps://doi.org/10.1109/sfcs.1978.7openalex-snapshot
An optimal lower bound on the number of total operations to compute 0-1 polynomials over the field of complex numbers
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267812openalex-snapshot
Fast algorithms for matrix normal forms
inferred← citeshttps://doi.org/10.1109/sp63933.2026.00173openalex-snapshot
APEX: Accurate Parallel Expressive Homomorphic Execution for Encrypted Databases
inferred← citeshttps://doi.org/10.1109/sp63933.2026.00226openalex-snapshot
Efficient Arithmetic-and-Comparison Homomorphic Encryption with Space Switching
inferred← citeshttps://doi.org/10.1109/synasc.2011.17openalex-snapshot
Long Integers and Polynomial Evaluation with Estrin's Scheme
inferred← citeshttps://doi.org/10.1109/tac.1979.1102005openalex-snapshot
A note on the evaluation of matrix polynomials
inferred← citeshttps://doi.org/10.1109/tdsc.2022.3218793openalex-snapshot
Hercules: Boosting the Performance of Privacy-Preserving Federated Learning
inferred← citeshttps://doi.org/10.1109/tdsc.2025.3579365openalex-snapshot
BitBatSPIR: Efficient Batch Symmetric Private Information Retrieval From PSI
inferred← citeshttps://doi.org/10.1109/tdsc.2025.3630273openalex-snapshot
STEED: Space and Time-Efficient Encrypted Database Using FHE
inferred← citeshttps://doi.org/10.1109/tifs.2019.2946097openalex-snapshot
Improving the Efficiency of SVM Classification With FHE
inferred← citeshttps://doi.org/10.1109/tifs.2022.3188145openalex-snapshot
Efficient Homomorphic Evaluation on Large Intervals
inferred← citeshttps://doi.org/10.1109/tifs.2023.3348246openalex-snapshot
An Efficient and Scalable FHE-Based PDQ Scheme: Utilizing FFT to Design a Low Multiplication Depth Large-Integer Comparison Algorithm
inferred← citeshttps://doi.org/10.1109/tifs.2025.3550059openalex-snapshot
Labeled Private Set Intersection From Distributed Point Function
inferred← citeshttps://doi.org/10.1109/tifs.2025.3558580openalex-snapshot
FHECAP: An Encrypted Control System With Piecewise Continuous Actuation
inferred← citeshttps://doi.org/10.1109/wifs.2016.7823916openalex-snapshot
Image denoising in the encrypted domain
inferred← citeshttps://doi.org/10.1112/s1461157000001534openalex-snapshot
A Point Counting Algorithm Using Cohomology with Compact Support
inferred← citeshttps://doi.org/10.1137/0205013openalex-snapshot
On the Number of Additions to Compute Specific Polynomials
inferred← citeshttps://doi.org/10.1137/0207004openalex-snapshot
Polynomials with 0-1 Coefficients That are Hard to Evaluate
inferred← citeshttps://doi.org/10.1137/080716426openalex-snapshot
Computing the Fréchet Derivative of the Matrix Exponential, with an Application to Condition Number Estimation
inferred← citeshttps://doi.org/10.1137/090763202openalex-snapshot
New Scaling-Squaring Taylor Algorithms for Computing the Matrix Exponential
inferred← citeshttps://doi.org/10.1137/0914008openalex-snapshot
Reducing the Symmetric Matrix Eigenvalue Problem to Matrix Multiplications
inferred← citeshttps://doi.org/10.1137/10081232xopenalex-snapshot
A Schur–Padé Algorithm for Fractional Powers of a Matrix
inferred← citeshttps://doi.org/10.1137/11083352xopenalex-snapshot
Controlling Errors in Recursive Fermi–Dirac Operator Expansions with Applications in Electronic Structure Theory
inferred← citeshttps://doi.org/10.1137/120894294openalex-snapshot
Aggressively Truncated Taylor Series Method for Accurate Computation of Exponentials of Essentially Nonnegative Matrices
inferred← citeshttps://doi.org/10.1137/130911585openalex-snapshot
Interior Eigenvalues from Density Matrix Expansions in Quantum Mechanical Molecular Dynamics
inferred← citeshttps://doi.org/10.1137/140973979openalex-snapshot
New Algorithms for Computing the Matrix Sine and Cosine Separately or Simultaneously
inferred← citeshttps://doi.org/10.1137/14098003xopenalex-snapshot
The Scaling, Splitting, and Squaring Method for the Exponential of Perturbed Matrices
inferred← citeshttps://doi.org/10.1137/16m1057577openalex-snapshot
Matrix Inverse Trigonometric and Inverse Hyperbolic Functions: Theory and Algorithms
inferred← citeshttps://doi.org/10.1137/18m1170352openalex-snapshot
Computing the Wave-Kernel Matrix Functions
inferred← citeshttps://doi.org/10.1137/18m1228876openalex-snapshot
An Arbitrary Precision Scaling and Squaring Algorithm for the Matrix Exponential
inferred← citeshttps://doi.org/10.1137/19m1263431openalex-snapshot
Computing Enclosures for the Matrix Exponential
inferred← citeshttps://doi.org/10.1137/21m1441043openalex-snapshot
Arbitrary Precision Algorithms for Computing the Matrix Cosine and its Fréchet Derivative
showing the first 200 of 291 · page through all 291
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.