On the public citation graph

Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation

https://doi.org/10.1145/3208976

0 signed · 26 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 points at this work

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

inferred← citeshttps://doi.org/10.1016/0890-5401(92)90049-lopenalex-snapshot

Resolution approximation of first-order logics

inferred← citeshttps://doi.org/10.1016/j.cad.2019.05.019openalex-snapshot

Implicitizing rational curves by the method of moving quadrics

inferred← citeshttps://doi.org/10.1016/j.cam.2021.113553openalex-snapshot

Certified numerical algorithm for isolating the singularities of the plane projection of generic smooth space curves

inferred← citeshttps://doi.org/10.1016/j.cnsns.2024.107816openalex-snapshot

Exact hierarchical reductions of dynamical models via linear transformations

inferred← citeshttps://doi.org/10.1016/j.cola.2022.101135openalex-snapshot

A novel data-driven approach on inferring loop invariants for C programs

inferred← citeshttps://doi.org/10.1016/j.cpc.2023.108990openalex-snapshot

A Bi−directional method for evaluating integrals involving higher transcendental functions. HyperRAF: A Julia package for new hyper−radial functions

inferred← citeshttps://doi.org/10.1016/j.cpc.2024.109261openalex-snapshot

FIRE 6.5: Feynman integral reduction with new simplification library

inferred← citeshttps://doi.org/10.1016/j.jalgebra.2024.07.033openalex-snapshot

A classification of polyharmonic Maaß forms via quiver representations

inferred← citeshttps://doi.org/10.1016/j.jco.2022.101666openalex-snapshot

Computing Riemann–Roch spaces via Puiseux expansions

inferred← citeshttps://doi.org/10.1016/j.jpaa.2024.107638openalex-snapshot

On the degree of varieties of sum of squares

inferred← citeshttps://doi.org/10.1016/j.jsc.2019.10.015openalex-snapshot

On the maximal number of real embeddings of minimally rigid graphs in R2, R3 and S2

inferred← citeshttps://doi.org/10.1016/j.jsc.2020.06.005openalex-snapshot

Multilinear polynomial systems: Root isolation and bit complexity

inferred← citeshttps://doi.org/10.1016/j.jsc.2020.10.002openalex-snapshot

Fast transforms over finite fields of characteristic two

inferred← citeshttps://doi.org/10.1016/j.jsc.2022.10.002openalex-snapshot

Computing critical points for invariant algebraic systems

inferred← citeshttps://doi.org/10.1016/j.jsc.2023.102232openalex-snapshot

The Smith normal form and reduction of weakly linear matrices

inferred← citeshttps://doi.org/10.1016/j.jsc.2023.102235openalex-snapshot

Computing with Tarski formulas and semi-algebraic sets in a web browser

inferred← citeshttps://doi.org/10.1016/j.jsc.2024.102298openalex-snapshot

Computing the binomial part of a polynomial ideal

inferred← citeshttps://doi.org/10.1016/j.jsc.2024.102311openalex-snapshot

Computing a group action from the class field theory of imaginary hyperelliptic function fields

inferred← citeshttps://doi.org/10.1016/j.jsc.2024.102314openalex-snapshot

Solving polynomial systems over non-fields and applications to modular polynomial factoring

inferred← citeshttps://doi.org/10.1016/j.jsc.2025.102481openalex-snapshot

Simultaneous rational number codes: Decoding beyond half the minimum distance with multiplicities and bad primes

inferred← citeshttps://doi.org/10.1016/j.jsc.2025.102487openalex-snapshot

Bigraded Castelnuovo-Mumford regularity and Gröbner bases

inferred← citeshttps://doi.org/10.1103/y3xz-t2w8openalex-snapshot

Rotations, Negative Eigenvalues, and Newton Method in Tensor Network Renormalization Group

inferred← citeshttps://doi.org/10.1137/19m1307871openalex-snapshot

TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity

inferred← citeshttps://doi.org/10.1145/3632876openalex-snapshot

On Learning Polynomial Recursive Programs

inferred← citeshttps://doi.org/10.2139/ssrn.6178286openalex-snapshot

Symbolic Mathematical Computation 1965–1975: The emergence of a discipline

inferred← citeshttps://doi.org/10.5167/uzh-205620openalex-snapshot

Roos bound for skew cyclic codes in Hamming and rank metric

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.