On the public citation graph
Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation
0 signed · 46 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.asoc.2018.11.023openalex-snapshot
Towards efficiently searching triple product property triples: Deterministic and randomized algorithms
inferred← citeshttps://doi.org/10.1016/j.cam.2016.03.020openalex-snapshot
A heuristic and evolutionary algorithm to optimize the coefficients of curve parametrizations
inferred← citeshttps://doi.org/10.1016/j.cam.2017.08.008openalex-snapshot
Efficient computation of tridiagonal matrices largest eigenvalue
inferred← citeshttps://doi.org/10.1016/j.cam.2019.03.034openalex-snapshot
An improved verification algorithm for nonlinear systems of equations based on Krawczyk operator
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101966openalex-snapshot
Intersecting disks using two congruent disks
inferred← citeshttps://doi.org/10.1016/j.cose.2022.102740openalex-snapshot
Privacy-Preserving and verifiable SRC -based face recognition with cloud/edge server assistance
inferred← citeshttps://doi.org/10.1016/j.dam.2020.12.028openalex-snapshot
A linear time algorithm for the nullity of vertex-weighted block graphs
inferred← citeshttps://doi.org/10.1016/j.eswa.2017.12.043openalex-snapshot
A machine learning approach to synchronization of automata
inferred← citeshttps://doi.org/10.1016/j.eswa.2018.09.040openalex-snapshot
A Structure-Enriched Neural Network for network embedding
inferred← citeshttps://doi.org/10.1016/j.ins.2017.09.026openalex-snapshot
Sparse regression with output correlation for cardiac ejection fraction estimation
inferred← citeshttps://doi.org/10.1016/j.ins.2024.120147openalex-snapshot
Multi-task subspace clustering
inferred← citeshttps://doi.org/10.1016/j.jco.2018.05.002openalex-snapshot
Modular composition via factorization
inferred← citeshttps://doi.org/10.1016/j.jco.2022.101712openalex-snapshot
On the computation of rational solutions of underdetermined systems over a finite field
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.06.004openalex-snapshot
The complexity of perfect matchings and packings in dense hypergraphs
inferred← citeshttps://doi.org/10.1016/j.jlamp.2020.100633openalex-snapshot
Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
inferred← citeshttps://doi.org/10.1016/j.jpaa.2022.107142openalex-snapshot
Bounds on complexity of matrix multiplication away from Coppersmith–Winograd tensors
inferred← citeshttps://doi.org/10.1016/j.jsc.2014.08.009openalex-snapshot
Separating linear forms and Rational Univariate Representations of bivariate systems
inferred← citeshttps://doi.org/10.1016/j.jsc.2014.09.024openalex-snapshot
Constructing a single cell in cylindrical algebraic decomposition
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.017openalex-snapshot
Tame decompositions and collisions
inferred← citeshttps://doi.org/10.1016/j.jsc.2016.05.001openalex-snapshot
Matrix-F5 algorithms over finite-precision complete discrete valuation fields
inferred← citeshttps://doi.org/10.1016/j.jsc.2016.07.017openalex-snapshot
Mixed cell computation in Hom4PS-3
inferred← citeshttps://doi.org/10.1016/j.jsc.2016.08.005openalex-snapshot
Border bases for lattice ideals
inferred← citeshttps://doi.org/10.1016/j.jsc.2016.08.007openalex-snapshot
The maximum likelihood data singular locus
inferred← citeshttps://doi.org/10.1016/j.jsc.2016.11.018openalex-snapshot
Formal solutions of completely integrable Pfaffian systems with normal crossings
inferred← citeshttps://doi.org/10.1016/j.jsc.2017.03.004openalex-snapshot
Certifying solutions to overdetermined and singular polynomial systems over Q
inferred← citeshttps://doi.org/10.1016/j.jsc.2017.03.009openalex-snapshot
A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
inferred← citeshttps://doi.org/10.1016/j.jsc.2017.07.009openalex-snapshot
Solving rank-constrained semidefinite programs in exact arithmetic
inferred← citeshttps://doi.org/10.1016/j.jsc.2018.08.003openalex-snapshot
Formal solutions of singularly-perturbed linear differential systems
inferred← citeshttps://doi.org/10.1016/j.jsc.2019.07.019openalex-snapshot
Cylindrical algebraic decomposition with equational constraints
inferred← citeshttps://doi.org/10.1016/j.jsc.2019.10.012openalex-snapshot
On affine tropical F5 algorithms
inferred← citeshttps://doi.org/10.1016/j.jsc.2020.12.001openalex-snapshot
A generic and executable formalization of signature-based Gröbner basis algorithms
inferred← citeshttps://doi.org/10.1016/j.jsc.2022.01.003openalex-snapshot
Heuristics to sift extraneous factors in Dixon resultants
inferred← citeshttps://doi.org/10.1016/j.knosys.2020.105512openalex-snapshot
Subspace clustering by simultaneously feature selection and similarity learning
inferred← citeshttps://doi.org/10.1016/j.laa.2016.06.036openalex-snapshot
Algebraic boundary of matrices of nonnegative rank at most three
inferred← citeshttps://doi.org/10.1016/j.sigpro.2018.01.008openalex-snapshot
Joint equalization-despreading method for OQAM-CDMA systems
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/j.tcs.2020.03.005openalex-snapshot
Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.08.031openalex-snapshot
Parameterized complexity of determinant and permanent
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.02.034openalex-snapshot
Realization problems on reachability sequences
inferred← citeshttps://doi.org/10.1016/j.tpb.2019.11.005openalex-snapshot
Fast likelihood calculation for multivariate Gaussian phylogenetic models with shifts
inferred← citeshttps://doi.org/10.1093/nsr/nwv011openalex-snapshot
The impact of AI—can a robot get into the University of Tokyo?
inferred← citeshttps://doi.org/10.1103/physreva.109.052619openalex-snapshot
Synthesis of V-count-optimal quantum circuits for multiqubit unitaries
inferred← citeshttps://doi.org/10.2139/ssrn.6178286openalex-snapshot
Symbolic Mathematical Computation 1965–1975: The emergence of a discipline
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.