On the public citation graph

Reduction theory of positive quadratic forms

https://doi.org/10.1007/bf01117520
0 signed · 17 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.1007/978-3-7091-9536-9_4openalex-snapshot
Diskontinuitätsbereich für arithmetische Äquivalenz
inferredcites →https://doi.org/10.1007/bf02392364openalex-snapshot
Die Reduktionstheorie Der Positiven Quadratischen Formen
inferredcites →https://doi.org/10.1515/crll.1905.129.220openalex-snapshot
Diskontinuitätsbereich für arithmetische Äquivalenz.

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-1-4899-3791-9_5openalex-snapshot
Q
inferred← citeshttps://doi.org/10.1007/978-3-0348-5765-9_7openalex-snapshot
Geometry of Numbers
inferred← citeshttps://doi.org/10.1007/978-3-642-71161-9_112openalex-snapshot
Algorithmische Berechnung von Gitterbasen zur Gütebewertung Linearer Kongruenz-Generatoren
inferred← citeshttps://doi.org/10.1007/978-94-015-1237-4_3openalex-snapshot
Q
inferred← citeshttps://doi.org/10.1007/bf01369078openalex-snapshot
Minkowskische Reduktionsbedingungen f�r positiv definite quadratische Formen in 5 Variablen
inferred← citeshttps://doi.org/10.1007/bf02108244openalex-snapshot
Venkov's reduction theory of positive-quadratic forms
inferred← citeshttps://doi.org/10.1007/bf02240194openalex-snapshot
Calculation of Minkowski-reduced lattice bases
inferred← citeshttps://doi.org/10.1007/s00190-011-0490-yopenalex-snapshot
Parallel Cholesky-based reduction for the weighted integer least squares problem
inferred← citeshttps://doi.org/10.1007/s11401-011-0680-1openalex-snapshot
Greedy algorithm computing minkowski reduced lattice bases with quadratic bit complexity of input vectors
inferred← citeshttps://doi.org/10.1016/s0924-6509(08)70419-7openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1112/s1461157016000292openalex-snapshot
Tuple lattice sieving
inferred← citeshttps://doi.org/10.1145/1597036.1597050openalex-snapshot
Low-dimensional lattice basis reduction revisited
inferred← citeshttps://doi.org/10.48550/arxiv.math/0412320openalex-snapshot
Methods in the Local Theory of Packing and Covering Lattices
inferred← citeshttps://doi.org/10.70675/c696c6f9z870ez4700zbfa5z22607a5a448eopenalex-snapshot
Algorithmic approaches to Siegel's fundamental domain
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.