This map shows the geographic impact of Moris Behnam'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 Moris Behnam with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Moris Behnam more than expected).
This network shows the impact of papers produced by Moris Behnam. 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 Moris Behnam. The network helps show where Moris Behnam may publish in the future.
Co-authorship network of co-authors of Moris Behnam
This figure shows the co-authorship network connecting the top 25 collaborators of Moris Behnam.
A scholar is included among the top collaborators of Moris Behnam 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 Moris Behnam. Moris Behnam is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Nikolaidis, Pavlos, et al.. (2015). Applying Mitigation Mechanisms for Cloud-based Controllers in Industrial IoT Applications. The Internet of Things.1 indexed citations
9.
Inam, Rafia, Moris Behnam, & Mikael Sjödin. (2014). Worst Case Delay Analysis of a DRAM Memory Request for COTS Multicore Architectures. KTH Publication Database DiVA (KTH Royal Institute of Technology).2 indexed citations
10.
Ashjaei, Mohammad, Paulo Pedreiras, Moris Behnam, Lúıs Almeida, & Thomas Nolte. (2013). Supporting Multi-Hop Communications with HaRTES Ethernet Switches.1 indexed citations
11.
Behnam, Moris, et al.. (2012). Opaque analysis for resource-sharing components in hierarchical real-time systems : extended version. Data Archiving and Networked Services (DANS). 1209.
12.
Behnam, Moris, et al.. (2012). Integrating independently developed real-time applications on a shared multi-core architecture.2 indexed citations
13.
Inam, Rafia, Jukka Mäki-Turja, Mikael Sjödin, & Moris Behnam. (2011). Hard Real-time Support for Hierarchical Scheduling in FreeRTOS. KTH Publication Database DiVA (KTH Royal Institute of Technology). 51–60.20 indexed citations
14.
Åsberg, Mikael, Moris Behnam, Thomas Nolte, & Reinder J. Bril. (2010). Implementation of overrun and skipping in VxWorks. Munich Personal RePEc Archive (Ludwig Maximilian University of Munich). 41(3). 45–52.7 indexed citations
Bril, Reinder J., et al.. (2009). Schedulability analysis of synchronization protocols based on overrun without payback for hierarchical scheduling frameworks revisited. Data Archiving and Networked Services (DANS). 1005. 1–9.2 indexed citations
17.
Behnam, Moris, Thomas Nolte, & Reinder J. Bril. (2009). A new approach for global synchronization in hierarchical scheduled real-time systems. Munich Personal RePEc Archive (Ludwig Maximilian University of Munich). 33(1). 41–44.1 indexed citations
18.
Nolte, Thomas, Moris Behnam, Mikael Åsberg, Reinder J. Bril, & Insik Shin. (2009). Hierarchical Scheduling of Complex Embedded Real-Time Systems. Munich Personal RePEc Archive (Ludwig Maximilian University of Munich). 38(8). 129–142.12 indexed citations
19.
Behnam, Moris. (2008). Hierarchical Real Time Scheduling and Synchronization. KTH Publication Database DiVA (KTH Royal Institute of Technology).
20.
Shin, Insik, Moris Behnam, Thomas Nolte, & Mikael Sjödin. (2007). Towards Optimal Hierarchical Resource Sharing in Open Environments. 57–60.2 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.