Fred S. Annexstein
- Computer Networks and Communications top 5%
- Computational Theory and Mathematics top 5%
- Electrical and Electronic Engineering
- Artificial Intelligence
- Hardware and Architecture top 10%
- Co-authors
- Arnold L. RosenbergRam SwaminathanKenneth A. BermanJohn FrancoJohn S. SchlipfMichael T. HelmickTsan‐sheng HsuCharles Weems
- Topics
- Interconnection Networks and Systems (14 papers)Advanced Graph Theory Research (9 papers)Peer-to-Peer Network Technologies (6 papers)
- Cited by
- Computer Networks and CommunicationsComputational Theory and MathematicsDiscrete Mathematics and Combinatorics
- Partner nations
- United StatesFranceGermany
In The Last Decade
Fred S. Annexstein
25 papers receiving 328 citations
Peers
Comparison fields: 5 of 47
- Computer Networks and Communications 268
- Computational Theory and Mathematics 177
- Electrical and Electronic Engineering 146
- Artificial Intelligence 89
- Hardware and Architecture 47
Countries citing papers authored by Fred S. Annexstein
This map shows the geographic impact of Fred S. Annexstein'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 Fred S. Annexstein with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Fred S. Annexstein more than expected).
Fields of papers citing papers by Fred S. Annexstein
This network shows the impact of papers produced by Fred S. Annexstein. 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 Fred S. Annexstein. The network helps show where Fred S. Annexstein may publish in the future.
Co-authorship network of co-authors of Fred S. Annexstein
This figure shows the co-authorship network connecting the top 25 collaborators of Fred S. Annexstein. A scholar is included among the top collaborators of Fred S. Annexstein 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 Fred S. Annexstein. Fred S. Annexstein is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 7 | |
| 3 | 3 | |
| 4 | 2 | |
| 5 | A Space-Efficient Model for Sharing Personal Knowledge Objects in Peer Communities. | 0 |
| 6 | 1 | |
| 7 | 4 | |
| 8 | 1 | |
| 9 | 13 | |
| 10 | 2 | |
| 11 | 6 | |
| 12 | 7 | |
| 13 | On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings. | 1 |
| 14 | 1 | |
| 15 | 2 | |
| 16 | 12 | |
| 17 | 2 | |
| 18 | 28 | |
| 19 | 42 | |
| 20 | 132 |
About Fred S. Annexstein
Fred S. Annexstein is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Hardware and Architecture, having authored 28 papers that have together received 376 indexed citations. Recurring topics across this work include Interconnection Networks and Systems (14 papers), Advanced Graph Theory Research (9 papers) and Peer-to-Peer Network Technologies (6 papers). The work is most often cited by research in Computer Networks and Communications (268 citations), Computational Theory and Mathematics (177 citations) and Discrete Mathematics and Combinatorics (23 citations). Fred S. Annexstein has collaborated with scholars based in United States, France and Germany. Frequent co-authors include Arnold L. Rosenberg, Ram Swaminathan, Kenneth A. Berman, John Franco, John S. Schlipf, Michael T. Helmick, Tsan‐sheng Hsu, Charles Weems, Brent Chun and Chad Yoshikawa. Their work appears in journals such as IEEE Transactions on Computers, SIAM Journal on Computing and Theoretical Computer Science.
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.