The following pages link to Jeffrey C. Lagarias (Q176453):
Displaying 50 items.
- Stochastic Models for the 3x+1 and 5x+1 Problems (Q2996238) (← links)
- Polynomial Time Algorithms for Finding Integer Relations among Real Numbers (Q3033848) (← links)
- The 3<i>x</i>+ 1 Conjugacy Map (Q3128433) (← links)
- The lap-counting function for linear mod one transformations II: the Markov chain for generalized lap numbers (Q3129838) (← links)
- A Collinear Scaling Interpretation of Karmarkar’s Linear Programming Algorithm (Q3140007) (← links)
- The computational complexity of knot and link problems (Q3158535) (← links)
- Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle (Q3222847) (← links)
- (Q3320458) (← links)
- (Q3328638) (← links)
- (Q3351137) (← links)
- Zero spacing distributions for differenced L-functions (Q3367586) (← links)
- Dynamics of a family of piecewise-linear area-preserving plane maps II. Invariant circles (Q3369565) (← links)
- Dynamics of a family of piecewise-linear area-preserving plane maps III. Cantor set spectra (Q3369569) (← links)
- On Toric Orbits in the Affine Sieve (Q3383704) (← links)
- BENFORD'S LAW FOR THE $3x+1$ FUNCTION (Q3419075) (← links)
- (Q3437620) (← links)
- Book Review: Dense sphere packings: a blueprint for formal proofs (Q3451250) (← links)
- Sets Uniquely Determined by Projections on Axes I. Continuous Case (Q3471036) (← links)
- The Nonlinear Geometry of Linear Programming. III Projective Legendre Transform Coordinates and Hilbert Geometry (Q3478261) (← links)
- CYCLIC SYSTEMS OF SIMULTANEOUS CONGRUENCES (Q3553696) (← links)
- (Q3595625) (← links)
- (Q3626690) (← links)
- Ternary expansions of powers of 2 (Q3630819) (← links)
- On the Existence of Fields Governing the 2-Invariants of the Classgroup of Q(√dp) as p Varies (Q3674773) (← links)
- The Computational Complexity of Simultaneous Diophantine Approximation Problems (Q3676213) (← links)
- Computing π(x): The Meissel-Lehmer Method (Q3677807) (← links)
- The 3x + 1 Problem and Its Generalizations (Q3680903) (← links)
- (Q3689090) (← links)
- On the capacity of disjointly shared networks (Q3701318) (← links)
- Probabilities for Intersecting Systems and Random Subsets of Finite Sets (Q3704664) (← links)
- (Q3745271) (← links)
- (Q3753481) (← links)
- Computing π(x): An analytic method (Q3758923) (← links)
- Solving low-density subset sum problems (Q3770433) (← links)
- Reconstructing Truncated Integer Variables Satisfying Linear Congruences (Q3800123) (← links)
- Unique Extrapolation of Polynomial Recurrences (Q3811582) (← links)
- Algorithms for Packing Squares: A Probabilistic Analysis (Q3823793) (← links)
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories (Q3824098) (← links)
- The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories (Q3824099) (← links)
- Single-Suit Two-Person Card Play III. The Misère Game (Q3824133) (← links)
- Signatures of units and congruences (mod 4) in certain totally real fields. (Q3880925) (← links)
- Signatures of units and congruences (mod 4) in certain real quadratic fields. II. (Q3880926) (← links)
- (Q3889134) (← links)
- Divisibility Properties of Some Cyclotomic Sequences (Q3889158) (← links)
- On the Computational Complexity of Determining the Solvability or Unsolvability of the Equation X 2 - DY 2 = -1 (Q3890763) (← links)
- (Q3900142) (← links)
- Worst-case complexity bounds for algorithms in the theory of integral quadratic forms (Q3928238) (← links)
- (Q3947734) (← links)
- Best Simultaneously Diophantine Approximations. I. Growth Rates of Best Approximation Denominators (Q3958535) (← links)
- (Q3963088) (← links)