E. R. Rodemich

2.5k total citations · 1 hit paper
43 papers, 1.6k citations indexed

About

E. R. Rodemich is a scholar working on Artificial Intelligence, Electrical and Electronic Engineering and Computer Networks and Communications. According to data from OpenAlex, E. R. Rodemich has authored 43 papers receiving a total of 1.6k indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Artificial Intelligence, 11 papers in Electrical and Electronic Engineering and 6 papers in Computer Networks and Communications. Recurrent topics in E. R. Rodemich's work include Coding theory and cryptography (5 papers), Neural Networks and Applications (5 papers) and Error Correcting Code Techniques (4 papers). E. R. Rodemich is often cited by papers focused on Coding theory and cryptography (5 papers), Neural Networks and Applications (5 papers) and Error Correcting Code Techniques (4 papers). E. R. Rodemich collaborates with scholars based in United States and Taiwan. E. R. Rodemich's co-authors include Robert J. McEliece, Edward C. Posner, Santosh S. Venkatesh, Howard Rumsey, Adriano M. Garsia, L. R. Welch, John R. Pierce, V. Vilnrotter, Joel Franklin and Emmanuel Meeron and has published in prestigious journals such as Journal of the American Statistical Association, IEEE Transactions on Information Theory and Mathematics of Computation.

In The Last Decade

E. R. Rodemich

42 papers receiving 1.4k citations

Hit Papers

The capacity of the Hopfield associative memory 1987 2026 2000 2013 1987 200 400 600
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. The capacity of the Hopfield associative memory
    1987 603 citations Robert J. McEliece, Edward C. Posner et al. IEEE Transactions on Information Theory profile →

Peers

E. R. Rodemich
Edward C. Posner United States
Ioannis Kontoyiannis United States
Paul C. Shields United States
Amiel Feinstein United States
John C. Kieffer United States
Nelson M. Blachman United States
L. Davisson United States
L. L. Campbell Canada
K. S. Banerjee United States
Stéphane Boucheron France
Edward C. Posner United States
E. R. Rodemich
Citations per year, relative to E. R. Rodemich E. R. Rodemich (= 1×) peers Edward C. Posner

Countries citing papers authored by E. R. Rodemich

Since Specialization
Citations

This map shows the geographic impact of E. R. Rodemich'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 E. R. Rodemich with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites E. R. Rodemich more than expected).

Fields of papers citing papers by E. R. Rodemich

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by E. R. Rodemich. 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 E. R. Rodemich. The network helps show where E. R. Rodemich may publish in the future.

Co-authorship network of co-authors of E. R. Rodemich

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

All Works

20 of 20 papers shown
1.
Rodemich, E. R.. (2014). The fifth coefficient for bounded univalent functions with real coefficients. Advances in Mathematics. 263. 468–512. 1 indexed citations
2.
Vilnrotter, V. & E. R. Rodemich. (1994). A digital combining-weight estimation algorithm for broadband sources with the array feed compensation system. NASA Technical Reports Server (NASA). 116. 86–97. 3 indexed citations
3.
Vilnrotter, V. & E. R. Rodemich. (1990). A real-time signal combining system for Ka-band feed arrays using maximum-likelihood weight estimates. Telecommunications and Data Acquisition Progress Report. 100. 81–99. 3 indexed citations
4.
McEliece, Robert J., Edward C. Posner, E. R. Rodemich, & Santosh S. Venkatesh. (1988). The capacity of the Hopfield associative memory. IEEE Computer Society Press eBooks. 100–121. 1 indexed citations
5.
McEliece, Robert J., Edward C. Posner, E. R. Rodemich, & Santosh S. Venkatesh. (1987). The capacity of the Hopfield associative memory. IEEE Transactions on Information Theory. 33(4). 461–482. 603 indexed citations breakdown →
6.
Vilnrotter, V. & E. R. Rodemich. (1986). Table Look-Up Estimation of Signal and Noise Parameters From Quantized Observables. NASA STI Repository (National Aeronautics and Space Administration). 87. 104–113. 1 indexed citations
7.
Vilnrotter, V., E. R. Rodemich, & Hark Hoe Tan. (1986). A Synchronization Technique for Optical PPM Signals. 87. 24–31. 3 indexed citations
8.
McEliece, Robert J. & E. R. Rodemich. (1980). The constantinrao construction for binary asymmetric error-correcting codes. Information and Control. 44(2). 187–196. 22 indexed citations
9.
Rodemich, E. R.. (1980). The groups of order 128. Journal of Algebra. 67(1). 129–142. 6 indexed citations
10.
McEliece, Robert J., et al.. (1979). The practical limits of photon communication. 55. 63–67. 12 indexed citations
11.
Rodemich, E. R. & Robert J. McEliece. (1979). The Constantin-Rao Construction for Binary Asymmetric Error-Correcting Codes. 51. 124–129. 14 indexed citations
12.
McEliece, Robert J., et al.. (1978). The Lovasz Bound and Some Generalizations. 45. 133–146. 28 indexed citations
13.
Kleinrock, Leonard, Richard R. Muntz, & E. R. Rodemich. (1971). The processor‐sharing queueing model for time‐shared systems with bulk arrivals. Networks. 1(1). 1–13. 28 indexed citations
14.
Rodemich, E. R.. (1970). Coverings by rook domains. Journal of Combinatorial Theory. 9(2). 117–128. 16 indexed citations
15.
Posner, Edward C., et al.. (1969). Application of an Estimator of High Efficiency in Bivariate Extreme Value Theory. Journal of the American Statistical Association. 64(328). 1403–1414. 5 indexed citations
16.
Posner, Edward C., E. R. Rodemich, & Howard Rumsey. (1969). Epsilon Entropy of Gaussian Processes. The Annals of Mathematical Statistics. 40(4). 1272–1296. 10 indexed citations
17.
Garsia, Adriano M., E. R. Rodemich, & Howard Rumsey. (1969). On some extremal positive definite functions.. NASA Technical Reports Server (NASA). 11 indexed citations
18.
Garsia, Adriano M., Edward C. Posner, & E. R. Rodemich. (1968). Some properties of the measures on function spaces induced by Gaussian processes. Journal of Mathematical Analysis and Applications. 21(1). 150–161. 7 indexed citations
19.
Posner, Edward C., E. R. Rodemich, & Howard Rumsey. (1967). Epsilon Entropy of Stochastic Processes. The Annals of Mathematical Statistics. 38(4). 1000–1020. 31 indexed citations
20.
Garsia, Adriano M. & E. R. Rodemich. (1966). On functions satisfying the mean value property with respect to a product measure. Proceedings of the American Mathematical Society. 17(3). 592–594. 5 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

Breakdown of academic impact, for papers by Edward C. Posner Breakdown of academic impact, for papers by Ioannis Kontoyiannis Breakdown of academic impact, for papers by Paul C. Shields Breakdown of academic impact, for papers by Amiel Feinstein Breakdown of academic impact, for papers by John C. Kieffer Breakdown of academic impact, for papers by Nelson M. Blachman Breakdown of academic impact, for papers by L. Davisson Breakdown of academic impact, for papers by L. L. Campbell Breakdown of academic impact, for papers by K. S. Banerjee Breakdown of academic impact, for papers by Stéphane Boucheron
Rankless by CCL
2026