J. C. Lagarias

48 papers A* 8A 1Journal 35Unranked 4

Year	Rank	Type	Title / Venue / Authors
2014	J	`jnl`	Erratum: Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers. SIAM J. Comput. Johan Håstad, Bettina Just, J. C. Lagarias, Claus-Peter Schnorr
2003	J	`jnl`	Substitution Delone Sets. Discret. Comput. Geom. J. C. Lagarias, Yang Wang
2002	J	`jnl`	Bounds for Local Density of Sphere Packings and the Kepler Conjecture. Discret. Comput. Geom. J. C. Lagarias
2002	J	`jnl`	Pinwheel Scheduling: Achievable Densities. Algorithmica Peter C. Fishburn, J. C. Lagarias
2001	J	`jnl`	On the robustness of single-loop sigma-Delta modulation. IEEE Trans. Inf. Theory C. Sinan Güntürk, J. C. Lagarias, Vinay A. Vaishampayan
1999	J	`jnl`	Geometric Models for Quasicrystals I. Delone Sets of Finite Type. Discret. Comput. Geom. J. C. Lagarias
1999	J	`jnl`	Geometric Models for Quasicrystals II. Local Rules Under Isometries. Discret. Comput. Geom. J. C. Lagarias
1999	J	`jnl`	The Computational Complexity of Knot and Link Problems. J. ACM Joel Hass, J. C. Lagarias, Nicholas Pippenger
1998	J	`jnl`	Counting d -Step Paths in Extremal Dantzig Figures. Discret. Comput. Geom. J. C. Lagarias, Nagabhushana Prabhu
1998	J	`jnl`	Interference-Minimizing Colorings of Regular Graphs. SIAM J. Discret. Math. Peter C. Fishburn, J. H. Kim, J. C. Lagarias, Paul E. Wright
1998	J	`jnl`	Multiregular Point Systems. Discret. Comput. Geom. Nikolai P. Dolbilin, J. C. Lagarias, Marjorie Senechal
1997	—	`conf`	Minimax and Hamiltonian Dynamics of Excitatory-Inhibitory Networks. NIPS H. Sebastian Seung, Tom J. Richardson, J. C. Lagarias, John J. Hopfield
1997	A*	`conf`	The Computational Complexity of Knot and Link Problems. FOCS Joel Hass, J. C. Lagarias, Nicholas Pippenger
1997	J	`jnl`	The d-Step Conjecture and Gaussian Elimination. Discret. Comput. Geom. J. C. Lagarias, Nagabhushana Prabhu, James A. Reeds
1996	—	`conf`	The Parameter Space of the FSTTCS J. C. Lagarias, Nagabhushana Prabhu, James A. Reeds
1995	J	`jnl`	Acknowledgment of Priority Concerning Polytopes that Fill R Discret. Comput. Geom. J. C. Lagarias, David Moews
1995	J	`jnl`	Polytopes that Fill R Discret. Comput. Geom. J. C. Lagarias, David Moews
1994	J	`jnl`	Cube-Tilings of R Discret. Comput. Geom. J. C. Lagarias, Peter W. Shor
1993	J	`jnl`	A Polyomino Tiling Problem of Thurston and Its Configurational Entropy. J. Comb. Theory A J. C. Lagarias, D. S. Romano
1992	J	`jnl`	Self-Packing of Centrally Symmetric Convex Bodies in R Discret. Comput. Geom. P. G. Doyle, J. C. Lagarias, Dana Randall
1991	J	`jnl`	Sets uniquely determined by projections on axes II Discrete case. Discret. Math. Peter C. Fishburn, J. C. Lagarias, James A. Reeds, Larry A. Shepp
1990	J	`jnl`	Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. Comb. J. C. Lagarias, Hendrik W. Lenstra Jr., Claus-Peter Schnorr
1989	J	`jnl`	Algorithms for Packing Squares: A Probabilistic Analysis. SIAM J. Comput. Edward G. Coffman Jr., J. C. Lagarias
1989	J	`jnl`	Polynomial Time Algorithms for Finding Integer Relations among Real Numbers. SIAM J. Comput. Johan Håstad, Bettina Just, J. C. Lagarias, Claus-Peter Schnorr
1989	J	`jnl`	Single-Suit Two-Person Card Play III. The Misère Game. SIAM J. Discret. Math. Jeff Kahn, J. C. Lagarias, Hans S. Witsenhausen
1988	J	`jnl`	Reconstructing Truncated Integer Variables Satisfying Linear Congruences. SIAM J. Comput. Alan M. Frieze, Johan Håstad, Ravi Kannan, J. C. Lagarias, Adi Shamir
1988	J	`jnl`	Unique Extrapolation of Polynomial Recurrences. SIAM J. Comput. J. C. Lagarias, James A. Reeds
1987	J	`jnl`	Computing pi(x): An Analytic Method. J. Algorithms J. C. Lagarias, Andrew M. Odlyzko
1987	J	`jnl`	One-Way Functions and Circuit Complexity Inf. Comput. Ravi B. Boppana, J. C. Lagarias
1986	J	`jnl`	On the Capacity of Disjointly Shared Networks. Comput. Networks J. C. Lagarias, Andrew M. Odlyzko, Don Zagier
1986	—	`conf`	One- Way Functions and Circuit Complexity. SCT Ravi B. Boppana, J. C. Lagarias
1986	A	`conf`	Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers. STACS Johan Håstad, Bettina Helfrich, J. C. Lagarias, Claus-Peter Schnorr
1985	J	`jnl`	Solving Low-Density Subset Sum Problems J. ACM J. C. Lagarias, Andrew M. Odlyzko
1985	J	`jnl`	The Computational Complexity of Simultaneous Diophantine Approximation Problems. SIAM J. Comput. J. C. Lagarias
1984	A*	`conf`	Linear Congruential Generators Do Not Produce Random Sequences FOCS Alan M. Frieze, Ravi Kannan, J. C. Lagarias
1984	A*	`conf`	Performance Analysis of Shamir's Attack on the Basic Merkle-Hellman Knapsack Cryptosystem. ICALP J. C. Lagarias
1983	A*	`conf`	Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems. CRYPTO Ernest F. Brickell, J. C. Lagarias, Andrew M. Odlyzko
1983	A*	`conf`	Knapsack Public Key Cryptosystems and Diophantine Approximation. CRYPTO J. C. Lagarias
1983	J	`jnl`	Multi-Stage Planning and the Extended Linear-Quadratic-Gaussian Control Problem. Math. Oper. Res. J. C. Lagarias, F. Aminzadeh
1983	J	`jnl`	On the Density of Sequences of Integers the Sum of No Two of Which Is a Square II. General Sequences. J. Comb. Theory A J. C. Lagarias, Andrew M. Odlyzko, James B. Shearer
1983	A*	`conf`	Solving Low-Density Subset Sum Problems FOCS J. C. Lagarias, Andrew M. Odlyzko
1982	J	`jnl`	Minimal Storage Representations for Binary Relations. Inf. Process. Lett. J. C. Lagarias, Donald E. Swartwout
1982	J	`jnl`	On the Density of Sequences of Integers the Sum of No Two of which Is a Square. I. Arithmetic Progressions. J. Comb. Theory A J. C. Lagarias, Andrew M. Odlyzko, James B. Shearer
1982	A*	`conf`	The Computational Complexity of Simultaneous Diophantine Approximation Problems FOCS J. C. Lagarias
1981	—	`conf`	On the Requirements of Navigational Relationship Representations. SIGMOD Conference Donald E. Swartwout, J. C. Lagarias
1980	J	`jnl`	Worst-Case Complexity Bounds for Algorithms in the Theory of Integral Quadratic Forms. J. Algorithms J. C. Lagarias
1979	A*	`conf`	Succinct Certificates for the Solvability of Binary Quadratic Diophantine Equations FOCS J. C. Lagarias
1977	J	`jnl`	Minimum range sequences of all k-subsets of a set. Discret. Math. Frank K. Hwang, J. C. Lagarias