On the public citation graph

Efficient polynomial L-approximations

0 signed · 82 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/jcss.1999.1686openalex-snapshot
On the Limits of Nonapproximability of Lattice Problems
inferredcites →https://doi.org/10.1007/3-540-44670-2_12openalex-snapshot
The Two Faces of Lattices in Cryptology
inferredcites →https://doi.org/10.1007/978-0-8176-8259-0openalex-snapshot
Numerical Analysis
inferredcites →https://doi.org/10.1007/978-1-4757-2646-6openalex-snapshot
Elementary Functions
inferredcites →https://doi.org/10.1007/978-3-0348-5765-9_7openalex-snapshot
Geometry of Numbers
inferredcites →https://doi.org/10.1007/978-3-642-62035-5openalex-snapshot
An Introduction to the Geometry of Numbers
inferredcites →https://doi.org/10.1007/bf01386215openalex-snapshot
On the numerical determination of the best approximations in the Chebyshev sense
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bf02579403openalex-snapshot
On Lovász’ lattice reduction and the nearest lattice point problem
inferredcites →https://doi.org/10.1016/b978-0-12-294760-5.50015-5openalex-snapshot
ELEMENTARY FUNCTIONS
inferredcites →https://doi.org/10.1109/18.915688openalex-snapshot
The hardness of the closest vector problem with preprocessing
inferredcites →https://doi.org/10.1109/arith.1999.762822openalex-snapshot
New algorithms for improved transcendental functions on IA-64
inferredcites →https://doi.org/10.1109/tit.2002.800499openalex-snapshot
Closest point search in lattices
inferredcites →https://doi.org/10.1137/1.9781611970203openalex-snapshot
An Algorithmic Theory of Numbers, Graphs and Convexity
inferredcites →https://doi.org/10.1145/1141885.1141890openalex-snapshot
Computing machine-efficient polynomial approximations
inferredcites →https://doi.org/10.1287/moor.12.3.415openalex-snapshot
Minkowski's Convex Body Theorem and Integer Programming
inferredcites →https://doi.org/10.2307/2004443openalex-snapshot
Introduction to Approximation Theory
inferredcites →https://doi.org/10.5860/choice.35-2759openalex-snapshot
Elementary functions: algorithms and implementation

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-0-8176-4705-6_11openalex-snapshot
Evaluating Floating-Point Elementary Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-25543-5_11openalex-snapshot
Sound Approximation of Programs with Elementary Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-31784-3_17openalex-snapshot
Synthesizing Efficient Low-Precision Kernels
inferred← citeshttps://doi.org/10.1007/978-3-031-42808-1_17openalex-snapshot
Function Evaluation Using Tables and Additions
inferred← citeshttps://doi.org/10.1007/978-3-031-42808-1_18openalex-snapshot
Polynomial-Based Architectures for Function Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-319-31769-4_2openalex-snapshot
Replacing Branches by Polynomials in Vectorizable Elementary Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-76526-6_10openalex-snapshot
Evaluating Floating-Point Elementary Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_26openalex-snapshot
Speeding-Up Lattice Reduction with Random Projections (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-28891-3_9openalex-snapshot
Rigorous Polynomial Approximation Using Taylor Models in Coq
inferred← citeshttps://doi.org/10.1007/978-3-642-55224-3_9openalex-snapshot
Methods for High-Throughput Computation of Elementary Functions
inferred← citeshttps://doi.org/10.1007/s11227-021-03937-8openalex-snapshot
Design of variable precision transcendental function automatic generator
inferred← citeshttps://doi.org/10.1016/j.amc.2011.03.032openalex-snapshot
Explicit solution of the finite time L2-norm polynomial approximation problem
inferred← citeshttps://doi.org/10.1017/s0962492922000101openalex-snapshot
Floating-point arithmetic
inferred← citeshttps://doi.org/10.1109/acssc.2014.7094664openalex-snapshot
A domain splitting algorithm for the mathematical functions code generator
inferred← citeshttps://doi.org/10.1109/acssc.2016.7869070openalex-snapshot
A new open-source SIMD vector libm fully implemented with high-level scalar C
inferred← citeshttps://doi.org/10.1109/arith.2007.38openalex-snapshot
Floating-point L^2 -approximations to functions
inferred← citeshttps://doi.org/10.1109/arith.2015.22openalex-snapshot
Code Generators for Mathematical Functions
inferred← citeshttps://doi.org/10.1109/arith.2018.8464778openalex-snapshot
A High Throughput Polynomial and Rational Function Approximations Evaluator
inferred← citeshttps://doi.org/10.1109/arith.2019.00014openalex-snapshot
Exchange Algorithm for Evaluation and Approximation Error-Optimized Polynomials
inferred← citeshttps://doi.org/10.1109/arith.2019.00042openalex-snapshot
Reflections on 10 Years of FloPoCo
inferred← citeshttps://doi.org/10.1109/arith58626.2023.00029openalex-snapshot
Towards Machine-Efficient Rational L∞-Approximations of Mathematical Functions
inferred← citeshttps://doi.org/10.1109/asap.2008.4580185openalex-snapshot
An efficient method for evaluating polynomial and rational function approximations
inferred← citeshttps://doi.org/10.1109/asap.2010.5540952openalex-snapshot
Automatic generation of polynomial-based hardware architectures for function evaluation
inferred← citeshttps://doi.org/10.1109/fpl.2018.00015openalex-snapshot
Activation Function Architectures for FPGAs
inferred← citeshttps://doi.org/10.1109/icassp.2010.5495516openalex-snapshot
Implementing LNS using filtering units of GPUs
inferred← citeshttps://doi.org/10.1109/ipdpsw50202.2020.00074openalex-snapshot
Two-Pass Softmax Algorithm
inferred← citeshttps://doi.org/10.1109/jproc.2020.2991885openalex-snapshot
Elementary Functions and Approximate Computing
inferred← citeshttps://doi.org/10.1109/tc.2008.223openalex-snapshot
An Optimized Cell BE Special Function Library Generated by Coconut
inferred← citeshttps://doi.org/10.1109/tc.2010.127openalex-snapshot
Elementary Functions Hardware Implementation Using Constrained Piecewise-Polynomial Approximations
inferred← citeshttps://doi.org/10.1109/tc.2017.2703870openalex-snapshot
Exact Lookup Tables for the Evaluation of Trigonometric and Hyperbolic Functions
inferred← citeshttps://doi.org/10.1109/tc.2019.2940949openalex-snapshot
FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers
inferred← citeshttps://doi.org/10.1109/tc.2025.3543676openalex-snapshot
An Efficient Methodology for Binary Logarithmic Computations of Floating-Point Numbers With Normalized Output Within One ulp of Accuracy
inferred← citeshttps://doi.org/10.1109/tcsii.2021.3131405openalex-snapshot
Lossless Differential Table Compression for Hardware Function Evaluation
inferred← citeshttps://doi.org/10.1109/tsp.2018.2812739openalex-snapshot
A Lattice Basis Reduction Approach for the Design of Finite Wordlength FIR Filters
inferred← citeshttps://doi.org/10.1137/1.9781611973105.78openalex-snapshot
Lattice Sparsification and the Approximate Closest Vector Problem
inferred← citeshttps://doi.org/10.1142/s0218194023500675openalex-snapshot
SCR-LIBM: A Correctly Rounded Elementary Function Library in Double-Precision
inferred← citeshttps://doi.org/10.1145/1277548.1277597openalex-snapshot
Certification of the QR factor R and of lattice basis reducedness
inferred← citeshttps://doi.org/10.1145/1644001.1644005openalex-snapshot
Computing correctly rounded integer powers in floating-point arithmetic
inferred← citeshttps://doi.org/10.1145/1878537.1878625openalex-snapshot
Machine-efficient Chebyshev approximation for exact arithmetic
inferred← citeshttps://doi.org/10.1145/3434310openalex-snapshot
An approach to generate correctly rounded math libraries for new floating point variants
inferred← citeshttps://doi.org/10.1145/3453483.3454049openalex-snapshot
High performance correctly rounded math libraries for 32-bit floating point representations
inferred← citeshttps://doi.org/10.1145/3498664openalex-snapshot
One polynomial approximation to produce correctly rounded results of an elementary function for multiple representations and rounding modes
inferred← citeshttps://doi.org/10.1145/3543670openalex-snapshot
Formal Verification of Transcendental Fixed- and Floating-point Algorithms using an Automatic Theorem Prover
inferred← citeshttps://doi.org/10.1145/3566097.3567840openalex-snapshot
Automatic Generation of Complete Polynomial Interpolation Design Space for Hardware Architectures
inferred← citeshttps://doi.org/10.1145/3579990.3580022openalex-snapshot
Fast Polynomial Evaluation for Correctly Rounded Elementary Functions using the RLIBM Approach
inferred← citeshttps://doi.org/10.1145/3708472openalex-snapshot
Optimal Approximation of the 1/ x Function using Chebyshev Polynomials and Magic Constants
inferred← citeshttps://doi.org/10.1145/3729332openalex-snapshot
Correctly Rounded Math Libraries without Worrying about the Application’s Rounding Mode
inferred← citeshttps://doi.org/10.1145/3814576.3814578openalex-snapshot
Systematic Function Approximation on FPGAs to Address Accuracy and Throughput Issues in oneAPI and Vitis HLS Math Libraries
inferred← citeshttps://doi.org/10.1155/2015/843851openalex-snapshot
A Domain-Specific Architecture for Elementary Function Evaluation
inferred← citeshttps://doi.org/10.26089/nummet.v27r103openalex-snapshot
Высокопроизводительная реализация экспоненциальных.функций для процессоров архитектуры RISC-V
inferred← citeshttps://doi.org/10.3390/electronics11193141openalex-snapshot
swAFL: A Library of High-Performance Activation Function for the Sunway Architecture
inferred← citeshttps://doi.org/10.4086/toc.2016.v012a002openalex-snapshot
inferred← citeshttps://doi.org/10.48550/arxiv.0803.0439openalex-snapshot
Optimizing polynomials for floating-point implementation
inferred← citeshttps://doi.org/10.48550/arxiv.2108.06756openalex-snapshot
RLIBM-ALL: A Novel Polynomial Approximation Method to Produce Correctly Rounded Results for Multiple Representations and Rounding Modes
inferred← citeshttps://doi.org/10.48550/arxiv.2111.12852openalex-snapshot
RLIBM-PROG: Progressive Polynomial Approximations for Fast Correctly Rounded Math Libraries
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0701183openalex-snapshot
Certification of the QR factor R, and of lattice basis reducedness
inferred← citeshttps://doi.org/10.70675/5d5d6196zf00cz4463zbfe0z4e1add495b6aopenalex-snapshot
Towards a modern floating-point environment
inferred← citeshttps://doi.org/10.70675/92f81995z9354z4895zaa41zbeb79914d44aopenalex-snapshot
Elementary functions : towards automatically generated, efficient, and vectorizable implementations
inferred← citeshttps://doi.org/10.70675/acaf214bz951ez4360za718z0aba8b1bb53fopenalex-snapshot
Calcul numérique certifié dans les espaces fonctionnels : Un trilogue entre approximations polynomiales rigoureuses, calcul symbolique et preuve formelle
inferred← citeshttps://doi.org/10.70675/ceee3d16z5a90z4cb1z812ezc2c8d397816eopenalex-snapshot
Extended security of lattice-based cryptography
inferred← citeshttps://doi.org/10.70675/e4216984z79fbz4861za70cz2a2caeeba98dopenalex-snapshot
Robust tools for weighted Chebyshev approximation and applications to digital filter design
inferred← citeshttps://doi.org/10.70675/ec85a22az4069z4564zaa51zc91b5fe41b8bopenalex-snapshot
High-performance floating-point computing on reconfigurable circuits
inferred← citeshttps://doi.org/10.70675/ef42591ez87aez41afzb2e8z991fe149323dopenalex-snapshot
Rigorous Polynomial Approximations and Applications
inferred← citeshttps://doi.org/10.7282/t3-z898-ft43openalex-snapshot
A novel approach to generate correctly rounded math libraries for new floating point representations
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.