Jeffrey C. Lagarias

Affiliations:
  • University of Michigan, Ann Arbor, USA


According to our database1, Jeffrey C. Lagarias authored at least 93 papers between 1977 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The floor quotient partial order.
Adv. Appl. Math., February, 2024

2021
On Toric Orbits in the Affine Sieve.
Exp. Math., 2021

Decimation and interleaving operations in one-sided symbolic dynamics.
Adv. Appl. Math., 2021

2017
Products of Farey Fractions.
Exp. Math., 2017

Intersections of Multiplicative Translates of 3-Adic Cantor Sets II: Two Infinite Families.
Exp. Math., 2017

2016
Dilated Floor Functions That Commute.
Am. Math. Mon., 2016

Erdős, Klarner, and the 3x + 1 Problem.
Am. Math. Mon., 2016

2014
Erratum: Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers.
SIAM J. Comput., 2014

Path sets in one-sided symbolic dynamics.
Adv. Appl. Math., 2014

2013
Moser's Shadow Problem.
CoRR, 2013

2012
Convergence of the Restricted Nelder-Mead Algorithm in Two Dimensions.
SIAM J. Optim., 2012

On Sets of Integers Which Are Both Sum-Free and Product-Free.
Integers, 2012

2009
Very Composite Numbers: 11334 [2008, 71].
Am. Math. Mon., 2009

The Kruskal Count.
Proceedings of the Mathematics of Preference, Choice and Order, 2009

2008
Editor's Endnotes.
Am. Math. Mon., 2008

Problem 11390.
Am. Math. Mon., 2008

Problem 11355.
Am. Math. Mon., 2008

Problem 11389.
Am. Math. Mon., 2008

Problem 11334.
Am. Math. Mon., 2008

2006
Wild and Wooley Numbers.
Am. Math. Mon., 2006

Guest Editors' Foreword.
Discret. Comput. Geom., 2006

Apollonian Circle Packings: Geometry and Group Theory III. Higher Dimensions.
Discret. Comput. Geom., 2006

Apollonian Circle Packings: Geometry and Group Theory II. Super-Apollonian Group and Integral Packings.
Discret. Comput. Geom., 2006

2005
Apollonian Circle Packings: Geometry and Group Theory I. The Apollonian Group.
Discret. Comput. Geom., 2005

2004
The EKG Sequence: 10927.
Am. Math. Mon., 2004

A Generous Bound for Divisor Sums: 10949.
Am. Math. Mon., 2004

Approximate Squaring.
Exp. Math., 2004

2003
Decay of a Markov Chain: 10941.
Am. Math. Mon., 2003

Lower bounds for the total stopping time of 3x + 1 iterates.
Math. Comput., 2003

Substitution Delone Sets.
Discret. Comput. Geom., 2003

2002
Problem 10927.
Am. Math. Mon., 2002

Beyond the Descartes Circle Theorem.
Am. Math. Mon., 2002

Problem 10949.
Am. Math. Mon., 2002

An Elementary Problem Equivalent to the Riemann Hypothesis.
Am. Math. Mon., 2002

Problem 10941.
Am. Math. Mon., 2002

The EKG Sequence.
Exp. Math., 2002

Counting dyadic equipartitions of the unit square.
Discret. Math., 2002

Bounds for Local Density of Sphere Packings and the Kepler Conjecture.
Discret. Comput. Geom., 2002

Pinwheel Scheduling: Achievable Densities.
Algorithmica, 2002

2001
On the robustness of single-loop sigma-Delta modulation.
IEEE Trans. Inf. Theory, 2001

When Periodic Points Are Real: 10822.
Am. Math. Mon., 2001

On the Normality of Arithmetical Constants.
Exp. Math., 2001

2000
Problem 10822.
Am. Math. Mon., 2000

Well-Spaced Labelings of Points in Rectangular Grids.
SIAM J. Discret. Math., 2000

1999
Processor Shadowing: Maximizing Expected Throughput in Fault-Tolerant Systems.
Math. Oper. Res., 1999

The Computational Complexity of Knot and Link Problems.
J. ACM, 1999

Geometric Models for Quasicrystals II. Local Rules Under Isometries.
Discret. Comput. Geom., 1999

Geometric Models for Quasicrystals I. Delone Sets of Finite Type.
Discret. Comput. Geom., 1999

1998
Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions.
SIAM J. Optim., 1998

Threading Homotopies and DC Operating Points of Nonlinear Circuits.
SIAM J. Optim., 1998

Interference-Minimizing Colorings of Regular Graphs.
SIAM J. Discret. Math., 1998

Counting d -Step Paths in Extremal Dantzig Figures.
Discret. Comput. Geom., 1998

Multiregular Point Systems.
Discret. Comput. Geom., 1998

1997
The d-Step Conjecture and Gaussian Elimination.
Discret. Comput. Geom., 1997

Minimax and Hamiltonian Dynamics of Excitatory-Inhibitory Networks.
Proceedings of the Advances in Neural Information Processing Systems 10, 1997

1996
The Parameter Space of the <i>d</i>-step Conjecture.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996

1995
A walk along the branches of the extended Farey Tree.
IBM J. Res. Dev., 1995

The Distribution of 3x+1 Trees.
Exp. Math., 1995

Polytopes that Fill R<sup>n</sup> and Scissors Congruence.
Discret. Comput. Geom., 1995

Acknowledgment of Priority Concerning Polytopes that Fill R<sup>n</sup> and Scissors Congruence.
Discret. Comput. Geom., 1995

1994
Cube-Tilings of R<sup>n</sup> and Nonlinear Codes.
Discret. Comput. Geom., 1994

1993
A Collinear Scaling Interpretation of Karmarkar's Linear Programming Algorithm.
SIAM J. Optim., 1993

A Polyomino Tiling Problem of Thurston and Its Configurational Entropy.
J. Comb. Theory, Ser. A, 1993

1992
Self-Packing of Centrally Symmetric Convex Bodies in R<sup>2</sup>.
Discret. Comput. Geom., 1992

1991
Karmarkar's linear programming algorithm and Newton's method.
Math. Program., 1991

Sets uniquely determined by projections on axes II Discrete case.
Discret. Math., 1991

1990
Tiling with polyominoes and combinatorial group theory.
J. Comb. Theory, Ser. A, 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
A Course in Number Theory and Cryptography (Neil Koblitz).
SIAM Rev., 1989

Single-Suit Two-Person Card Play III. The Misère Game.
SIAM J. Discret. Math., 1989

Polynomial Time Algorithms for Finding Integer Relations among Real Numbers.
SIAM J. Comput., 1989

Algorithms for Packing Squares: A Probabilistic Analysis.
SIAM J. Comput., 1989

1988
Unique Extrapolation of Polynomial Recurrences.
SIAM J. Comput., 1988

Reconstructing Truncated Integer Variables Satisfying Linear Congruences.
SIAM J. Comput., 1988

1987
One-Way Functions and Circuit Complexity
Inf. Comput., September, 1987

Computing pi(x): An Analytic Method.
J. Algorithms, 1987

1986
On the Capacity of Disjointly Shared Networks.
Comput. Networks, 1986

1985
Solving Low-Density Subset Sum Problems
J. ACM, January, 1985

The Computational Complexity of Simultaneous Diophantine Approximation Problems.
SIAM J. Comput., 1985

1984
Performance Analysis of Shamir's Attack on the Basic Merkle-Hellman Knapsack Cryptosystem.
Proceedings of the Automata, 1984

Linear Congruential Generators Do Not Produce Random Sequences
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983
Multi-Stage Planning and the Extended Linear-Quadratic-Gaussian Control Problem.
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, Ser. A, 1983

On the Tightest Packing of Sums of Vectors.
Eur. J. Comb., 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, Ser. A, 1982

Minimal Storage Representations for Binary Relations.
Inf. Process. Lett., 1982

1981
On the Requirements of Navigational Relationship Representations.
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
Succinct Certificates for the Solvability of Binary Quadratic Diophantine Equations
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1977
Minimum range sequences of all k-subsets of a set.
Discret. Math., 1977


  Loading...