World's Best Scientists 2026 revealed!
Hassan Chafi

Hassan Chafi

Overview

Hassan Chafi is a researcher affiliated with Oracle (US) based in the United States. Their academic focus lies within the field of Computer Science, with specific contributions spanning several subfields including Computer Vision and Pattern Recognition, Artificial Intelligence, Information Systems, Computer Networks and Communications, as well as Statistical and Nonlinear Physics.

Their research covers multiple key topics, notably:

  • Graph Theory and Algorithms
  • Cloud Computing and Resource Management
  • Distributed systems and fault tolerance
  • Advanced Graph Neural Networks
  • Complex Network Analysis Techniques
  • Model-Driven Software Engineering Techniques
  • Semantic Web and Ontologies

Hassan Chafi's publication record includes contributions to several venues, each related to computer science and data management:

  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • arXiv (Cornell University)
  • Science of Computer Programming

Representative recent papers authored or co-authored by Hassan Chafi are as follows:

  • "CSR++: A Fast, Scalable, Update-Friendly Graph Data Structure," published in 2021 in Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "The LDBC Graphalytics Benchmark," published in 2020 in arXiv (Cornell University)
  • "Domain-specific language engineering for large-scale graph analytics using Spoofax: An industry report," published in 2025 in Science of Computer Programming

Their collaborative network includes frequent co-authors such as Dalila Chiadmi, who has worked with them on multiple occasions, as well as Soukaina Firmli, Vasileios Trigonakis, Jean-Pierre Lozi, and Iraklis Psaroudakis.

Best Publications

  • Green-Marl: a DSL for easy and efficient graph analysis

    Sungpack Hong;Hassan Chafi;Edic Sedlar;Kunle Olukotun

  • The LDBC Social Network Benchmark: Interactive Workload

    Orri Erling;Alex Averbuch;Josep Larriba-Pey;Hassan Chafi

  • Architectural Semantics for Practical Transactional Memory

    Austen McDonald;JaeWoong Chung;Brian D. Carlstrom;Chi Cao Minh

  • A practical concurrent binary search tree

    Nathan G. Bronson;Jared Casper;Hassan Chafi;Kunle Olukotun

  • OptiML: An Implicitly Parallel Domain-Specific Language for Machine Learning

    Arvind Sujeeth;Hyoukjoong Lee;Kevin Brown;Tiark Rompf

  • A Heterogeneous Parallel Framework for Domain-Specific Languages

    Kevin J. Brown;Arvind K. Sujeeth;Hyouk Joong Lee;Tiark Rompf

  • Delite: A Compiler Architecture for Performance-Oriented Embedded Domain-Specific Languages

    Arvind K. Sujeeth;Kevin J. Brown;Hyoukjoong Lee;Tiark Rompf

  • A domain-specific approach to heterogeneous parallelism

    Hassan Chafi;Arvind K. Sujeeth;Kevin J. Brown;HyoukJoong Lee

  • The Atomos transactional programming language

    Brian D. Carlstrom;Austen McDonald;Hassan Chafi;JaeWoong Chung

  • A Scalable, Non-blocking Approach to Transactional Memory

    H. Chafi;J. Casper;B.D. Carlstrom;A. McDonald

  • PGQL: a property graph query language

    Oskar van Rest;Sungpack Hong;Jinha Kim;Xuming Meng

  • Building efficient query engines in a high-level language

    Yannis Klonatos;Christoph Koch;Tiark Rompf;Hassan Chafi

  • LDBC graphalytics: a benchmark for large-scale graph analysis on parallel and distributed platforms

    Alexandru Iosup;Tim Hegeman;Wing Lung Ngai;Stijn Heldens

  • Language virtualization for heterogeneous parallel computing

    Hassan Chafi;Zach DeVito;Adriaan Moors;Tiark Rompf

  • The common case transactional behavior of multithreaded programs

    J.W. Chung;H. Chafi;C.C. Minh;A. McDonald

  • Tradeoffs in transactional memory virtualization

    JaeWoong Chung;Chi Cao Minh;Austen McDonald;Travis Skare

  • PGX.D: a fast distributed graph processing engine

    Sungpack Hong;Siegfried Depner;Thomas Manhardt;Jan Van Der Lugt

  • Characterization of TCC on chip-multiprocessors

    A. McDonald;JaeWoong Chung;H. Chafi;Chi Cao Minh

  • Implementing Domain-Specific Languages for Heterogeneous Parallel Computing

    HyoukJoong Lee;Kevin J. Brown;Arvind K. Sujeeth;H. Chafi

  • Testing implementations of transactional memory

    Chaiyasit Manovit;Sudheendra Hangal;Hassan Chafi;Austen McDonald

Frequent Co-Authors

Kunle Olukotun
Kunle Olukotun Stanford University
Tiark Rompf
Tiark Rompf Purdue University West Lafayette
Christos Kozyrakis
Christos Kozyrakis Stanford University
Martin Odersky
Martin Odersky École Polytechnique Fédérale de Lausanne
Eric Sedlar
Eric Sedlar Oracle (United States)
Pat Hanrahan
Pat Hanrahan Stanford University
Peter Eades
Peter Eades University of Sydney
Alexandru Iosup
Alexandru Iosup Vrije Universiteit Amsterdam
Peter Boncz
Peter Boncz Centrum Wiskunde & Informatica
Christoph Koch
Christoph Koch École Polytechnique Fédérale de Lausanne

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Studying Computer Science in the USA opens up a range of flexible online education and career options. Busy professionals or working students may consider enrolling in one of the quickest online masters degree programs, which allow you to accelerate your learning and enter the workforce faster.

If you are seeking higher earning potential and strong job demand, look into programs ranked among the best masters degree to get. These degrees are carefully selected for their value and growing career prospects in technology-related fields.

Not ready for a full bachelor’s or master’s degree? 2 year online degrees in computer science or information technology provide foundational skills and can be a cost-effective entry point.

Regardless of which path you choose, budget matters. Explore affordable online degree programs that deliver quality education without the financial strain, helping you step confidently into the tech industry.

Best Scientists Citing Hassan Chafi

Trending Scientists