J. C. Lagarias

Publication Activity (10 Years)

Years Active: 1977-2014
Publications (10 Years): 0

Top Topics

Computational Cost

Interval Arithmetic

Top Venues

SIAM J. Comput.

Publications

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) (2014)
J. C. Lagarias, Yang Wang
Substitution Delone Sets. Discret. Comput. Geom. 29 (2) (2003)
J. C. Lagarias
Bounds for Local Density of Sphere Packings and the Kepler Conjecture. Discret. Comput. Geom. 27 (2) (2002)
Peter C. Fishburn, J. C. Lagarias
Pinwheel Scheduling: Achievable Densities. Algorithmica 34 (1) (2002)
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) (2001)
J. C. Lagarias
Geometric Models for Quasicrystals II. Local Rules Under Isometries. Discret. Comput. Geom. 21 (3) (1999)
Joel Hass, J. C. Lagarias, Nicholas Pippenger
The Computational Complexity of Knot and Link Problems. J. ACM 46 (2) (1999)
J. C. Lagarias
Geometric Models for Quasicrystals I. Delone Sets of Finite Type. Discret. Comput. Geom. 21 (2) (1999)
J. C. Lagarias, Nagabhushana Prabhu
Counting d -Step Paths in Extremal Dantzig Figures. Discret. Comput. Geom. 19 (1) (1998)
Nikolai P. Dolbilin, J. C. Lagarias, Marjorie Senechal
Multiregular Point Systems. Discret. Comput. Geom. 20 (4) (1998)
Peter C. Fishburn, J. H. Kim, J. C. Lagarias, Paul E. Wright
Interference-Minimizing Colorings of Regular Graphs. SIAM J. Discret. Math. 11 (1) (1998)
J. C. Lagarias, Nagabhushana Prabhu, James A. Reeds
The d-Step Conjecture and Gaussian Elimination. Discret. Comput. Geom. 18 (1) (1997)
Joel Hass, J. C. Lagarias, Nicholas Pippenger
The Computational Complexity of Knot and Link Problems. FOCS (1997)
H. Sebastian Seung, Tom J. Richardson, J. C. Lagarias, John J. Hopfield
Minimax and Hamiltonian Dynamics of Excitatory-Inhibitory Networks. NIPS (1997)
J. C. Lagarias, Nagabhushana Prabhu, James A. Reeds
-step Conjecture. FSTTCS (1996)
J. C. Lagarias, David Moews
and Scissors Congruence. Discret. Comput. Geom. 14 (3) (1995)
J. C. Lagarias, David Moews
and Scissors Congruence. Discret. Comput. Geom. 13 (1995)
J. C. Lagarias, Peter W. Shor
and Nonlinear Codes. Discret. Comput. Geom. 11 (1994)
J. C. Lagarias, D. S. Romano
A Polyomino Tiling Problem of Thurston and Its Configurational Entropy. J. Comb. Theory, Ser. A 63 (2) (1993)
P. G. Doyle, J. C. Lagarias, Dana Randall
. Discret. Comput. Geom. 8 (1992)
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) (1991)
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) (1990)
Edward G. Coffman Jr., J. C. Lagarias
Algorithms for Packing Squares: A Probabilistic Analysis. SIAM J. Comput. 18 (1) (1989)
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) (1989)
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) (1989)
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) (1988)
J. C. Lagarias, James A. Reeds
Unique Extrapolation of Polynomial Recurrences. SIAM J. Comput. 17 (2) (1988)
Ravi B. Boppana, J. C. Lagarias
One-Way Functions and Circuit Complexity Inf. Comput. 74 (3) (1987)
J. C. Lagarias, Andrew M. Odlyzko
Computing pi(x): An Analytic Method. J. Algorithms 8 (2) (1987)
J. C. Lagarias, Andrew M. Odlyzko, Don Zagier
On the Capacity of Disjointly Shared Networks. Comput. Networks 10 (1986)
Johan Håstad, Bettina Helfrich, J. C. Lagarias, Claus-Peter Schnorr
Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers. STACS (1986)
Ravi B. Boppana, J. C. Lagarias
One- Way Functions and Circuit Complexity. Computational Complexity Conference (1986)
J. C. Lagarias
The Computational Complexity of Simultaneous Diophantine Approximation Problems. SIAM J. Comput. 14 (1) (1985)
J. C. Lagarias, Andrew M. Odlyzko
Solving Low-Density Subset Sum Problems J. ACM 32 (1) (1985)
Alan M. Frieze, Ravi Kannan, J. C. Lagarias
Linear Congruential Generators Do Not Produce Random Sequences FOCS (1984)
J. C. Lagarias
Performance Analysis of Shamir's Attack on the Basic Merkle-Hellman Knapsack Cryptosystem. ICALP (1984)
J. C. Lagarias, F. Aminzadeh
Multi-Stage Planning and the Extended Linear-Quadratic-Gaussian Control Problem. Math. Oper. Res. 8 (1) (1983)
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) (1983)
Ernest F. Brickell, J. C. Lagarias, Andrew M. Odlyzko
Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems. CRYPTO (1983)
J. C. Lagarias, Andrew M. Odlyzko
Solving Low-Density Subset Sum Problems FOCS (1983)
J. C. Lagarias
Knapsack Public Key Cryptosystems and Diophantine Approximation. CRYPTO (1983)
J. C. Lagarias, Donald E. Swartwout
Minimal Storage Representations for Binary Relations. Inf. Process. Lett. 14 (2) (1982)
J. C. Lagarias
The Computational Complexity of Simultaneous Diophantine Approximation Problems FOCS (1982)
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) (1982)
Donald E. Swartwout, J. C. Lagarias
On the Requirements of Navigational Relationship Representations. SIGMOD Conference (1981)
J. C. Lagarias
Worst-Case Complexity Bounds for Algorithms in the Theory of Integral Quadratic Forms. J. Algorithms 1 (2) (1980)
J. C. Lagarias
Succinct Certificates for the Solvability of Binary Quadratic Diophantine Equations FOCS (1979)
F. K. Hwang, J. C. Lagarias
Minimum range sequences of all k-subsets of a set. Discret. Math. 19 (3) (1977)