K. Sohraby
- Computer Networks and Communications top 0.2%
- Electrical and Electronic Engineering top 2%
- Management Information Systems top 2%
- Computer Vision and Pattern Recognition top 5%
- Information Systems top 5%
- Co-authors
- Daniel MinoliTaieb ZnatiBenedict OcchiogrossoChonggang WangMahmoud DaneshmandYueming HuBo LiMordecai J. Golin
- Topics
- Network Traffic and Congestion Control (44 papers)Advanced Queuing Theory Analysis (43 papers)Wireless Communication Networks Research (22 papers)
- Cited by
- Computer Networks and CommunicationsManagement Information SystemsElectrical and Electronic Engineering
- Journals
- IEEE Journal on Selected Areas in CommunicationsIEEE Communications MagazineIEEE Transactions on Communications
- Partner nations
- United StatesHong KongChina
In The Last Decade
K. Sohraby
136 papers receiving 3.4k citations
Hit Papers
Peers
Comparison fields: 5 of 109
- Computer Networks and Communications 2.9k
- Electrical and Electronic Engineering 1.7k
- Management Information Systems 359
- Computer Vision and Pattern Recognition 205
- Information Systems 192
Countries citing papers authored by K. Sohraby
This map shows the geographic impact of K. Sohraby'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 K. Sohraby with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites K. Sohraby more than expected).
Fields of papers citing papers by K. Sohraby
This network shows the impact of papers produced by K. Sohraby. 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 K. Sohraby. The network helps show where K. Sohraby may publish in the future.
Co-authorship network of co-authors of K. Sohraby
This figure shows the co-authorship network connecting the top 25 collaborators of K. Sohraby. A scholar is included among the top collaborators of K. Sohraby 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 K. Sohraby. K. Sohraby is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 4 | |
| 2 | 4 | |
| 3 | 3 | |
| 4 | 52 | |
| 5 | 33 | |
| 6 | 12 | |
| 7 | 6 | |
| 8 | 10 | |
| 9 | 55 | |
| 10 | 0 | |
| 11 | 138 | |
| 12 | 9 | |
| 13 | A quadratically convergent Bernoulli-like algorithm for solving matrix polynomial equations in Markov chains. | 5 |
| 14 | 1 | |
| 15 | 29 | |
| 16 | 0 | |
| 17 | 3 | |
| 18 | 5 | |
| 19 | 6 | |
| 20 | 1 |
About K. Sohraby
K. Sohraby is a scholar working on Computer Networks and Communications, Management Information Systems and Electrical and Electronic Engineering, having authored 144 papers that have together received 3.7k indexed citations. Recurring topics across this work include Network Traffic and Congestion Control (44 papers), Advanced Queuing Theory Analysis (43 papers) and Wireless Communication Networks Research (22 papers). The work is most often cited by research in Computer Networks and Communications (2.9k citations), Management Information Systems (359 citations) and Electrical and Electronic Engineering (1.7k citations). K. Sohraby has collaborated with scholars based in United States, Hong Kong and China. Frequent co-authors include Daniel Minoli, Taieb Znati, Benedict Occhiogrosso, Chonggang Wang, Mahmoud Daneshmand, Yueming Hu, Bo Li, Bo Li, Mordecai J. Golin and Xin Deng. Their work appears in journals such as IEEE Journal on Selected Areas in Communications, IEEE Communications Magazine and IEEE Transactions on Communications.
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.