default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeffrey C. Lagarias
J. C. Lagarias 0001
Person information
- affiliation: University of Michigan, Ann Arbor, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j82]Jeffrey C. Lagarias, David Harry Richman
:
The floor quotient partial order. Adv. Appl. Math. 153: 102615 (2024)- 2021
- [j81]William C. Abram, Jeffrey C. Lagarias, Daniel J. Slonim:
Decimation and interleaving operations in one-sided symbolic dynamics. Adv. Appl. Math. 126: 102160 (2021) - [j80]Alex Kontorovich, Jeffrey C. Lagarias:
On Toric Orbits in the Affine Sieve. Exp. Math. 30(4): 575-586 (2021) - 2017
- [j79]Jeffrey C. Lagarias, Harsh Mehta:
Products of Farey Fractions. Exp. Math. 26(1): 1-21 (2017) - [j78]William C. Abram, Artem Bolshakov, Jeffrey C. Lagarias:
Intersections of Multiplicative Translates of 3-Adic Cantor Sets II: Two Infinite Families. Exp. Math. 26(4): 468-489 (2017) - 2016
- [j77]Jeffrey C. Lagarias:
Erdős, Klarner, and the 3x + 1 Problem. Am. Math. Mon. 123(8): 753-776 (2016) - [j76]Jeffrey C. Lagarias, Takumi Murayama, David Harry Richman:
Dilated Floor Functions That Commute. Am. Math. Mon. 123(10): 1033-1038 (2016) - 2014
- [j75]William C. Abram, Jeffrey C. Lagarias:
Path sets in one-sided symbolic dynamics. Adv. Appl. Math. 56: 109-134 (2014) - [j74]Johan Håstad, Bettina Just, J. C. Lagarias, Claus-Peter Schnorr:
Erratum: Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers. SIAM J. Comput. 43(1): 254 (2014) - 2012
- [j73]Pär Kurlberg, Jeffrey C. Lagarias, Carl Pomerance:
On Sets of Integers Which Are Both Sum-Free and Product-Free. Integers 12B: A4 (2012) - [j72]Jeffrey C. Lagarias, Bjorn Poonen, Margaret H. Wright:
Convergence of the Restricted Nelder-Mead Algorithm in Two Dimensions. SIAM J. Optim. 22(2): 501-532 (2012) - 2009
- [j71]Jonathan Bober, Jeffrey C. Lagarias, Byron Schmuland:
Very Composite Numbers: 11334 [2008, 71]. Am. Math. Mon. 116(9): 847-848 (2009) - 2008
- [j70]Jonathan Bober, Jeffrey C. Lagarias:
Problem 11334. Am. Math. Mon. 115(1): 71 (2008) - [j69]Jeffrey C. Lagarias:
Problem 11355. Am. Math. Mon. 115(4): 365 (2008) - [j68]Elizabeth R. Chen, Jeffrey C. Lagarias:
Problem 11389. Am. Math. Mon. 115(8): 758 (2008) - [j67]Jeffrey C. Lagarias, Colin L. Mallows, Allan R. Wilks, Daniel J. Velleman:
Editor's Endnotes. Am. Math. Mon. 115(8): 769-770 (2008) - [j66]Jeffrey C. Lagarias:
Problem 11390. Am. Math. Mon. 115(9): 855 (2008) - 2006
- [j65]Ronald L. Graham, Jeffrey C. Lagarias, Colin L. Mallows, Allan R. Wilks, Catherine H. Yan:
Apollonian Circle Packings: Geometry and Group Theory II. Super-Apollonian Group and Integral Packings. Discret. Comput. Geom. 35(1): 1-36 (2006) - [j64]Ronald L. Graham, Jeffrey C. Lagarias, Colin L. Mallows, Allan R. Wilks, Catherine H. Yan:
Apollonian Circle Packings: Geometry and Group Theory III. Higher Dimensions. Discret. Comput. Geom. 35(1): 37-72 (2006) - [j63]Gábor Fejes Tóth, Jeffrey C. Lagarias:
Guest Editors' Foreword. Discret. Comput. Geom. 36(1): 1-3 (2006) - [j62]Jeffrey C. Lagarias:
Wild and Wooley Numbers. Am. Math. Mon. 113(2): 97-108 (2006) - 2005
- [j61]Ronald L. Graham, Jeffrey C. Lagarias, Colin L. Mallows, Allan R. Wilks, Catherine H. Yan:
Apollonian Circle Packings: Geometry and Group Theory I. The Apollonian Group. Discret. Comput. Geom. 34(4): 547-585 (2005) - 2004
- [j60]Jeffrey C. Lagarias, Neil J. A. Sloane:
Approximate Squaring. Exp. Math. 13(1): 113-128 (2004) - [j59]Jeffrey C. Lagarias, Eric M. Rains, Neil J. A. Sloane, Nasha Komanda:
The EKG Sequence: 10927. Am. Math. Mon. 111(2): 167-168 (2004) - [j58]Jeffrey C. Lagarias, Walther Janous:
A Generous Bound for Divisor Sums: 10949. Am. Math. Mon. 111(3): 264-265 (2004) - 2003
- [j57]J. C. Lagarias, Yang Wang:
Substitution Delone Sets. Discret. Comput. Geom. 29(2): 175-209 (2003) - [j56]David L. Applegate, Jeffrey C. Lagarias:
Lower bounds for the total stopping time of 3x + 1 iterates. Math. Comput. 72(242): 1035-1049 (2003) - [j55]Jeffrey C. Lagarias, Thomas Hermann, O. P. Lossers:
Decay of a Markov Chain: 10941. Am. Math. Mon. 110(6): 547-548 (2003) - 2002
- [j54]Peter C. Fishburn, J. C. Lagarias:
Pinwheel Scheduling: Achievable Densities. Algorithmica 34(1): 14-38 (2002) - [j53]J. C. Lagarias:
Bounds for Local Density of Sphere Packings and the Kepler Conjecture. Discret. Comput. Geom. 27(2): 165-193 (2002) - [j52]Jeffrey C. Lagarias, Joel H. Spencer, Jade P. Vinson:
Counting dyadic equipartitions of the unit square. Discret. Math. 257(2-3): 481-499 (2002) - [j51]Jeffrey C. Lagarias, Eric M. Rains, Neil J. A. Sloane:
The EKG Sequence. Exp. Math. 11(3): 437-446 (2002) - [j50]Jeffrey C. Lagarias, Eric M. Rains, Neil J. A. Sloane:
Problem 10927. Am. Math. Mon. 109(2): 202 (2002) - [j49]Jeffrey C. Lagarias, Colin L. Mallows, Allan R. Wilks:
Beyond the Descartes Circle Theorem. Am. Math. Mon. 109(4): 338-361 (2002) - [j48]Jeffrey C. Lagarias:
Problem 10941. Am. Math. Mon. 109(4): 393 (2002) - [j47]Jeffrey C. Lagarias:
An Elementary Problem Equivalent to the Riemann Hypothesis. Am. Math. Mon. 109(6): 534-543 (2002) - [j46]Jeffrey C. Lagarias:
Problem 10949. Am. Math. Mon. 109(6): 569 (2002) - 2001
- [j45]Jeffrey C. Lagarias:
On the Normality of Arithmetical Constants. Exp. Math. 10(3): 355-368 (2001) - [j44]Jeffrey C. Lagarias, Jade P. Vinson, et al.:
When Periodic Points Are Real: 10822. Am. Math. Mon. 108(9): 876-877 (2001) - [j43]C. Sinan Güntürk, J. C. Lagarias, Vinay A. Vaishampayan:
On the robustness of single-loop sigma-Delta modulation. IEEE Trans. Inf. Theory 47(5): 1735-1744 (2001) - 2000
- [j42]Jeffrey C. Lagarias:
Well-Spaced Labelings of Points in Rectangular Grids. SIAM J. Discret. Math. 13(4): 521-534 (2000) - [j41]Jeffrey C. Lagarias:
Problem 10822. Am. Math. Mon. 107(7): 653 (2000) - 1999
- [j40]J. C. Lagarias:
Geometric Models for Quasicrystals I. Delone Sets of Finite Type. Discret. Comput. Geom. 21(2): 161-191 (1999) - [j39]J. C. Lagarias:
Geometric Models for Quasicrystals II. Local Rules Under Isometries. Discret. Comput. Geom. 21(3): 345-372 (1999) - [j38]Joel Hass, J. C. Lagarias, Nicholas Pippenger:
The Computational Complexity of Knot and Link Problems. J. ACM 46(2): 185-211 (1999) - [j37]John L. Bruno, Edward G. Coffman Jr., Jeffrey C. Lagarias, Tom J. Richardson, Peter W. Shor:
Processor Shadowing: Maximizing Expected Throughput in Fault-Tolerant Systems. Math. Oper. Res. 24(2): 362-382 (1999) - 1998
- [j36]J. C. Lagarias, Nagabhushana Prabhu:
Counting d -Step Paths in Extremal Dantzig Figures. Discret. Comput. Geom. 19(1): 19-31 (1998) - [j35]Nikolai P. Dolbilin, J. C. Lagarias, Marjorie Senechal:
Multiregular Point Systems. Discret. Comput. Geom. 20(4): 477-498 (1998) - [j34]Peter C. Fishburn, J. H. Kim, J. C. Lagarias, Paul E. Wright:
Interference-Minimizing Colorings of Regular Graphs. SIAM J. Discret. Math. 11(1): 15-40 (1998) - [j33]Jeffrey C. Lagarias, James A. Reeds, Margaret H. Wright, Paul E. Wright:
Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions. SIAM J. Optim. 9(1): 112-147 (1998) - [j32]Ross Geoghegan, Jeffrey C. Lagarias, Robert C. Melville:
Threading Homotopies and DC Operating Points of Nonlinear Circuits. SIAM J. Optim. 9(1): 159-178 (1998) - 1997
- [j31]J. C. Lagarias, Nagabhushana Prabhu, James A. Reeds:
The d-Step Conjecture and Gaussian Elimination. Discret. Comput. Geom. 18(1): 53-82 (1997) - 1995
- [j30]J. C. Lagarias, David Moews:
Polytopes that Fill Rn and Scissors Congruence. Discret. Comput. Geom. 13: 573-583 (1995) - [j29]J. C. Lagarias, David Moews:
Acknowledgment of Priority Concerning Polytopes that Fill Rn and Scissors Congruence. Discret. Comput. Geom. 14(3): 359-360 (1995) - [j28]David L. Applegate, Jeffrey C. Lagarias:
The Distribution of 3x+1 Trees. Exp. Math. 4(3): 193-209 (1995) - [j27]Jeffrey C. Lagarias, Charles Philippe Tresser:
A walk along the branches of the extended Farey Tree. IBM J. Res. Dev. 39(3): 283-294 (1995) - 1994
- [j26]J. C. Lagarias, Peter W. Shor:
Cube-Tilings of Rn and Nonlinear Codes. Discret. Comput. Geom. 11: 359-391 (1994) - 1993
- [j25]J. C. Lagarias, D. S. Romano:
A Polyomino Tiling Problem of Thurston and Its Configurational Entropy. J. Comb. Theory A 63(2): 338-358 (1993) - [j24]Jeffrey C. Lagarias:
A Collinear Scaling Interpretation of Karmarkar's Linear Programming Algorithm. SIAM J. Optim. 3(3): 630-636 (1993) - 1992
- [j23]P. G. Doyle, J. C. Lagarias, Dana Randall:
Self-Packing of Centrally Symmetric Convex Bodies in R2. Discret. Comput. Geom. 8: 171-189 (1992) - 1991
- [j22]Peter C. Fishburn, J. C. Lagarias, James A. Reeds, Larry A. Shepp:
Sets uniquely determined by projections on axes II Discrete case. Discret. Math. 91(2): 149-159 (1991) - [j21]D. A. Bayer, Jeffrey C. Lagarias:
Karmarkar's linear programming algorithm and Newton's method. Math. Program. 50: 291-330 (1991) - 1990
- [j20]J. C. Lagarias, Hendrik W. Lenstra Jr., Claus-Peter Schnorr:
Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. Comb. 10(4): 333-348 (1990) - [j19]John H. Conway, Jeffrey C. Lagarias:
Tiling with polyominoes and combinatorial group theory. J. Comb. Theory A 53(2): 183-208 (1990) - 1989
- [j18]Edward G. Coffman Jr., J. C. Lagarias:
Algorithms for Packing Squares: A Probabilistic Analysis. SIAM J. Comput. 18(1): 166-185 (1989) - [j17]Johan Håstad, Bettina Just, J. C. Lagarias, Claus-Peter Schnorr:
Polynomial Time Algorithms for Finding Integer Relations among Real Numbers. SIAM J. Comput. 18(5): 859-881 (1989) - [j16]Jeff Kahn, J. C. Lagarias, Hans S. Witsenhausen:
Single-Suit Two-Person Card Play III. The Misère Game. SIAM J. Discret. Math. 2(3): 329-343 (1989) - [j15]Jeffrey C. Lagarias:
A Course in Number Theory and Cryptography (Neil Koblitz). SIAM Rev. 31(3): 508-510 (1989) - 1988
- [j14]Alan M. Frieze, Johan Håstad, Ravi Kannan, J. C. Lagarias, Adi Shamir:
Reconstructing Truncated Integer Variables Satisfying Linear Congruences. SIAM J. Comput. 17(2): 262-280 (1988) - [j13]J. C. Lagarias, James A. Reeds:
Unique Extrapolation of Polynomial Recurrences. SIAM J. Comput. 17(2): 342-362 (1988) - 1987
- [j12]Ravi B. Boppana, J. C. Lagarias:
One-Way Functions and Circuit Complexity. Inf. Comput. 74(3): 226-240 (1987) - [j11]J. C. Lagarias, Andrew M. Odlyzko:
Computing pi(x): An Analytic Method. J. Algorithms 8(2): 173-191 (1987) - 1986
- [j10]J. C. Lagarias, Andrew M. Odlyzko, Don Zagier:
On the Capacity of Disjointly Shared Networks. Comput. Networks 10: 275-285 (1986) - 1985
- [j9]J. C. Lagarias, Andrew M. Odlyzko:
Solving Low-Density Subset Sum Problems. J. ACM 32(1): 229-246 (1985) - [j8]J. C. Lagarias:
The Computational Complexity of Simultaneous Diophantine Approximation Problems. SIAM J. Comput. 14(1): 196-209 (1985) - 1983
- [j7]Jerrold R. Griggs, Jeffrey C. Lagarias, Andrew M. Odlyzko, James B. Shearer:
On the Tightest Packing of Sums of Vectors. Eur. J. Comb. 4(3): 231-236 (1983) - [j6]J. C. Lagarias, Andrew M. Odlyzko, James B. Shearer:
On the Density of Sequences of Integers the Sum of No Two of Which Is a Square II. General Sequences. J. Comb. Theory A 34(2): 123-139 (1983) - [j5]J. C. Lagarias, F. Aminzadeh:
Multi-Stage Planning and the Extended Linear-Quadratic-Gaussian Control Problem. Math. Oper. Res. 8(1): 42-63 (1983) - 1982
- [j4]J. C. Lagarias, Donald E. Swartwout:
Minimal Storage Representations for Binary Relations. Inf. Process. Lett. 14(2): 63-66 (1982) - [j3]J. C. Lagarias, Andrew M. Odlyzko, James B. Shearer:
On the Density of Sequences of Integers the Sum of No Two of which Is a Square. I. Arithmetic Progressions. J. Comb. Theory A 33(2): 167-185 (1982) - 1980
- [j2]J. C. Lagarias:
Worst-Case Complexity Bounds for Algorithms in the Theory of Integral Quadratic Forms. J. Algorithms 1(2): 142-186 (1980) - 1977
- [j1]Frank K. Hwang, J. C. Lagarias:
Minimum range sequences of all k-subsets of a set. Discret. Math. 19(3): 257-264 (1977)
Conference and Workshop Papers
- 1997
- [c14]Joel Hass, J. C. Lagarias, Nicholas Pippenger:
The Computational Complexity of Knot and Link Problems. FOCS 1997: 172-181 - [c13]H. Sebastian Seung, Tom J. Richardson, J. C. Lagarias, John J. Hopfield:
Minimax and Hamiltonian Dynamics of Excitatory-Inhibitory Networks. NIPS 1997: 329-335 - 1996
- [c12]J. C. Lagarias, Nagabhushana Prabhu, James A. Reeds:
The Parameter Space of the d-step Conjecture. FSTTCS 1996: 52-63 - 1990
- [c11]Zoltán Füredi, Jeffrey C. Lagarias, Frank Morgan:
Singularities of Minimal Surfaces and Networks and Related Extremal Problems in Minkowski Space. Discrete and Computational Geometry 1990: 95-110 - 1986
- [c10]Ravi B. Boppana, J. C. Lagarias:
One- Way Functions and Circuit Complexity. SCT 1986: 51-65 - [c9]Johan Håstad, Bettina Helfrich, J. C. Lagarias, Claus-Peter Schnorr:
Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers. STACS 1986: 105-118 - 1984
- [c8]Alan M. Frieze, Ravi Kannan, J. C. Lagarias:
Linear Congruential Generators Do Not Produce Random Sequences. FOCS 1984: 480-484 - [c7]J. C. Lagarias:
Performance Analysis of Shamir's Attack on the Basic Merkle-Hellman Knapsack Cryptosystem. ICALP 1984: 312-323 - 1983
- [c6]J. C. Lagarias:
Knapsack Public Key Cryptosystems and Diophantine Approximation. CRYPTO 1983: 3-23 - [c5]Ernest F. Brickell, J. C. Lagarias, Andrew M. Odlyzko:
Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems. CRYPTO 1983: 39-42 - [c4]J. C. Lagarias, Andrew M. Odlyzko:
Solving Low-Density Subset Sum Problems. FOCS 1983: 1-10 - 1982
- [c3]J. C. Lagarias:
The Computational Complexity of Simultaneous Diophantine Approximation Problems. FOCS 1982: 32-39 - 1981
- [c2]Donald E. Swartwout, J. C. Lagarias:
On the Requirements of Navigational Relationship Representations. SIGMOD Conference 1981: 1-9 - 1979
- [c1]J. C. Lagarias:
Succinct Certificates for the Solvability of Binary Quadratic Diophantine Equations. FOCS 1979: 47-54
Parts in Books or Collections
- 2009
- [p1]Jeffrey C. Lagarias, Eric M. Rains, Robert J. Vanderbei:
The Kruskal Count. The Mathematics of Preference, Choice and Order 2009: 371-391
Informal and Other Publications
- 2016
- [i2]Jeffrey C. Lagarias, Takumi Murayama, David Harry Richman:
Dilated Floor Functions That Commute. CoRR abs/1611.05513 (2016) - 2013
- [i1]Jeffrey C. Lagarias, Yusheng Luo:
Moser's Shadow Problem. CoRR abs/1310.4345 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
