Skip to content
cs-conference-ranking.org

J. C. Lagarias

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

10

Venues

5

Active years

1979–1997

Best venue rank

A*

Where they publish

Papers

10 indexed papers, newest first.

YearVenueTitleAuthors
1997FOCSThe Computational Complexity of Knot and Link Problems.Joel Hass, J. C. Lagarias, Nicholas Pippenger
1986STACSPolynomial Time Algorithms for Finding Integer Relations Among Real Numbers.Johan Hstad, Bettina Helfrich, J. C. Lagarias, Claus-Peter Schnorr
1984FOCSLinear Congruential Generators Do Not Produce Random SequencesAlan M. Frieze, Ravi Kannan, J. C. Lagarias
1984ICALPPerformance Analysis of Shamir's Attack on the Basic Merkle-Hellman Knapsack Cryptosystem.J. C. Lagarias
1983CRYPTOKnapsack Public Key Cryptosystems and Diophantine Approximation.J. C. Lagarias
1983CRYPTOEvaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems.Ernest F. Brickell, J. C. Lagarias, Andrew M. Odlyzko
1983FOCSSolving Low-Density Subset Sum ProblemsJ. C. Lagarias, Andrew M. Odlyzko
1982FOCSThe Computational Complexity of Simultaneous Diophantine Approximation ProblemsJ. C. Lagarias
1981SIGMODOn the Requirements of Navigational Relationship Representations.Donald E. Swartwout, J. C. Lagarias
1979FOCSSuccinct Certificates for the Solvability of Binary Quadratic Diophantine EquationsJ. C. Lagarias