Jeffrey C. Lagarias
Orcid: 0000-0002-4157-5527Affiliations:
- University of Michigan, Ann Arbor, USA
According to our database1,
Jeffrey C. Lagarias
authored at least 93 papers
between 1977 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on isni.org
On csauthors.net:
Bibliography
2024
2021
Adv. Appl. Math., 2021
2017
Intersections of Multiplicative Translates of 3-Adic Cantor Sets II: Two Infinite Families.
Exp. Math., 2017
2016
2014
Erratum: Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers.
SIAM J. Comput., 2014
2013
2012
SIAM J. Optim., 2012
2009
Proceedings of the Mathematics of Preference, Choice and Order, 2009
2008
2006
Discret. Comput. Geom., 2006
Apollonian Circle Packings: Geometry and Group Theory II. Super-Apollonian Group and Integral Packings.
Discret. Comput. Geom., 2006
2005
Discret. Comput. Geom., 2005
2004
2003
2002
Discret. Comput. Geom., 2002
2001
IEEE Trans. Inf. Theory, 2001
2000
1999
Math. Oper. Res., 1999
Discret. Comput. Geom., 1999
Discret. Comput. Geom., 1999
1998
SIAM J. Optim., 1998
SIAM J. Optim., 1998
1997
Proceedings of the Advances in Neural Information Processing Systems 10, 1997
1996
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996
1995
Discret. Comput. Geom., 1995
Acknowledgment of Priority Concerning Polytopes that Fill R<sup>n</sup> and Scissors Congruence.
Discret. Comput. Geom., 1995
1994
1993
SIAM J. Optim., 1993
A Polyomino Tiling Problem of Thurston and Its Configurational Entropy.
J. Comb. Theory A, 1993
1992
Discret. Comput. Geom., 1992
1991
Discret. Math., 1991
1990
Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice.
Comb., 1990
Singularities of Minimal Surfaces and Networks and Related Extremal Problems in Minkowski Space.
Proceedings of the Discrete and Computational Geometry: Papers from the DIMACS Special Year, 1990
1989
SIAM J. Comput., 1989
1988
SIAM J. Comput., 1988
1987
1986
1985
SIAM J. Comput., 1985
1984
Performance Analysis of Shamir's Attack on the Basic Merkle-Hellman Knapsack Cryptosystem.
Proceedings of the Automata, 1984
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984
1983
Math. Oper. Res., 1983
On the Density of Sequences of Integers the Sum of No Two of Which Is a Square II. General Sequences.
J. Comb. Theory A, 1983
Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems.
Proceedings of the Advances in Cryptology, 1983
Knapsack Public Key Cryptosystems and Diophantine Approximation.
Proceedings of the Advances in Cryptology, 1983
1982
On the Density of Sequences of Integers the Sum of No Two of which Is a Square. I. Arithmetic Progressions.
J. Comb. Theory A, 1982
1981
Proceedings of the 1981 ACM SIGMOD International Conference on Management of Data, Ann Arbor, Michigan, USA, April 29, 1981
1980
Worst-Case Complexity Bounds for Algorithms in the Theory of Integral Quadratic Forms.
J. Algorithms, 1980
1979
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979
1977