Willard L. Eastman
-
- Scheduling and Optimization Algorithms 2
-
- Cellular Automata and Applications 3
- semigroups and automata theory 1
-
- Optimization and Search Problems 1
- Artificial Intelligence top 10%
- Coding theory and cryptography 6
- Cryptographic Implementations and Security 2
-
- graph theory and CDMA systems 4
- Advanced Wireless Communication Techniques 3
- Co-authors
- A. LempelShimon EvenI. M. IsaacsM. CohnI.S. ReedT. K. TruongTrieu‐Kien TruongRichard A. Games
- Cited by
- Industrial and Manufacturing EngineeringComputational Theory and MathematicsComputer Networks and Communications
- Journals
- Management Science (3 papers)IEEE Transactions on Information Theory (3 papers)IEEE Transactions on Antennas and Propagation (1 paper)
- Partner nations
- United StatesSwitzerlandIsrael
In The Last Decade
Willard L. Eastman
12 papers receiving 335 citations
Peers
Comparison fields: 5 of 48
- Industrial and Manufacturing Engineering 116
- Computational Theory and Mathematics 109
- Computer Networks and Communications 123
- Artificial Intelligence 170
- Discrete Mathematics and Combinatorics 10
Countries citing papers authored by Willard L. Eastman
This map shows the geographic impact of Willard L. Eastman'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 Willard L. Eastman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Willard L. Eastman more than expected).
Fields of papers citing papers by Willard L. Eastman
This network shows the impact of papers produced by Willard L. Eastman. 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 Willard L. Eastman. The network helps show where Willard L. Eastman may publish in the future.
Co-authorship network
The 8 scholars most cited alongside Willard L. Eastman, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 1993 | 2 | |
| 2 | Euclidean Decoders for BCH Codes | 1988 | 1 |
| 3 | 1988 | 30 | |
| 4 | A simplified procedure for correcting both errors and erasures of a Reed-Solomon code using the Euclidean algorithm | 1987 | 3 |
| 5 | 1977 | 96 | |
| 6 | 1971 | 33 | |
| 7 | 1969 | 25 | |
| 8 | 1965 | 52 | |
| 9 | 1965 | 5 | |
| 10 | 1964 | 107 | |
| 11 | 1964 | 10 | |
| 12 | 1959 | 7 |
About Willard L. Eastman
Willard L. Eastman is a scholar working on Industrial and Manufacturing Engineering, Artificial Intelligence and Computational Theory and Mathematics, having authored 12 papers that have together received 371 indexed citations. Recurring topics across this work include Coding theory and cryptography (6 papers), graph theory and CDMA systems (4 papers), Advanced Wireless Communication Techniques (3 papers), Cellular Automata and Applications (3 papers), Scheduling and Optimization Algorithms (2 papers), Cryptographic Implementations and Security (2 papers), semigroups and automata theory (1 paper) and Optimization and Search Problems (1 paper). The work is most often cited by research in Industrial and Manufacturing Engineering (116 citations), Computational Theory and Mathematics (109 citations) and Computer Networks and Communications (123 citations). Willard L. Eastman has collaborated with scholars based in United States, Switzerland and Israel. Frequent co-authors include A. Lempel, Shimon Even, I. M. Isaacs, M. Cohn, I.S. Reed, T. K. Truong, Trieu‐Kien Truong and Richard A. Games. Their work appears in journals such as Management Science, IEEE Transactions on Information Theory and IEEE Transactions on Antennas and Propagation.
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.