Molham Aref
Impact in
-
- Advanced Database Systems and Queries
- Advanced Data Storage Technologies
- Signal Processing top 5%
- Data Management and Algorithms
Papers in
-
- Advanced Database Systems and Queries 10
- Distributed and Parallel Computing Systems 2
- Distributed systems and fault tolerance 2
-
- Data Management and Algorithms 5
- Co-authors
- Todd J. Green (2 shared papers)Benny Kimelfeld (2 shared papers)Balder ten Cate (1 shared paper)Dan Olteanu (1 shared paper)Todd L. Veldhuizen (1 shared paper)Geoffrey Washburn (1 shared paper)Haicheng Wu (4 shared papers)Sudhakar Yalamanchili (4 shared papers)
- Journals
- ACM SIGMOD Record (1 paper)Lecture notes in computer science (1 paper)Very Large Data Bases (1 paper)Conference on Innovative Data Systems Research (1 paper)DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) (1 paper)
- Partner nations
- United StatesUnited KingdomPoland
In The Last Decade
Molham Aref
14 papers receiving 341 citations
Peers
Comparison fields: 5 of 19
- Computer Networks and Communications 250
- Signal Processing 114
- Hardware and Architecture 57
- Information Systems 118
- Artificial Intelligence 169
Countries citing papers authored by Molham Aref
This map shows the geographic impact of Molham Aref'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 Molham Aref with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Molham Aref more than expected).
Fields of papers citing papers by Molham Aref
This network shows the impact of papers produced by Molham Aref. 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 Molham Aref. The network helps show where Molham Aref may publish in the future.
Co-authors
The 25 scholars most cited alongside Molham Aref, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2015 | 168 | |
| 2 | 2014 | 49 | |
| 3 | 2014 | 39 | |
| 4 | 2015 | 37 | |
| 5 | 2012 | 36 | |
| 6 | 2010 | 13 | |
| 7 | 2016 | 6 | |
| 8 | Declarative Reconfigurable Trust Management | 2009 | 6 |
| 9 | 2018 | 5 | |
| 10 | Multipredicate Join Algorithms for Accelerating Relational Graph Processing on GPUs | 2014 | 3 |
| 11 | 2025 | 3 | |
| 12 | Relational Artificial Intelligence. | 2019 | 1 |
| 13 | 2010 | 1 | |
| 14 | Extending Datalog with Analytics in LogicBlox. | 2015 | 1 |
| 15 | 2026 | 0 |
About Molham Aref
Molham Aref is a scholar working on Computer Networks and Communications, Signal Processing, Computer Vision and Pattern Recognition, Information Systems and Information Systems and Management, having authored 15 papers that have together received 368 indexed citations. Recurring topics across this work include Advanced Database Systems and Queries (10 papers), Data Management and Algorithms (5 papers), Graph Theory and Algorithms (4 papers), Security and Verification in Computing (2 papers), Distributed and Parallel Computing Systems (2 papers), Logic, Reasoning, and Knowledge (2 papers), Distributed systems and fault tolerance (2 papers) and Semantic Web and Ontologies (2 papers). The work is most often cited by research in Computer Networks and Communications (250 citations), Signal Processing (114 citations), Hardware and Architecture (57 citations), Information Systems (118 citations) and Artificial Intelligence (169 citations). Molham Aref has collaborated with scholars based in United States, United Kingdom and Poland. Frequent co-authors include Todd J. Green, Benny Kimelfeld, Balder ten Cate, Dan Olteanu, Todd L. Veldhuizen, Geoffrey Washburn, Haicheng Wu, Sudhakar Yalamanchili, Tim Sheard and Gregory Diamos. Their work appears in journals such as ACM SIGMOD Record, Lecture notes in computer science, Very Large Data Bases, Conference on Innovative Data Systems Research and DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
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.