2002 |
15 | EE | Peter C. Fishburn,
Aleksandar Pekec,
James A. Reeds:
Subset Comparisons for Additive Linear Orders.
Math. Oper. Res. 27(1): 227-243 (2002) |
2001 |
14 | EE | Peter C. Fishburn,
James A. Reeds:
Counting Split Semiorders.
Order 18(2): 119-128 (2001) |
13 | EE | James A. Reeds,
Peter C. Fishburn:
Counting Split Interval Orders.
Order 18(2): 129-135 (2001) |
1997 |
12 | EE | J. C. Lagarias,
N. Prabhu,
James A. Reeds:
The d-Step Conjecture and Gaussian Elimination.
Discrete & Computational Geometry 18(1): 53-82 (1997) |
1996 |
11 | | J. C. Lagarias,
N. Prabhu,
James A. Reeds:
The Parameter Space of the d-step Conjecture.
FSTTCS 1996: 52-63 |
1994 |
10 | EE | Peter C. Fishburn,
James A. Reeds:
Bell Inequalities, Grothendieck's Constant, and Root Two.
SIAM J. Discrete Math. 7(1): 48-56 (1994) |
1992 |
9 | | Peter C. Fishburn,
James A. Reeds:
Unit Distances Between Vertices of a Convex Polygon.
Comput. Geom. 2: 81-91 (1992) |
8 | | M. Douglas McIlroy,
James A. Reeds:
Multilevel Security in the UNIX Tradition.
Softw., Pract. Exper. 22(8): 673-694 (1992) |
1991 |
7 | EE | Peter C. Fishburn,
J. C. Lagarias,
James A. Reeds,
Larry A. Shepp:
Sets uniquely determined by projections on axes II Discrete case.
Discrete Mathematics 91(2): 149-159 (1991) |
1988 |
6 | | Lester E. Dubins,
Alon Orlitsky,
James A. Reeds,
Lawrence A. Shepp:
Self-avoiding random loops.
IEEE Transactions on Information Theory 34(6): 1509-1516 (1988) |
5 | | J. C. Lagarias,
James A. Reeds:
Unique Extrapolation of Polynomial Recurrences.
SIAM J. Comput. 17(2): 342-362 (1988) |
1985 |
4 | | James A. Reeds,
N. J. A. Sloane:
Shift-Register Synthesis (Modulo m).
SIAM J. Comput. 14(3): 505-513 (1985) |
1984 |
3 | EE | James A. Reeds,
J. L. Manferdelli:
DES Has No Per Round Linear Factors.
CRYPTO 1984: 377-389 |
1983 |
2 | | James A. Reeds,
N. J. A. Sloane:
Shift-Register Synthesis (Modula m).
CRYPTO 1983: 249 |
1982 |
1 | | Dov Andelman,
James A. Reeds:
On the cryptanalysis of rotor machines and substitution - permutation networks.
IEEE Transactions on Information Theory 28(4): 578-584 (1982) |