 | 2000 |
|---|
| 9 |       | Harold Fredricksen,
Melvin M. Sweet:
Symmetric Sum-Free Partitions and Lower Bounds for Schur Numbers.
Electr. J. Comb. 7: (2000) |
| 1993 |
|---|
| 8 | | Harold Fredricksen:
The number of nonlinear shift registers that produce all vectors of weight <t.
IEEE Transactions on Information Theory 39(6): 1989-1990 (1993) |
| 1992 |
|---|
| 7 | | Harold Fredricksen:
A New Look at the de Bruijn Graph.
Discrete Applied Mathematics 37/38: 193-203 (1992) |
| 1991 |
|---|
| 6 |  | Roy D. Bryant,
Harold Fredricksen:
Covering the de Bruijn graph.
Discrete Mathematics 89(2): 133-148 (1991) |
| 1986 |
|---|
| 5 | | Harold Fredricksen,
Irving J. Kessler:
An algorithm for generating necklaces of beads in two colors.
Discrete Mathematics 61(2-3): 181-188 (1986) |
| 1979 |
|---|
| 4 | | Harold Fredricksen:
Schur Numbers and the Ramsey Numbers N(3, 3, ..., 3; 2).
J. Comb. Theory, Ser. A 27(3): 376-377 (1979) |
| 1977 |
|---|
| 3 | | Harold Fredricksen,
Irving J. Kessler:
Lexicographic Compositions and deBruijn Sequences.
J. Comb. Theory, Ser. A 22(1): 17-30 (1977) |
| 1975 |
|---|
| 2 | | Harold Fredricksen:
A Class of Nonlinear de Bruijn Cycles.
J. Comb. Theory, Ser. A 19(2): 192-199 (1975) |
| 1972 |
|---|
| 1 | | Harold Fredricksen:
Generation of the Ford Sequence of Length 2n, n Large.
J. Comb. Theory, Ser. A 12(1): 153-154 (1972) |
Data released under the ODC-BY 1.0 license — See also our legal information page