| Erratum: Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers. | 0 | 0.34 | 2014 |
| Approximate Squaring | 1 | 0.48 | 2004 |
| Pinwheel Scheduling: Achievable Densities | 9 | 0.56 | 2002 |
| The EKG Sequence | 1 | 12.33 | 2002 |
| On the robustness of single-loop sigma-delta modulation | 12 | 2.54 | 2001 |
| Processor Shadowing: Maximizing Expected Throughput in Fault-Tolerant Systems | 3 | 0.70 | 1999 |
| Multiregular Point Systems. | 6 | 2.03 | 1998 |
| Interference-Minimizing Colorings of Regular Graphs | 2 | 0.41 | 1998 |
| Counting <Emphasis Type="Italic">d</Emphasis> -Step Paths in Extremal Dantzig Figures | 0 | 0.34 | 1998 |
| Minimax and Hamiltonian dynamics of excitatory-inhibitory networks | 7 | 2.55 | 1997 |
| The D-Step Conjecture And Gaussian Elimination | 4 | 1.54 | 1997 |
| The D-Step Conjecture And Gaussian Elimination | 4 | 1.54 | 1997 |
| The Parameter Space of the d-step Conjecture | 0 | 0.34 | 1996 |
| Polytopes that Fill Rn and Scissors Congruence | 1 | 0.36 | 1995 |
| Acknowledgment of Priority Concerning Polytopes that Fill Rn and Scissors Congruence | 0 | 0.34 | 1995 |
| Cube-Tilings of Rn and Nonlinear Codes | 5 | 2.24 | 1994 |
| A Polyomino Tiling Problem of Thurston and Its Configurational Entropy. | 0 | 0.34 | 1993 |
| A polyomino tiling problem of Thurston and its configurational entropy | 9 | 1.68 | 1993 |
| Self-packing of centrally symmetric convex bodies in R2 | 3 | 0.79 | 1992 |
| Sets uniquely determined by projections on axes II Discrete case | 21 | 3.32 | 1991 |
| Karmarkar's linear programming algorithm and Newton's method | 11 | 1.01 | 1991 |
| Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice | 42 | 7.80 | 1990 |
| Tiling with Polyominoes and Combinatorial Group Theory | 60 | 17.40 | 1990 |
| Algorithms for packing squares: a probabilistic analysis | 4 | 1.72 | 1989 |
| Single-suit two-person card play III. The mise`re game | 3 | 1.20 | 1989 |
| Computing pi(x): An Analytic Method | 2 | 0.54 | 1987 |
| On the capacity of disjointly shared networks | 4 | 0.98 | 1986 |
| Polynomial time algorithms for finding integer relations among real numbers | 48 | 17.77 | 1986 |
| The computational complexity of simultaneous diophantine approximation problems | 91 | 24.33 | 1985 |
| Solving low-density subset sum problems | 129 | 29.20 | 1985 |
| Linear Congruential Generators Do Not Produce Random Sequences | 14 | 38.92 | 1984 |
| Performance Analysis of Shamir's Attack on the Basic Merkle-Hellman Knapsack Cryptosystem | 4 | 0.62 | 1984 |
| Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems | 4 | 1.12 | 1983 |
| Knapsack Public Key Cryptosystems and Diophantine Approximation | 13 | 10.71 | 1983 |
| Solving low density subset sum problems | 9 | 2.57 | 1983 |
| Multi-Stage Planning and the Extended Linear-Quadratic-Gaussian Control Problem | 1 | 0.55 | 1983 |
| Minimal storage representations for binary relations | 0 | 0.34 | 1982 |
| On the Requirements of Navigational Relationship Representations. | 6 | 29.56 | 1981 |
| Worst-case complexity bounds for algorithms in the theory of integral quadratic forms | 30 | 14.50 | 1980 |
