Molham Aref

495 citations
11 papers · 259 indexed · h-index 6
Topics
Advanced Database Systems and Queries (7 papers)Graph Theory and Algorithms (4 papers)Data Management and Algorithms (4 papers)
Journals
Very Large Data BasesConference on Innovative Data Systems ResearchDROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

In The Last Decade

Molham Aref

11 papers receiving 242 citations

Peers

Molham Aref
Comparison fields: 5 of 17
  • Computer Networks and Communications 176
  • Artificial Intelligence 115
  • Information Systems 95
  • Signal Processing 80
  • Computer Vision and Pattern Recognition 63
Replace Joel Coffman with:
Joel Coffman United States
Mahmoud Abo Khamis United States
Amir Shaikhha United Kingdom
Edward Gan United States
Mark Callaghan United States
Josyula R. Rao United States
Andrew Lamb United States
Uri Shaft United States
Anil Shanbhag United States
Stratos Papadomanolakis United States
Molham Aref relative to Joel Coffman United States Joel Coffman's profile →
Citations per field
00.5×1.5×2.4×
Joel Coffman · 1×
Citations per year

Countries citing papers authored by Molham Aref

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Molham Aref

This figure shows the co-authorship network connecting the top 25 collaborators of Molham Aref. A scholar is included among the top collaborators of Molham Aref 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 Molham Aref. Molham Aref is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

11 of 11 papers shown
#WorkIndexed citations
1
Relational Artificial Intelligence.
2
2 3
3
Extending Datalog with Analytics in LogicBlox.
1
4 122
5 30
6
Multipredicate Join Algorithms for Accelerating Relational Graph Processing on GPUs
3
7 45
8 37
9 9
10 1
11
Declarative Reconfigurable Trust Management
6

About Molham Aref

Molham Aref is a scholar working on Signal Processing, Computer Networks and Communications and Computer Vision and Pattern Recognition, having authored 11 papers that have together received 259 indexed citations. Recurring topics across this work include Advanced Database Systems and Queries (7 papers), Graph Theory and Algorithms (4 papers) and Data Management and Algorithms (4 papers). The work is most often cited by research in Hardware and Architecture (54 citations), Computer Networks and Communications (176 citations) and Signal Processing (80 citations). Molham Aref has collaborated with scholars based in United States and United Kingdom. Frequent co-authors include Benny Kimelfeld, Enes Pašalić, Dan Olteanu, Todd J. Green, Balder ten Cate, Todd L. Veldhuizen, Geoffrey Washburn, Haicheng Wu, Sudhakar Yalamanchili and Michael Garland. Their work appears in journals such as 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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026