S. Latifi

2.1k citations
46 papers · 1.3k indexed · h-index 13

Impact in

Papers in

S. Latifi

43 papers receiving 1.2k citations

Peers

S. Latifi
Comparison fields: 5 of 62
  • Computer Networks and Communications 1.2k
  • Hardware and Architecture 274
  • Computational Theory and Mathematics 299
  • Geometry and Topology 97
  • Electrical and Electronic Engineering 604
Replace Mort Naraghi‐Pour with:
Mort Naraghi‐Pour United States
Yoji Kajitani Japan
Chin‐Tau Lea Hong Kong
Ted H. Szymanski Canada
Claude Iung France
Sotirios G. Ziavras United States
Olivier Sentieys France
Xianlong Hong China
Pierre Riedinger France
Dezun Dong China
S. Latifi relative to Mort Naraghi‐Pour United States Mort Naraghi‐Pour's profile →
Citations per field
00.5×6.4×
Mort Naraghi‐Pour · 1×
Citations per year

Countries citing papers authored by S. Latifi

Since Specialization
Citations

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

Fields of papers citing papers by S. Latifi

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authors

The 21 scholars most cited alongside S. Latifi, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with S. Latifi Line = papers co-authored together S. Latifi links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown
#Work
1 20243
2 20241
3 200512
4 2005266
5 20033
6 20020
7 200222
8 20021
9 20021
10 20020
11 20006
12 19981
13
Average Distance and Routing Algorithms in the Star-Connected Cycles Interconnection Network
19971
14 19931
15 199344
16 199360
17 19920
18 199113
19 19909
20 19892

About S. Latifi

S. Latifi is a scholar working on Computer Networks and Communications, Hardware and Architecture, Computational Theory and Mathematics, Electrical and Electronic Engineering and Computer Vision and Pattern Recognition, having authored 46 papers that have together received 1.3k indexed citations. Recurring topics across this work include Interconnection Networks and Systems (35 papers), Advanced Graph Theory Research (11 papers), VLSI and FPGA Design Techniques (9 papers), Advanced Optical Network Technologies (8 papers), Embedded Systems Design Techniques (7 papers), Supercapacitor Materials and Fabrication (5 papers), Software-Defined Networks and 5G (3 papers) and Distributed systems and fault tolerance (3 papers). The work is most often cited by research in Computer Networks and Communications (1.2k citations), Hardware and Architecture (274 citations), Computational Theory and Mathematics (299 citations), Geometry and Topology (97 citations) and Electrical and Electronic Engineering (604 citations). S. Latifi has collaborated with scholars based in United States, Austria and Germany. Frequent co-authors include A. El-Amawy, M.V. Hegde, Mort Naraghi‐Pour, Nader Bagherzadeh, Pradip K. Srimani, S. Q. Zheng, M. Dowd, Emma Regentova, Smitha Subramanian and Kazem Taghva. Their work appears in journals such as IEEE Transactions on Parallel and Distributed Systems, IEEE Transactions on Computers, IEEE Transactions on Reliability, Journal of Parallel and Distributed Computing and Computers & Electrical Engineering.

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

Rankless by CCL
2026