Fred S. Annexstein

605 total citations
28 papers, 376 citations indexed

About

Fred S. Annexstein is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, Fred S. Annexstein has authored 28 papers receiving a total of 376 indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Computer Networks and Communications, 11 papers in Computational Theory and Mathematics and 10 papers in Electrical and Electronic Engineering. Recurrent topics in Fred S. Annexstein's work include Interconnection Networks and Systems (14 papers), Advanced Graph Theory Research (9 papers) and Peer-to-Peer Network Technologies (6 papers). Fred S. Annexstein is often cited by papers focused on Interconnection Networks and Systems (14 papers), Advanced Graph Theory Research (9 papers) and Peer-to-Peer Network Technologies (6 papers). Fred S. Annexstein collaborates with scholars based in United States, Taiwan and France. Fred S. Annexstein's co-authors include Arnold L. Rosenberg, Ram Swaminathan, Kenneth A. Berman, John Franco, John S. Schlipf, Michael T. Helmick, Tsan‐sheng Hsu, Martin Herbordt, Charles Weems and Chad Yoshikawa and has published in prestigious journals such as IEEE Transactions on Computers, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Fred S. Annexstein

25 papers receiving 328 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Fred S. Annexstein United States	8	268	177	146	89	47	28	376
Jaroslav Opatrný Canada	11	259 1.0×	139 0.8×	142 1.0×	49 0.6×	22 0.5×	43	368
Stéphane Pérennès France	12	409 1.5×	239 1.4×	159 1.1×	69 0.8×	10 0.2×	70	573
M. Dowd United States	7	185 0.7×	107 0.6×	55 0.4×	102 1.1×	35 0.7×	27	277
Eliezer Dekel United States	7	252 0.9×	156 0.9×	67 0.5×	91 1.0×	143 3.0×	26	411
Tero Laihonen Finland	14	315 1.2×	210 1.2×	233 1.6×	267 3.0×	24 0.5×	72	525
Philipp Woelfel Canada	11	239 0.9×	98 0.6×	48 0.3×	143 1.6×	98 2.1×	50	360
Vladimir Sidorenko Germany	15	356 1.3×	142 0.8×	403 2.8×	448 5.0×	40 0.9×	75	589
Krzysztof Diks Poland	11	229 0.9×	139 0.8×	26 0.2×	83 0.9×	22 0.5×	37	347
Naomi Nishimura Canada	12	180 0.7×	300 1.7×	27 0.2×	79 0.9×	11 0.2×	34	385
J Bermond France	12	363 1.4×	348 2.0×	328 2.2×	86 1.0×	34 0.7×	22	690

Countries citing papers authored by Fred S. Annexstein

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

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

20 of 20 papers shown

Wilsey, Philip A., et al.. (2013). A GPGPU Algorithm for c-Approximate r-Nearest Neighbor Search in High Dimensions. 2. 2079–2088. 1 indexed citations

Helmick, Michael T. & Fred S. Annexstein. (2007). Depth-Latency Tradeoffs in Multicast Tree Algorithms. 555–564. 7 indexed citations

Annexstein, Fred S., et al.. (2006). Broadcasting in unstructured peer-to-peer overlay networks. Theoretical Computer Science. 355(1). 25–36. 3 indexed citations

Berman, Kenneth A., et al.. (2006). Dominating Connectivity and Reliability of Heterogeneous Sensor Networks. 91–95. 2 indexed citations

Annexstein, Fred S. & Kenneth A. Berman. (2004). A Space-Efficient Model for Sharing Personal Knowledge Objects in Peer Communities..

Annexstein, Fred S., et al.. (2003). Indexing techniques for file sharing in scalable peer-to-peer networks. 22. 10–15. 4 indexed citations

Annexstein, Fred S. & Kenneth A. Berman. (2002). Distributed models and algorithms for survivability in network routing. 359–364. 1 indexed citations

Annexstein, Fred S., et al.. (2001). Latency effects on reachability in large-scale peer-to-peer networks. 84–92. 13 indexed citations

Annexstein, Fred S., Kenneth A. Berman, Tsan‐sheng Hsu, & Ram Swaminathan. (2000). A multi-tree routing scheme using acyclic orientations. Theoretical Computer Science. 240(2). 487–494. 2 indexed citations

10.

Annexstein, Fred S. & Kenneth A. Berman. (2000). Directional Routing via Generalized st-Numberings. SIAM Journal on Discrete Mathematics. 13(2). 268–279. 6 indexed citations

11.

Annexstein, Fred S. & Ram Swaminathan. (1998). On testing consecutive-ones property in parallel. Discrete Applied Mathematics. 88(1-3). 7–28. 7 indexed citations

12.

Annexstein, Fred S., et al.. (1997). On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings.. 12–23. 1 indexed citations

13.

Annexstein, Fred S. & John Franco. (1995). Work-preserving emulations of shuffle-exchange networks: An analysis of the complex plane diagram. Discrete Applied Mathematics. 60(1-3). 13–23. 1 indexed citations

14.

Annexstein, Fred S. & Ram Swaminathan. (1995). On testing consecutive-ones property in parallel. 234–243. 3 indexed citations

15.

Annexstein, Fred S.. (1994). Embedding Hypercubes and Related Networks into Mesh-Connected Processor Arrays. Journal of Parallel and Distributed Computing. 23(1). 72–79. 2 indexed citations

16.

Annexstein, Fred S., et al.. (1993). On the diameter and bisector size of Cayley graphs. Theory of Computing Systems. 26(3). 271–291. 12 indexed citations

17.

Annexstein, Fred S.. (1991). Fault tolerance in hypercube-derivative networks (preliminary version). ACM SIGARCH Computer Architecture News. 19(1). 25–34. 2 indexed citations

18.

Annexstein, Fred S., et al.. (1991). A unified framework for off-line permutation routing in parallel networks. Theory of Computing Systems. 24(1). 233–251. 28 indexed citations

19.

Annexstein, Fred S., et al.. (1990). A unified approach to off-line permutation routing on parallel networks. 398–406. 42 indexed citations

20.

Annexstein, Fred S.. (1989). Fault tolerance in hypercube-derivative networks. 179–188. 30 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