Minimum range sequences of all k-subsets of a set. - Frank K. Hwang; J. C. Lagarias 001 (Discret. Math., 1977)

Succinct Certificates for the Solvability of Binary Quadratic Diophantine Equations - J. C. Lagarias 001 (FOCS, 1979)

Worst-Case Complexity Bounds for Algorithms in the Theory of Integral Quadratic Forms. - J. C. Lagarias 001 (J. Algorithms, 1980)

On the Requirements of Navigational Relationship Representations. - Donald E. Swartwout; J. C. Lagarias 001 (SIGMOD Conference, 1981)

Minimal Storage Representations for Binary Relations. - J. C. Lagarias 001; Donald E. Swartwout (Inf. Process. Lett., 1982)

On the Density of Sequences of Integers the Sum of No Two of which Is a Square. I. Arithmetic Progressions. - J. C. Lagarias 001; Andrew M. Odlyzko; James B. Shearer (J. Comb. Theory A, 1982)

Knapsack Public Key Cryptosystems and Diophantine Approximation. - J. C. Lagarias 001 (CRYPTO, 1983)

Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems. - Ernest F. Brickell; J. C. Lagarias 001; Andrew M. Odlyzko (CRYPTO, 1983)

On the Tightest Packing of Sums of Vectors. - Jerrold R. Griggs; Jeffrey C. Lagarias; Andrew M. Odlyzko; James B. Shearer (Eur. J. Comb., 1983)

On the Density of Sequences of Integers the Sum of No Two of Which Is a Square II. General Sequences. - J. C. Lagarias 001; Andrew M. Odlyzko; James B. Shearer (J. Comb. Theory A, 1983)

Multi-Stage Planning and the Extended Linear-Quadratic-Gaussian Control Problem. - J. C. Lagarias 001; F. Aminzadeh (Math. Oper. Res., 1983)

Linear Congruential Generators Do Not Produce Random Sequences - Alan M. Frieze; Ravi Kannan; J. C. Lagarias 001 (FOCS, 1984)

Performance Analysis of Shamir's Attack on the Basic Merkle-Hellman Knapsack Cryptosystem. - J. C. Lagarias 001 (ICALP, 1984)

The Computational Complexity of Simultaneous Diophantine Approximation Problems. - J. C. Lagarias 001 (SIAM J. Comput., 1985)

Solving Low-Density Subset Sum Problems - J. C. Lagarias 001; Andrew M. Odlyzko (J. ACM, 1985)

On the Capacity of Disjointly Shared Networks. - J. C. Lagarias 001; Andrew M. Odlyzko; Don Zagier (Comput. Networks, 1986)

Computing pi(x): An Analytic Method. - J. C. Lagarias 001; Andrew M. Odlyzko (J. Algorithms, 1987)

One-Way Functions and Circuit Complexity - Ravi B. Boppana; J. C. Lagarias 001 (Inf. Comput., 1987)

Reconstructing Truncated Integer Variables Satisfying Linear Congruences. - Alan M. Frieze; Johan Håstad; Ravi Kannan; J. C. Lagarias 001; Adi Shamir (SIAM J. Comput., 1988)

Unique Extrapolation of Polynomial Recurrences. - J. C. Lagarias 001; James A. Reeds (SIAM J. Comput., 1988)

Algorithms for Packing Squares: A Probabilistic Analysis. - Edward G. Coffman Jr.; J. C. Lagarias 001 (SIAM J. Comput., 1989)

Polynomial Time Algorithms for Finding Integer Relations among Real Numbers. - Johan Håstad; Bettina Just; J. C. Lagarias 001; Claus-Peter Schnorr (SIAM J. Comput., 1989)

Single-Suit Two-Person Card Play III. The Misère Game. - Jeff Kahn 001; J. C. Lagarias 001; Hans S. Witsenhausen (SIAM J. Discret. Math., 1989)

A Course in Number Theory and Cryptography (Neil Koblitz). - Jeffrey C. Lagarias (SIAM Rev., 1989)

Singularities of Minimal Surfaces and Networks and Related Extremal Problems in Minkowski Space. - Zoltán Füredi; Jeffrey C. Lagarias; Frank Morgan (Discrete and Computational Geometry, 1990)

Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. - J. C. Lagarias 001; Hendrik W. Lenstra Jr.; Claus-Peter Schnorr (Comb., 1990)

Tiling with polyominoes and combinatorial group theory. - John H. Conway; Jeffrey C. Lagarias (J. Comb. Theory A, 1990)

Sets uniquely determined by projections on axes II Discrete case. - Peter C. Fishburn; J. C. Lagarias 001; James A. Reeds; Larry A. Shepp (Discret. Math., 1991)

Karmarkar's linear programming algorithm and Newton's method. - D. A. Bayer; Jeffrey C. Lagarias (Math. Program., 1991)

Self-Packing of Centrally Symmetric Convex Bodies in R2. - P. G. Doyle; J. C. Lagarias 001; Dana Randall (Discret. Comput. Geom., 1992)

A Polyomino Tiling Problem of Thurston and Its Configurational Entropy. - J. C. Lagarias 001; D. S. Romano (J. Comb. Theory A, 1993)

A Collinear Scaling Interpretation of Karmarkar's Linear Programming Algorithm. - Jeffrey C. Lagarias (SIAM J. Optim., 1993)

Cube-Tilings of Rn and Nonlinear Codes. - J. C. Lagarias 001; Peter W. Shor (Discret. Comput. Geom., 1994)

Acknowledgment of Priority Concerning Polytopes that Fill Rn and Scissors Congruence. - J. C. Lagarias 001; David Moews (Discret. Comput. Geom., 1995)

Polytopes that Fill Rn and Scissors Congruence. - J. C. Lagarias 001; David Moews (Discret. Comput. Geom., 1995)

The Distribution of 3x+1 Trees. - David L. Applegate; Jeffrey C. Lagarias (Exp. Math., 1995)

A walk along the branches of the extended Farey Tree. - Jeffrey C. Lagarias; Charles Philippe Tresser (IBM J. Res. Dev., 1995)

The Parameter Space of the d-step Conjecture. - J. C. Lagarias 001; Nagabhushana Prabhu; James A. Reeds (FSTTCS, 1996)

Minimax and Hamiltonian Dynamics of Excitatory-Inhibitory Networks. - H. Sebastian Seung; Tom J. Richardson; J. C. Lagarias 001; John J. Hopfield (NIPS, 1997)

The d-Step Conjecture and Gaussian Elimination. - J. C. Lagarias 001; Nagabhushana Prabhu; James A. Reeds (Discret. Comput. Geom., 1997)

Multiregular Point Systems. - Nikolai P. Dolbilin; J. C. Lagarias 001; Marjorie Senechal (Discret. Comput. Geom., 1998)

Counting d -Step Paths in Extremal Dantzig Figures. - J. C. Lagarias 001; Nagabhushana Prabhu (Discret. Comput. Geom., 1998)

Interference-Minimizing Colorings of Regular Graphs. - Peter C. Fishburn; J. H. Kim; J. C. Lagarias 001; Paul E. Wright (SIAM J. Discret. Math., 1998)

Threading Homotopies and DC Operating Points of Nonlinear Circuits. - Ross Geoghegan; Jeffrey C. Lagarias; Robert C. Melville (SIAM J. Optim., 1998)

Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions. - Jeffrey C. Lagarias; James A. Reeds; Margaret H. Wright; Paul E. Wright (SIAM J. Optim., 1998)

Geometric Models for Quasicrystals I. Delone Sets of Finite Type. - J. C. Lagarias 001 (Discret. Comput. Geom., 1999)

Geometric Models for Quasicrystals II. Local Rules Under Isometries. - J. C. Lagarias 001 (Discret. Comput. Geom., 1999)

The Computational Complexity of Knot and Link Problems. - Joel Hass; J. C. Lagarias 001; Nicholas Pippenger (J. ACM, 1999)

Processor Shadowing: Maximizing Expected Throughput in Fault-Tolerant Systems. - John L. Bruno; Edward G. Coffman Jr.; Jeffrey C. Lagarias; Tom J. Richardson; Peter W. Shor (Math. Oper. Res., 1999)

Well-Spaced Labelings of Points in Rectangular Grids. - Jeffrey C. Lagarias (SIAM J. Discret. Math., 2000)

Problem 10822. - Jeffrey C. Lagarias (Am. Math. Mon., 2000)

On the Normality of Arithmetical Constants. - Jeffrey C. Lagarias (Exp. Math., 2001)

When Periodic Points Are Real: 10822. - Jeffrey C. Lagarias; Jade P. Vinson; et al. (Am. Math. Mon., 2001)

On the robustness of single-loop sigma-Delta modulation. - C. Sinan Güntürk; J. C. Lagarias 001; Vinay A. Vaishampayan (IEEE Trans. Inf. Theory, 2001)

Pinwheel Scheduling: Achievable Densities. - Peter C. Fishburn; J. C. Lagarias 001 (Algorithmica, 2002)

Bounds for Local Density of Sphere Packings and the Kepler Conjecture. - J. C. Lagarias 001 (Discret. Comput. Geom., 2002)

Counting dyadic equipartitions of the unit square. - Jeffrey C. Lagarias; Joel H. Spencer; Jade P. Vinson (Discret. Math., 2002)

The EKG Sequence. - Jeffrey C. Lagarias; Eric M. Rains; Neil J. A. Sloane (Exp. Math., 2002)

Problem 10941. - Jeffrey C. Lagarias (Am. Math. Mon., 2002)

An Elementary Problem Equivalent to the Riemann Hypothesis. - Jeffrey C. Lagarias (Am. Math. Mon., 2002)

Problem 10949. - Jeffrey C. Lagarias (Am. Math. Mon., 2002)

Beyond the Descartes Circle Theorem. - Jeffrey C. Lagarias; Colin L. Mallows; Allan R. Wilks (Am. Math. Mon., 2002)

Problem 10927. - Jeffrey C. Lagarias; Eric M. Rains; Neil J. A. Sloane (Am. Math. Mon., 2002)

Substitution Delone Sets. - J. C. Lagarias 001; Yang Wang 020 (Discret. Comput. Geom., 2003)

Lower bounds for the total stopping time of 3x + 1 iterates. - David L. Applegate; Jeffrey C. Lagarias (Math. Comput., 2003)

Decay of a Markov Chain: 10941. - Jeffrey C. Lagarias; Thomas Hermann; O. P. Lossers (Am. Math. Mon., 2003)

Approximate Squaring. - Jeffrey C. Lagarias; Neil J. A. Sloane (Exp. Math., 2004)

A Generous Bound for Divisor Sums: 10949. - Jeffrey C. Lagarias; Walther Janous (Am. Math. Mon., 2004)

The EKG Sequence: 10927. - Jeffrey C. Lagarias; Eric M. Rains; Neil J. A. Sloane; Nasha Komanda (Am. Math. Mon., 2004)

Apollonian Circle Packings: Geometry and Group Theory I. The Apollonian Group. - Ronald L. Graham; Jeffrey C. Lagarias; Colin L. Mallows; Allan R. Wilks; Catherine H. Yan (Discret. Comput. Geom., 2005)

Apollonian Circle Packings: Geometry and Group Theory II. Super-Apollonian Group and Integral Packings. - Ronald L. Graham; Jeffrey C. Lagarias; Colin L. Mallows; Allan R. Wilks; Catherine H. Yan (Discret. Comput. Geom., 2006)

Apollonian Circle Packings: Geometry and Group Theory III. Higher Dimensions. - Ronald L. Graham; Jeffrey C. Lagarias; Colin L. Mallows; Allan R. Wilks; Catherine H. Yan (Discret. Comput. Geom., 2006)

Guest Editors' Foreword. - Gábor Fejes Tóth; Jeffrey C. Lagarias (Discret. Comput. Geom., 2006)

Wild and Wooley Numbers. - Jeffrey C. Lagarias (Am. Math. Mon., 2006)

Problem 11334. - Jonathan Bober; Jeffrey C. Lagarias (Am. Math. Mon., 2008)

Problem 11389. - Elizabeth R. Chen; Jeffrey C. Lagarias (Am. Math. Mon., 2008)

Problem 11355. - Jeffrey C. Lagarias (Am. Math. Mon., 2008)

Problem 11390. - Jeffrey C. Lagarias (Am. Math. Mon., 2008)

Editor's Endnotes. - Jeffrey C. Lagarias; Colin L. Mallows; Allan R. Wilks; Daniel J. Velleman (Am. Math. Mon., 2008)

The Kruskal Count. - Jeffrey C. Lagarias; Eric M. Rains; Robert J. Vanderbei (The Mathematics of Preference, Choice and Order, 2009)

Very Composite Numbers: 11334 [2008, 71]. - Jonathan Bober; Jeffrey C. Lagarias; Byron Schmuland (Am. Math. Mon., 2009)

On Sets of Integers Which Are Both Sum-Free and Product-Free. - Pär Kurlberg; Jeffrey C. Lagarias; Carl Pomerance (Integers, 2012)

Convergence of the Restricted Nelder-Mead Algorithm in Two Dimensions. - Jeffrey C. Lagarias; Bjorn Poonen; Margaret H. Wright (SIAM J. Optim., 2012)

Moser's Shadow Problem. - Jeffrey C. Lagarias; Yusheng Luo (CoRR, 2013)

Path sets in one-sided symbolic dynamics. - William C. Abram; Jeffrey C. Lagarias (Adv. Appl. Math., 2014)

Erratum: Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers. - Johan Håstad; Bettina Just; J. C. Lagarias 001; Claus-Peter Schnorr (SIAM J. Comput., 2014)

Erdős, Klarner, and the 3x + 1 Problem. - Jeffrey C. Lagarias (Am. Math. Mon., 2016)

Dilated Floor Functions That Commute. - Jeffrey C. Lagarias; Takumi Murayama; David Harry Richman (Am. Math. Mon., 2016)

Intersections of Multiplicative Translates of 3-Adic Cantor Sets II: Two Infinite Families. - William C. Abram; Artem Bolshakov; Jeffrey C. Lagarias (Exp. Math., 2017)

Products of Farey Fractions. - Jeffrey C. Lagarias; Harsh Mehta (Exp. Math., 2017)

Decimation and interleaving operations in one-sided symbolic dynamics. - William C. Abram; Jeffrey C. Lagarias; Daniel J. Slonim (Adv. Appl. Math., 2021)

On Toric Orbits in the Affine Sieve. - Alex Kontorovich; Jeffrey C. Lagarias (Exp. Math., 2021)

The floor quotient partial order. - Jeffrey C. Lagarias; David Harry Richman (Adv. Appl. Math., 2024)