Willard L. Eastman

568 total citations
12 papers, 371 citations indexed

About

Willard L. Eastman is a scholar working on Artificial Intelligence, Electrical and Electronic Engineering and Computational Theory and Mathematics. According to data from OpenAlex, Willard L. Eastman has authored 12 papers receiving a total of 371 indexed citations (citations by other indexed papers that have themselves been cited), including 7 papers in Artificial Intelligence, 6 papers in Electrical and Electronic Engineering and 3 papers in Computational Theory and Mathematics. Recurrent topics in Willard L. Eastman's work include Coding theory and cryptography (6 papers), graph theory and CDMA systems (4 papers) and Advanced Wireless Communication Techniques (3 papers). Willard L. Eastman is often cited by papers focused on Coding theory and cryptography (6 papers), graph theory and CDMA systems (4 papers) and Advanced Wireless Communication Techniques (3 papers). Willard L. Eastman collaborates with scholars based in United States, Switzerland and Israel. Willard L. Eastman's co-authors include A. Lempel, Shimon Even, I. M. Isaacs, M. Cohn, I.S. Reed, T. K. Truong, Richard A. Games and Trieu‐Kien Truong and has published in prestigious journals such as Management Science, IEEE Transactions on Information Theory and IEEE Transactions on Antennas and Propagation.

In The Last Decade

Willard L. Eastman

12 papers receiving 335 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Willard L. Eastman United States	8	170	123	121	116	109	12	371
H. Ramesh India	9	122 0.7×	61 0.5×	29 0.2×	37 0.3×	137 1.3×	14	294
René Peeters Netherlands	5	127 0.7×	69 0.6×	75 0.6×	20 0.2×	86 0.8×	8	295
Arun Jagota United States	9	156 0.9×	74 0.6×	43 0.4×	38 0.3×	89 0.8×	35	276
Leslie M. Goldschlager Australia	9	217 1.3×	158 1.3×	65 0.5×	16 0.1×	396 3.6×	12	530
Stasys Jukna Germany	9	245 1.4×	111 0.9×	87 0.7×	13 0.1×	397 3.6×	42	571
Gideon Ehrlich Israel	4	151 0.9×	48 0.4×	102 0.8×	10 0.1×	117 1.1×	6	306
A. V. Geramita Canada	6	89 0.5×	83 0.7×	248 2.0×	19 0.2×	87 0.8×	8	370
J. E. L. Peck Canada	10	179 1.1×	67 0.5×	74 0.6×	14 0.1×	136 1.2×	33	436
Marek Kubale Poland	14	42 0.2×	251 2.0×	113 0.9×	254 2.2×	302 2.8×	54	630
Gregory Rodgers United States	6	97 0.6×	154 1.3×	71 0.6×	93 0.8×	142 1.3×	13	392

Countries citing papers authored by Willard L. Eastman

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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 of co-authors of Willard L. Eastman

This figure shows the co-authorship network connecting the top 25 collaborators of Willard L. Eastman. A scholar is included among the top collaborators of Willard L. Eastman 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 Willard L. Eastman. Willard L. Eastman is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

12 of 12 papers shown

Games, Richard A., et al.. (1993). Fast algorithm and architecture for constrained adaptive side-lobe cancellation. IEEE Transactions on Antennas and Propagation. 41(5). 683–686. 2 indexed citations

Eastman, Willard L.. (1988). Euclidean Decoders for BCH Codes. 1 indexed citations

Truong, T. K., et al.. (1988). Simplified procedure for correcting both errors and erasures of Reed-Solomon code using Euclidean algorithm. IEE Proceedings E Computers and Digital Techniques. 135(6). 318–318. 30 indexed citations

Truong, Trieu‐Kien, et al.. (1987). A simplified procedure for correcting both errors and erasures of a Reed-Solomon code using the Euclidean algorithm. Telecommunications and Data Acquisition Progress Report. 91. 200–212. 3 indexed citations

Lempel, A., M. Cohn, & Willard L. Eastman. (1977). A class of balanced binary sequences with optimal autocorrelation properties. IEEE Transactions on Information Theory. 23(1). 38–42. 96 indexed citations

Lempel, A. & Willard L. Eastman. (1971). High Speed Generation of Maximal Length Sequences. IEEE Transactions on Computers. C-20(2). 227–229. 33 indexed citations

Eastman, Willard L., et al.. (1969). Computational methods for best spline function approximation. Journal of Approximation Theory. 2(1). 85–96. 25 indexed citations

Eastman, Willard L.. (1965). On the construction of comma-free codes. IEEE Transactions on Information Theory. 11(2). 263–267. 52 indexed citations

Eastman, Willard L.. (1965). Comments on a Paper By Schild and Fredman. Management Science. 11(7). 754–755. 5 indexed citations

10.

Eastman, Willard L., Shimon Even, & I. M. Isaacs. (1964). Bounds for the Optimal Scheduling of n Jobs on m Processors. Management Science. 11(2). 268–279. 107 indexed citations

11.

Eastman, Willard L. & Shimon Even. (1964). On synchronizable and PSK-synchronizable block codes. IEEE Transactions on Information Theory. 10(4). 351–356. 10 indexed citations

12.

Eastman, Willard L.. (1959). A Note on the Multi-Commodity Warehouse Problem. Management Science. 5(3). 327–331. 7 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