Search the dblp DataBase
Harold Fredricksen :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Harold Fredricksen , Melvin M. Sweet Symmetric Sum-Free Partitions and Lower Bounds for Schur Numbers. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 2000, v:7, n:, pp:- [Journal ] Harold Fredricksen A New Look at the de Bruijn Graph. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1992, v:37, n:, pp:193-203 [Journal ] Harold Fredricksen Generation of the Ford Sequence of Length 2^{n} , n Large. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1972, v:12, n:1, pp:153-154 [Journal ] Harold Fredricksen A Class of Nonlinear de Bruijn Cycles. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1975, v:19, n:2, pp:192-199 [Journal ] Harold Fredricksen Schur Numbers and the Ramsey Numbers N(3, 3, ..., 3; 2). [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1979, v:27, n:3, pp:376-377 [Journal ] Harold Fredricksen , Irving J. Kessler Lexicographic Compositions and deBruijn Sequences. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1977, v:22, n:1, pp:17-30 [Journal ] Harold Fredricksen The number of nonlinear shift registers that produce all vectors of weight <t. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1993, v:39, n:6, pp:1989-0 [Journal ] Harold Fredricksen , Irving J. Kessler An algorithm for generating necklaces of beads in two colors. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1986, v:61, n:2-3, pp:181-188 [Journal ] Roy D. Bryant , Harold Fredricksen Covering the de Bruijn graph. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1991, v:89, n:2, pp:133-148 [Journal ] Search in 0.005secs, Finished in 0.006secs