Harold Fredricksen

1.1k total citations
17 papers, 611 citations indexed

About

Harold Fredricksen is a scholar working on Artificial Intelligence, Discrete Mathematics and Combinatorics and Computational Theory and Mathematics. According to data from OpenAlex, Harold Fredricksen has authored 17 papers receiving a total of 611 indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Artificial Intelligence, 7 papers in Discrete Mathematics and Combinatorics and 7 papers in Computational Theory and Mathematics. Recurrent topics in Harold Fredricksen's work include Coding theory and cryptography (10 papers), Advanced Combinatorial Mathematics (7 papers) and graph theory and CDMA systems (5 papers). Harold Fredricksen is often cited by papers focused on Coding theory and cryptography (10 papers), Advanced Combinatorial Mathematics (7 papers) and graph theory and CDMA systems (5 papers). Harold Fredricksen collaborates with scholars based in United States. Harold Fredricksen's co-authors include L. D. Baumert, Remigiusz Wiśniewski, Alfred W. Hales, Thomas W. Cusick and Pantelimon Stănică and has published in prestigious journals such as IEEE Transactions on Information Theory, Mathematics of Computation and SIAM Review.

In The Last Decade

Harold Fredricksen

16 papers receiving 521 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Harold Fredricksen United States 11 428 346 222 104 61 17 611
Jürgen Bierbrauer United States 14 416 1.0× 137 0.4× 295 1.3× 184 1.8× 37 0.6× 63 537
Doug Wiedemann Canada 6 276 0.6× 224 0.6× 137 0.6× 45 0.4× 16 0.3× 6 435
Joe Sawada Canada 14 294 0.7× 376 1.1× 118 0.5× 170 1.6× 54 0.9× 62 578
Simon R. Blackburn⋆ United Kingdom 18 386 0.9× 285 0.8× 278 1.3× 156 1.5× 101 1.7× 55 743
Stasys Jukna Germany 9 245 0.6× 397 1.1× 87 0.4× 76 0.7× 29 0.5× 42 571
Shachar Lovett United States 15 402 0.9× 353 1.0× 125 0.6× 151 1.5× 31 0.5× 103 680
George Havas Australia 14 283 0.7× 181 0.5× 148 0.7× 250 2.4× 25 0.4× 62 610
Zeev Dvir United States 13 346 0.8× 332 1.0× 115 0.5× 104 1.0× 18 0.3× 53 562
Reginaldo Palazzo Brazil 12 355 0.8× 180 0.5× 176 0.8× 36 0.3× 98 1.6× 71 465
Sueli I. R. Costa Brazil 10 250 0.6× 129 0.4× 190 0.9× 50 0.5× 32 0.5× 69 456

Countries citing papers authored by Harold Fredricksen

Since Specialization
Citations

This map shows the geographic impact of Harold Fredricksen's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Harold Fredricksen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Harold Fredricksen more than expected).

Fields of papers citing papers by Harold Fredricksen

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Harold Fredricksen. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Harold Fredricksen. The network helps show where Harold Fredricksen may publish in the future.

Co-authorship network of co-authors of Harold Fredricksen

This figure shows the co-authorship network connecting the top 25 collaborators of Harold Fredricksen. A scholar is included among the top collaborators of Harold Fredricksen based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Harold Fredricksen. Harold Fredricksen is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

17 of 17 papers shown
1.
Cusick, Thomas W., Harold Fredricksen, & Pantelimon Stănică. (2007). On the Delta Sequence of the Thue-Morse Sequence. Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School). 39. 293–300. 1 indexed citations
2.
Fredricksen, Harold, et al.. (2000). Symmetric Sum-Free Partitions and Lower Bounds for Schur Numbers. The Electronic Journal of Combinatorics. 7(1). 19 indexed citations
3.
Fredricksen, Harold. (1993). The number of nonlinear shift registers that produce all vectors of weight >or=t. IEEE Transactions on Information Theory. 39(6). 1989–1990.
4.
Fredricksen, Harold. (1992). A new look at the de Bruijn graph. Discrete Applied Mathematics. 37-38. 193–203. 11 indexed citations
5.
Fredricksen, Harold, et al.. (1991). Covering the de Bruijn graph. Discrete Mathematics. 89(2). 133–148. 3 indexed citations
6.
Fredricksen, Harold, et al.. (1986). An algorithm for generating necklaces of beads in two colors. Discrete Mathematics. 61(2-3). 181–188. 41 indexed citations
7.
Fredricksen, Harold, et al.. (1986). A Generalization of Swan's Theorem. Mathematics of Computation. 46(173). 321–321. 4 indexed citations
8.
Fredricksen, Harold. (1982). A Survey of Full Length Nonlinear Shift Register Cycle Algorithms. SIAM Review. 24(2). 195–221. 256 indexed citations
9.
Fredricksen, Harold & Remigiusz Wiśniewski. (1981). On trinomials xn + x}2 + 1 and x8/ ± 3 + xk + 1 irreducible over GF(2). Information and Control. 50(1). 58–63. 7 indexed citations
10.
Fredricksen, Harold. (1979). Schur numbers and the ramsey numbers N(3, 3,…, 3; 2). Journal of Combinatorial Theory Series A. 27(3). 376–377. 10 indexed citations
11.
Fredricksen, Harold, et al.. (1978). Necklaces of beads in k colors and k-ary de Bruijn sequences. Discrete Mathematics. 23(3). 207–210. 94 indexed citations
12.
Fredricksen, Harold, et al.. (1977). Lexicographic compositions and deBruijn sequences. Journal of Combinatorial Theory Series A. 22(1). 17–30. 34 indexed citations
13.
Fredricksen, Harold. (1975). A class of nonlinear de Bruijn cycles. Journal of Combinatorial Theory Series A. 19(2). 192–199. 48 indexed citations
14.
Fredricksen, Harold. (1972). Generation of the ford sequence of length 2n, n large. Journal of Combinatorial Theory Series A. 12(1). 153–154. 29 indexed citations
15.
Fredricksen, Harold. (1970). The lexicographically least de Bruijn cycle. Journal of Combinatorial Theory. 9(1). 1–5. 21 indexed citations
16.
Fredricksen, Harold. (1970). Asymptotic behavior of Golomb's Z(n) conjecture (Corresp.). IEEE Transactions on Information Theory. 16(4). 509–510. 1 indexed citations
17.
Baumert, L. D. & Harold Fredricksen. (1967). The cyclotomic numbers of order eighteen with applications to difference sets. Mathematics of Computation. 21(98). 204–219. 32 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026