![]() |
J. C. Lagarias
List of publications from the DBLP Bibliography Server - FAQ
| 2006 | ||
|---|---|---|
| 55 | EE | 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. Discrete & Computational Geometry 35(1): 1-36 (2006) |
| 54 | EE | 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. Discrete & Computational Geometry 35(1): 37-72 (2006) |
| 53 | EE | Gábor Fejes Tóth, Jeffrey C. Lagarias: Guest Editors' Foreword. Discrete & Computational Geometry 36(1): 1-3 (2006) |
| 2005 | ||
| 52 | EE | 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. Discrete & Computational Geometry 34(4): 547-585 (2005) |
| 2003 | ||
| 51 | EE | J. C. Lagarias, Yang Wang: Substitution Delone Sets. Discrete & Computational Geometry 29(2): 175-209 (2003) |
| 50 | David Applegate, Jeffrey C. Lagarias: Lower bounds for the total stopping time of 3x + 1 iterates. Math. Comput. 72(242): 1035-1049 (2003) | |
| 2002 | ||
| 49 | EE | Peter C. Fishburn, J. C. Lagarias: Pinwheel Scheduling: Achievable Densities. Algorithmica 34(1): 14-38 (2002) |
| 48 | EE | J. C. Lagarias: Bounds for Local Density of Sphere Packings and the Kepler Conjecture. Discrete & Computational Geometry 27(2): 165-193 (2002) |
| 47 | EE | Jeffrey C. Lagarias, Joel H. Spencer, Jade P. Vinson: Counting dyadic equipartitions of the unit square. Discrete Mathematics 257(2-3): 481-499 (2002) |
| 2001 | ||
| 46 | C. Sinan Güntürk, J. C. Lagarias, Vinay A. Vaishampayan: On the robustness of single-loop sigma-Delta modulation. IEEE Transactions on Information Theory 47(5): 1735-1744 (2001) | |
| 2000 | ||
| 45 | EE | J. C. Lagarias: Well-Spaced Labelings of Points in Rectangular Grids. SIAM J. Discrete Math. 13(4): 521-534 (2000) |
| 1999 | ||
| 44 | EE | J. C. Lagarias: Geometric Models for Quasicrystals I. Delone Sets of Finite Type. Discrete & Computational Geometry 21(2): 161-191 (1999) |
| 43 | EE | J. C. Lagarias: Geometric Models for Quasicrystals II. Local Rules Under Isometries. Discrete & Computational Geometry 21(3): 345-372 (1999) |
| 42 | EE | Joel Hass, J. C. Lagarias, Nicholas Pippenger: The Computational Complexity of Knot and Link Problems. J. ACM 46(2): 185-211 (1999) |
| 1998 | ||
| 41 | EE | J. C. Lagarias, N. Prabhu: Counting d -Step Paths in Extremal Dantzig Figures. Discrete & Computational Geometry 19(1): 19-31 (1998) |
| 40 | EE | Nikolai P. Dolbilin, J. C. Lagarias, Marjorie Senechal: Multiregular Point Systems. Discrete & Computational Geometry 20(4): 477-498 (1998) |
| 39 | EE | Peter C. Fishburn, J. H. Kim, J. C. Lagarias, Paul E. Wright: Interference-Minimizing Colorings of Regular Graphs. SIAM J. Discrete Math. 11(1): 15-40 (1998) |
| 1997 | ||
| 38 | EE | Joel Hass, J. C. Lagarias, Nicholas Pippenger: The Computational Complexity of Knot and Link Problems. FOCS 1997: 172-181 |
| 37 | H. Sebastian Seung, Tom J. Richardson, J. C. Lagarias, John J. Hopfield: Minimax and Hamiltonian Dynamics of Excitatory-Inhibitory Networks. NIPS 1997 | |
| 36 | EE | J. C. Lagarias, N. Prabhu, James A. Reeds: The d-Step Conjecture and Gaussian Elimination. Discrete & Computational Geometry 18(1): 53-82 (1997) |
| 1996 | ||
| 35 | J. C. Lagarias, N. Prabhu, James A. Reeds: The Parameter Space of the d-step Conjecture. FSTTCS 1996: 52-63 | |
| 1995 | ||
| 34 | J. C. Lagarias, David Moews: Polytopes that Fill Rn and Scissors Congruence. Discrete & Computational Geometry 13: 573-583 (1995) | |
| 33 | J. C. Lagarias, David Moews: Acknowledgment of Priority Concerning Polytopes that Fill Rn and Scissors Congruence. Discrete & Computational Geometry 14(3): 359-360 (1995) | |
| 32 | Jeffrey C. Lagarias, Charles Philippe Tresser: A walk along the branches of the extended Farey Tree. IBM Journal of Research and Development 39(3): 283-294 (1995) | |
| 1994 | ||
| 31 | J. C. Lagarias, Peter W. Shor: Cube-Tilings of Rn and Nonlinear Codes. Discrete & Computational Geometry 11: 359-391 (1994) | |
| 1993 | ||
| 30 | J. C. Lagarias, D. S. Romano: A Polyomino Tiling Problem of Thurston and Its Configurational Entropy. J. Comb. Theory, Ser. A 63(2): 338-358 (1993) | |
| 1992 | ||
| 29 | P. G. Doyle, J. C. Lagarias, Dana Randall: Self-Packing of Centrally Symmetric Convex Bodies in R2. Discrete & Computational Geometry 8: 171-189 (1992) | |
| 1991 | ||
| 28 | EE | Peter C. Fishburn, J. C. Lagarias, James A. Reeds, Larry A. Shepp: Sets uniquely determined by projections on axes II Discrete case. Discrete Mathematics 91(2): 149-159 (1991) |
| 27 | D. A. Bayer, Jeffrey C. Lagarias: Karmarkar's linear programming algorithm and Newton's method. Math. Program. 50: 291-330 (1991) | |
| 1990 | ||
| 26 | J. C. Lagarias, Hendrik W. Lenstra Jr., Claus-Peter Schnorr: Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. Combinatorica 10(4): 333-348 (1990) | |
| 25 | EE | John H. Conway, Jeffrey C. Lagarias: Tiling with polyominoes and combinatorial group theory. J. Comb. Theory, Ser. A 53(2): 183-208 (1990) |
| 1989 | ||
| 24 | Edward G. Coffman Jr., J. C. Lagarias: Algorithms for Packing Squares: A Probabilistic Analysis. SIAM J. Comput. 18(1): 166-185 (1989) | |
| 23 | 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) | |
| 22 | Jeff Kahn, J. C. Lagarias, Hans S. Witsenhausen: Single-Suit Two-Person Card Play III. The Misère Game. SIAM J. Discrete Math. 2(3): 329-343 (1989) | |
| 1988 | ||
| 21 | 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) | |
| 20 | J. C. Lagarias, James A. Reeds: Unique Extrapolation of Polynomial Recurrences. SIAM J. Comput. 17(2): 342-362 (1988) | |
| 1987 | ||
| 19 | Ravi B. Boppana, J. C. Lagarias: One-Way Functions and Circuit Complexity Inf. Comput. 74(3): 226-240 (1987) | |
| 18 | J. C. Lagarias, Andrew M. Odlyzko: Computing pi(x): An Analytic Method. J. Algorithms 8(2): 173-191 (1987) | |
| 1986 | ||
| 17 | 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 | |
| 16 | Ravi B. Boppana, J. C. Lagarias: One- Way Functions and Circuit Complexity. Structure in Complexity Theory Conference 1986: 51-65 | |
| 15 | J. C. Lagarias, Andrew M. Odlyzko, Don Zagier: On the Capacity of Disjointly Shared Networks. Computer Networks 10: 275-285 (1986) | |
| 1985 | ||
| 14 | EE | J. C. Lagarias, Andrew M. Odlyzko: Solving Low-Density Subset Sum Problems J. ACM 32(1): 229-246 (1985) |
| 13 | J. C. Lagarias: The Computational Complexity of Simultaneous Diophantine Approximation Problems. SIAM J. Comput. 14(1): 196-209 (1985) | |
| 1984 | ||
| 12 | Alan M. Frieze, Ravi Kannan, J. C. Lagarias: Linear Congruential Generators Do Not Produce Random Sequences FOCS 1984: 480-484 | |
| 11 | J. C. Lagarias: Performance Analysis of Shamir's Attack on the Basic Merkle-Hellman Knapsack Cryptosystem. ICALP 1984: 312-323 | |
| 1983 | ||
| 10 | J. C. Lagarias: Knapsack Public Key Cryptosystems and Diophantine Approximation. CRYPTO 1983: 3-23 | |
| 9 | Ernest F. Brickell, J. C. Lagarias, Andrew M. Odlyzko: Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems. CRYPTO 1983: 39-42 | |
| 8 | J. C. Lagarias, Andrew M. Odlyzko: Solving Low-Density Subset Sum Problems FOCS 1983: 1-10 | |
| 7 | 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, Ser. A 34(2): 123-139 (1983) | |
| 1982 | ||
| 6 | J. C. Lagarias: The Computational Complexity of Simultaneous Diophantine Approximation Problems FOCS 1982: 32-39 | |
| 5 | J. C. Lagarias, Donald E. Swartwout: Minimal Storage Representations for Binary Relations. Inf. Process. Lett. 14(2): 63-66 (1982) | |
| 4 | 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, Ser. A 33(2): 167-185 (1982) | |
| 1981 | ||
| 3 | EE | Donald E. Swartwout, J. C. Lagarias: On the Requirements of Navigational Relationship Representations. SIGMOD Conference 1981: 1-9 |
| 1980 | ||
| 2 | J. C. Lagarias: Worst-Case Complexity Bounds for Algorithms in the Theory of Integral Quadratic Forms. J. Algorithms 1(2): 142-186 (1980) | |
| 1979 | ||
| 1 | J. C. Lagarias: Succinct Certificates for the Solvability of Binary Quadratic Diophantine Equations FOCS 1979: 47-54 | |