Search the dblp DataBase
J. C. Lagarias :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
J. C. Lagarias , D. E. Swartwout Minimal Storage Representations for Binary Relations. [Citation Graph (1, 0)][DBLP ] Inf. Process. Lett., 1982, v:14, n:2, pp:63-66 [Journal ] Ravi B. Boppana , J. C. Lagarias One- Way Functions and Circuit Complexity. [Citation Graph (0, 0)][DBLP ] Structure in Complexity Theory Conference, 1986, pp:51-65 [Conf ] J. C. Lagarias Knapsack Public Key Cryptosystems and Diophantine Approximation. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1983, pp:3-23 [Conf ] Ernest F. Brickell , J. C. Lagarias , Andrew M. Odlyzko Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1983, pp:39-42 [Conf ] Alan M. Frieze , Ravi Kannan , J. C. Lagarias Linear Congruential Generators Do Not Produce Random Sequences [Citation Graph (0, 0)][DBLP ] FOCS, 1984, pp:480-484 [Conf ] Joel Hass , J. C. Lagarias , Nicholas Pippenger The Computational Complexity of Knot and Link Problems. [Citation Graph (0, 0)][DBLP ] FOCS, 1997, pp:172-181 [Conf ] J. C. Lagarias Succinct Certificates for the Solvability of Binary Quadratic Diophantine Equations [Citation Graph (0, 0)][DBLP ] FOCS, 1979, pp:47-54 [Conf ] J. C. Lagarias The Computational Complexity of Simultaneous Diophantine Approximation Problems [Citation Graph (0, 0)][DBLP ] FOCS, 1982, pp:32-39 [Conf ] J. C. Lagarias , Andrew M. Odlyzko Solving Low-Density Subset Sum Problems [Citation Graph (0, 0)][DBLP ] FOCS, 1983, pp:1-10 [Conf ] J. C. Lagarias , N. Prabhu , James A. Reeds The Parameter Space of the d -step Conjecture. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:52-63 [Conf ] J. C. Lagarias Performance Analysis of Shamir's Attack on the Basic Merkle-Hellman Knapsack Cryptosystem. [Citation Graph (0, 0)][DBLP ] ICALP, 1984, pp:312-323 [Conf ] H. Sebastian Seung , Tom J. Richardson , J. C. Lagarias , John J. Hopfield Minimax and Hamiltonian Dynamics of Excitatory-Inhibitory Networks. [Citation Graph (0, 0)][DBLP ] NIPS, 1997, pp:- [Conf ] D. Swartwout , J. C. Lagarias On the Requirements of Navigational Relationship Representations. [Citation Graph (0, 7)][DBLP ] SIGMOD Conference, 1981, pp:1-9 [Conf ] Johan Håstad , Bettina Helfrich , J. C. Lagarias , Claus-Peter Schnorr Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers. [Citation Graph (0, 0)][DBLP ] STACS, 1986, pp:105-118 [Conf ] Peter C. Fishburn , J. C. Lagarias Pinwheel Scheduling: Achievable Densities. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2002, v:34, n:1, pp:14-38 [Journal ] J. C. Lagarias , Andrew M. Odlyzko , Don Zagier On the Capacity of Disjointly Shared Networks. [Citation Graph (0, 0)][DBLP ] Computer Networks, 1986, v:10, n:, pp:275-285 [Journal ] J. C. Lagarias , Hendrik W. Lenstra Jr. , Claus-Peter Schnorr Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1990, v:10, n:4, pp:333-348 [Journal ] Nikolai P. Dolbilin , J. C. Lagarias , Marjorie Senechal Multiregular Point Systems. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1998, v:20, n:4, pp:477-498 [Journal ] P. G. Doyle , J. C. Lagarias , Dana Randall Self-Packing of Centrally Symmetric Convex Bodies in R2 . [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1992, v:8, n:, pp:171-189 [Journal ] J. C. Lagarias Bounds for Local Density of Sphere Packings and the Kepler Conjecture. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 2002, v:27, n:2, pp:165-193 [Journal ] J. C. Lagarias Geometric Models for Quasicrystals I. Delone Sets of Finite Type. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1999, v:21, n:2, pp:161-191 [Journal ] J. C. Lagarias Geometric Models for Quasicrystals II. Local Rules Under Isometries. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1999, v:21, n:3, pp:345-372 [Journal ] J. C. Lagarias , David Moews Acknowledgment of Priority Concerning Polytopes that Fill Rn and Scissors Congruence. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1995, v:14, n:3, pp:359-360 [Journal ] J. C. Lagarias , David Moews Polytopes that Fill Rn and Scissors Congruence. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1995, v:13, n:, pp:573-583 [Journal ] J. C. Lagarias , N. Prabhu Counting d -Step Paths in Extremal Dantzig Figures. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1998, v:19, n:1, pp:19-31 [Journal ] J. C. Lagarias , N. Prabhu , James A. Reeds The d-Step Conjecture and Gaussian Elimination. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1997, v:18, n:1, pp:53-82 [Journal ] J. C. Lagarias , Peter W. Shor Cube-Tilings of Rn and Nonlinear Codes. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1994, v:11, n:, pp:359-391 [Journal ] J. C. Lagarias , Yang Wang Substitution Delone Sets. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 2003, v:29, n:2, pp:175-209 [Journal ] Ravi B. Boppana , J. C. Lagarias One-Way Functions and Circuit Complexity [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1987, v:74, n:3, pp:226-240 [Journal ] Joel Hass , J. C. Lagarias , Nicholas Pippenger The Computational Complexity of Knot and Link Problems. [Citation Graph (0, 0)][DBLP ] J. ACM, 1999, v:46, n:2, pp:185-211 [Journal ] J. C. Lagarias , Andrew M. Odlyzko Solving Low-Density Subset Sum Problems [Citation Graph (0, 0)][DBLP ] J. ACM, 1985, v:32, n:1, pp:229-246 [Journal ] J. C. Lagarias Worst-Case Complexity Bounds for Algorithms in the Theory of Integral Quadratic Forms. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1980, v:1, n:2, pp:142-186 [Journal ] J. C. Lagarias , Andrew M. Odlyzko Computing pi(x): An Analytic Method. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1987, v:8, n:2, pp:173-191 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1982, v:33, n:2, pp:167-185 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1983, v:34, n:2, pp:123-139 [Journal ] J. C. Lagarias , D. S. Romano A Polyomino Tiling Problem of Thurston and Its Configurational Entropy. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1993, v:63, n:2, pp:338-358 [Journal ] Edward G. Coffman Jr. , J. C. Lagarias Algorithms for Packing Squares: A Probabilistic Analysis. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1989, v:18, n:1, pp:166-185 [Journal ] Alan M. Frieze , Johan Håstad , Ravi Kannan , J. C. Lagarias , Adi Shamir Reconstructing Truncated Integer Variables Satisfying Linear Congruences. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1988, v:17, n:2, pp:262-280 [Journal ] Johan Håstad , Bettina Just , J. C. Lagarias , Claus-Peter Schnorr Polynomial Time Algorithms for Finding Integer Relations among Real Numbers. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1989, v:18, n:5, pp:859-881 [Journal ] J. C. Lagarias The Computational Complexity of Simultaneous Diophantine Approximation Problems. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1985, v:14, n:1, pp:196-209 [Journal ] J. C. Lagarias , James A. Reeds Unique Extrapolation of Polynomial Recurrences. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1988, v:17, n:2, pp:342-362 [Journal ] Peter C. Fishburn , J. H. Kim , J. C. Lagarias , Paul E. Wright Interference-Minimizing Colorings of Regular Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1998, v:11, n:1, pp:15-40 [Journal ] Jeff Kahn , J. C. Lagarias , Hans S. Witsenhausen Single-Suit Two-Person Card Play III. The Misère Game. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1989, v:2, n:3, pp:329-343 [Journal ] J. C. Lagarias Well-Spaced Labelings of Points in Rectangular Grids. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2000, v:13, n:4, pp:521-534 [Journal ] C. Sinan Güntürk , J. C. Lagarias , Vinay A. Vaishampayan On the robustness of single-loop sigma-Delta modulation. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1735-1744 [Journal ] Peter C. Fishburn , J. C. Lagarias , James A. Reeds , Larry A. Shepp Sets uniquely determined by projections on axes II Discrete case. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1991, v:91, n:2, pp:149-159 [Journal ] Search in 0.003secs, Finished in 0.329secs