Who Cited It

Lattice basis reduction: Improved practical algorithms and solving subset sum problems

1994 · Mathematical Programming · 1,429 citations · 2 from inside this corpus

C. P. Schnorr, M. Euchner low

No abstract in the source record.

Lattice basis reduction: Improved practical algorithms and solving subset sum problems (1994)Lattice basis reduction: Impr…Factoring polynomials with rational coefficients (1982)Factoring polynomials with ra…NTRU: A ring-based public key cryptosystem (1998)NTRU: A ring-based public key…Closest point search in lattices (2002)Closest point search in latti…
3 of 3 neighbouring works in this corpus. Blue is what this paper cites; orange is what cites it, and a dashed line is one neighbour citing another. Only the largest labels are drawn — every node carries its full title on hover.
this paper works it cites works citing it node size = global citations · hover for the full title

What this paper cites, inside the corpus

PaperYearCited
Factoring polynomials with rational coefficients19824,041

What cites it, inside the corpus

PaperYearCited
NTRU: A ring-based public key cryptosystem19981,894
Closest point search in lattices20021,450

Links

DOI · OpenAlex record

Topics

Machine Learning and AlgorithmsComputer Science
Cryptography and Data SecurityComputer Science
Complexity and Algorithms in GraphsComputer Science

Is this record sound?

complete

Nothing in this record contradicts itself and no field we check is missing.

  • supports2 author record(s) attached.
  • supports28 reference(s) recorded.
  • neutralThe DOI carries no year to check against.
  • supportsA title is present.

Provenance

Everything above was read from one stored OpenAlex payload, fetched 2026-09-04T03:58:59+00:00.

sha256 59007f057c7dae86…