On the public citation graph
Gauss: a parameterized domain of computation system with support for signature functions
0 signed · 27 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/978-1-4615-7386-9openalex-snapshot
Maple V Language Reference Manual
inferredcites →https://doi.org/10.1016/0022-314x(80)90084-0openalex-snapshot
Probabilistic algorithm for testing primality
inferredcites →https://doi.org/10.1016/0747-7171(92)90005-oopenalex-snapshot
A heuristic irreducibility test for univariate polynomials
inferredcites →https://doi.org/10.1137/0206006openalex-snapshot
A Fast Monte-Carlo Test for Primality
inferredcites →https://doi.org/10.1145/322217.322225openalex-snapshot
Fast Probabilistic Algorithms for Verification of Polynomial Identities
inferredcites →https://doi.org/10.1145/32439.32465openalex-snapshot
New results for random determination of equivalence of expressions
inferredcites →https://doi.org/10.1145/800057.808698openalex-snapshot
Determining equivalence of expressions in random polynomial time
inferredcites →https://doi.org/10.5860/choice.30-3868openalex-snapshot
AXIOM: the scientific computation system
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jsco.1996.0104openalex-snapshot
Teaching Computational Abstract Algebra
inferred← citeshttps://doi.org/10.1006/jsco.2000.0370openalex-snapshot
Challenges of Symbolic Computation: My Favorite Open Problems
inferred← citeshttps://doi.org/10.1007/11856290_22openalex-snapshot
Hierarchical Representations with Signatures for Large Expression Management
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_2openalex-snapshot
Abstract Data Types in Computer Algebra
inferred← citeshttps://doi.org/10.1007/3-540-61697-7_11openalex-snapshot
Conditional categories and domains
inferred← citeshttps://doi.org/10.1007/3-540-63163-1_2openalex-snapshot
Efficient multivariate factorization over finite fields
inferred← citeshttps://doi.org/10.1007/978-3-031-41724-5_20openalex-snapshot
Efficient Quotients of Non-commutative Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-642-31374-5_16openalex-snapshot
Towards the Formal Specification and Verification of Maple Programs
inferred← citeshttps://doi.org/10.1007/978-3-7643-7984-1_20openalex-snapshot
Symbolic Computation Sequences and Numerical Analytic Geometry Applied to Multibody Dynamical Systems
inferred← citeshttps://doi.org/10.1145/190347.190357openalex-snapshot
How to make AXIOM into a scratchpad
inferred← citeshttps://doi.org/10.1145/190347.190430openalex-snapshot
Signature functions for algebraic numbers
inferred← citeshttps://doi.org/10.1145/190347.190434openalex-snapshot
Algorithms for type inference with coercions
inferred← citeshttps://doi.org/10.3929/ethz-a-003828824openalex-snapshot
Factorization of multivariate polynomials over finite fields
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.