On the public citation graph
Algorithmic aspects of Suslin's proof of Serre's conjecture
0 signed · 45 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/mana.19901490118openalex-snapshot
Nullstellensatz effectif et Conjecture de Serre (Théorème de Quillen‐Suslin) pour le Calcul Formel
inferredcites →https://doi.org/10.1007/3-540-51083-4_54openalex-snapshot
Some new effectivity bounds in computational geometry
inferredcites →https://doi.org/10.1007/978-1-4612-0441-1_3openalex-snapshot
Local Membership Problems for Polynomial Ideals
inferredcites →https://doi.org/10.1007/978-3-322-85526-8openalex-snapshot
Einführung in die kommutative Algebra und algebraische Geometrie
inferredcites →https://doi.org/10.1007/978-94-009-5225-6_6openalex-snapshot
Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory
inferredcites →https://doi.org/10.1007/bf01206635openalex-snapshot
Die Frage der endlich vielen Schritte in der Theorie der Polynomideale
inferredcites →https://doi.org/10.1007/bfb0016236openalex-snapshot
Parallel arithmetic computations: A survey
inferredcites →https://doi.org/10.1007/bfb0028792openalex-snapshot
Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic
inferredcites →https://doi.org/10.1016/0001-8708(82)90048-2openalex-snapshot
The complexity of the word problems for commutative semigroups and polynomial ideals
inferredcites →https://doi.org/10.1016/0020-0190(84)90018-8openalex-snapshot
On computing the determinant in small parallel time using a small number of processors
inferredcites →https://doi.org/10.1016/0021-8693(92)90189-sopenalex-snapshot
Algorithms for the Quillen-Suslin theorem
inferredcites →https://doi.org/10.1016/s0747-7171(88)80039-7openalex-snapshot
On the complexity of computing syzygies
inferredcites →https://doi.org/10.1090/s0002-9947-1974-0349648-2openalex-snapshot
Constructions in Algebra
inferredcites →https://doi.org/10.1090/s0894-0347-1988-0944576-7openalex-snapshot
Sharp Effective Nullstellensatz
inferredcites →https://doi.org/10.1145/12130.12164openalex-snapshot
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
inferredcites →https://doi.org/10.2307/1971361openalex-snapshot
Bounds for the Degrees in the Nullstellensatz
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jabr.1995.1349openalex-snapshot
An Algorithmic Proof of Suslin′s Stability Theorem for Polynomial Rings
inferred← citeshttps://doi.org/10.1006/jsco.2000.0367openalex-snapshot
An Algorithm for the Quillen–Suslin Theorem for Quotients of Polynomial Rings by Monomial Ideals
inferred← citeshttps://doi.org/10.1007/978-3-319-19494-3_2openalex-snapshot
Projective Modules Over Polynomial Rings
inferred← citeshttps://doi.org/10.1007/978-3-319-19494-3_6openalex-snapshot
Detailed Solutions to the Exercises
inferred← citeshttps://doi.org/10.1007/978-3-540-34575-6_12openalex-snapshot
References for Chapter VIII
inferred← citeshttps://doi.org/10.1007/978-3-642-60539-0_20openalex-snapshot
The Space Complexity of Elimination Theory: Upper Bounds
inferred← citeshttps://doi.org/10.1007/pl00004746openalex-snapshot
On the degrees of bases of free modulesover a polynomial ring
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2006.01.051openalex-snapshot
Dynamical Gröbner bases
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2007.02.034openalex-snapshot
An algorithm for unimodular completion over Noetherian rings
inferred← citeshttps://doi.org/10.1016/j.jsc.2005.01.004openalex-snapshot
Suslin’s algorithms for reduction of unimodular rows
inferred← citeshttps://doi.org/10.1016/j.jsc.2019.02.003openalex-snapshot
Bounding the degrees of a minimal μ-basis for a rational surface parametrization
inferred← citeshttps://doi.org/10.1016/j.jsc.2022.08.004openalex-snapshot
Bounds for degrees of syzygies of polynomials defining a grade two ideal
inferred← citeshttps://doi.org/10.1016/j.jsc.2025.102445openalex-snapshot
Elimination by substitution
inferred← citeshttps://doi.org/10.1016/j.jsc.2025.102530openalex-snapshot
Equi-affine minimal-degree moving frames for polynomial curves
inferred← citeshttps://doi.org/10.1016/j.laa.2004.11.007openalex-snapshot
A generic effective Nullstellensatz
inferred← citeshttps://doi.org/10.1016/s0022-4049(00)00135-3openalex-snapshot
Computing bases of complete intersection rings in Noether position
inferred← citeshttps://doi.org/10.1016/s0022-4049(97)00020-0openalex-snapshot
An algorithm for the Quillen-Suslin theorem for monoid rings
inferred← citeshttps://doi.org/10.1080/23799927.2024.2309485openalex-snapshot
Digital signature schemes using non-square matrices or scrap automorphisms
inferred← citeshttps://doi.org/10.1090/conm/835/16758openalex-snapshot
Geometric generality of Transformer-based Gröbner basis computation
inferred← citeshttps://doi.org/10.1109/ssp.2003.1289440openalex-snapshot
Minimum fir deconvolver orders for mimo systems in one or several variables
inferred← citeshttps://doi.org/10.1109/tsp.2009.2025826openalex-snapshot
Generic Invertibility of Multidimensional FIR Filter Banks and MIMO Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1605.04832openalex-snapshot
Commutative algebra: Constructive methods. Finite projective modules
inferred← citeshttps://doi.org/10.48550/arxiv.1703.03014openalex-snapshot
Degree-optimal moving frames for rational curves
inferred← citeshttps://doi.org/10.48550/arxiv.alg-geom/9405003openalex-snapshot
An Algorithmic Proof of Suslin's Stability Theorem over Polynomial Rings
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.