2026 Viktor Vafeiadis: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	45	7325	7114	357	346	120	5980

Viktor Vafeiadis publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Viktor Vafeiadis sits on this spectrum.

32 publications 991+

This scientist: 120 publications — 15th percentile

15% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Viktor Vafeiadis D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Viktor Vafeiadis sits on this spectrum.

30 D-Index 131+

This scientist: 45 D-Index — 51st percentile

51% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

Overview

Viktor Vafeiadis is affiliated with the Max Planck Institute for Software Systems in Germany. Their research primarily focuses on the field of Computer Science, with a notable emphasis on subfields such as Hardware and Architecture, Computer Networks and Communications, Artificial Intelligence, Computational Theory and Mathematics, and Electrical and Electronic Engineering.

The main topics covered in Viktor Vafeiadis's research include:

Parallel Computing and Optimization Techniques
Distributed systems and fault tolerance
Formal Methods in Verification
Security and Verification in Computing
Advanced Data Storage Technologies
Logic, programming, and type systems
Embedded Systems Design Techniques

Vafeiadis has published extensively in renowned venues. Frequent publication venues include:

Proceedings of the ACM on Programming Languages
Zenodo (CERN European Organization for Nuclear Research)
arXiv (Cornell University)
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Artifact Digital Object Group

Their recent papers demonstrate active contributions to topics in programming languages, persistency, and formal semantics. Selected recent publications are:

"Truly stateless, optimal dynamic partial order reduction", 2022, Proceedings of the ACM on Programming Languages
"PerSeVerE: persistency semantics for verification under ext4", 2021, Proceedings of the ACM on Programming Languages
"Extending Intel-x86 consistency and persistency: formalising the semantics of Intel-x86 memory types and non-temporal stores", 2022, Proceedings of the ACM on Programming Languages
"Persistent Owicki-Gries reasoning: a program logic for reasoning about persistent programs on Intel-x86", 2020, Proceedings of the ACM on Programming Languages
"Acute: High-level programming language design for distributed computation Design rationale and language definition", 2021, HAL (Le Centre pour la Communication Scientifique Directe)

Vafeiadis collaborates frequently with several researchers, with notable co-authors being:

Michalis Kokologiannakis
Azalea Raad
Iason Marmanis
Ori Lahav
Anton Podkopaev

Best Publications

A marriage of rely/guarantee and separation logic

Viktor Vafeiadis;Matthew Parkinson

422
Citations
Concurrent abstract predicates

Thomas Dinsdale-Young;Mike Dodds;Philippa Gardner;Matthew J. Parkinson

292
Citations
Modular fine-grained concurrency verification

Viktor Vafeiadis

246
Citations
Repairing sequential consistency in C/C++11

Ori Lahav;Viktor Vafeiadis;Jeehoon Kang;Chung-Kil Hur

212
Citations
A promising semantics for relaxed-memory concurrency

Jeehoon Kang;Chung-Kil Hur;Ori Lahav;Viktor Vafeiadis

199
Citations
CompCertTSO: A Verified Compiler for Relaxed-Memory Concurrency

Jaroslav Ševčík;Viktor Vafeiadis;Francesco Zappa Nardelli;Suresh Jagannathan

171
Citations
Relaxed separation logic: a program logic for C11 concurrency

Viktor Vafeiadis;Chinmay Narayan

165
Citations
Automatically proving linearizability

Viktor Vafeiadis

160
Citations
Deny-Guarantee Reasoning

Mike Dodds;Xinyu Feng;Matthew Parkinson;Viktor Vafeiadis

159
Citations
Effective Stateless Model Checking for C/C++ Concurrency

Michalis Kokologiannakis;Ori Lahav;Konstantinos Sagonas;Viktor Vafeiadis

158
Citations
GPS: navigating weak memory with ghosts, protocols, and separation

Aaron Turon;Viktor Vafeiadis;Derek Dreyer

158
Citations
The power of parameterization in coinductive proof

Chung-Kil Hur;Georg Neis;Derek Dreyer;Viktor Vafeiadis

138
Citations
Proving correctness of highly-concurrent linearisable objects

Viktor Vafeiadis;Maurice Herlihy;Tony Hoare;Marc Shapiro

137
Citations
Common Compiler Optimisations are Invalid in the C11 Memory Model and what we can do about it

Viktor Vafeiadis;Thibaut Balabonski;Soham Chakraborty;Robin Morisset

132
Citations
Taming release-acquire consistency

Ori Lahav;Nick Giannarakis;Viktor Vafeiadis

120
Citations
Strong Logic for Weak Memory: Reasoning About Release-Acquire Consistency in Iris

Jan-Oliver Kaiser;Hoang-Hai Dang;Derek Dreyer;Ori Lahav

117
Citations
Pilsner: a compositionally verified compiler for a higher-order imperative language

Georg Neis;Chung-Kil Hur;Jan-Oliver Kaiser;Craig McLaughlin

116
Citations
Relaxed-memory concurrency and verified compilation

Jaroslav Ŝevčik;Viktor Vafeiadis;Francesco Zappa Nardelli;Suresh Jagannathan

113
Citations
Owicki-Gries Reasoning for Weak Memory Models

Ori Lahav;Viktor Vafeiadis

112
Citations
Proving that non-blocking algorithms don't block

Alexey Gotsman;Byron Cook;Matthew Parkinson;Viktor Vafeiadis

110
Citations
Modular safety checking for fine-grained concurrency

Cristiano Calcagno;Matthew Parkinson;Viktor Vafeiadis

107
Citations
Shape-Value Abstraction for Verifying Linearizability

Viktor Vafeiadis

106
Citations

Frequent Co-Authors

Derek Dreyer Max Planck Institute for Software Systems

Peter Sewell University of Cambridge

Marc Shapiro Sorbonne University

Thomas A. Henzinger Institute of Science and Technology Austria

Byron Cook Amazon (United States)

Suresh Jagannathan Purdue University West Lafayette

Rupak Majumdar Max Planck Institute for Software Systems

Haibo Chen Shanghai Jiao Tong University

Johannes Gehrke Microsoft (United States)

Maurice Herlihy Brown University

External Links

Personal website of Viktor Vafeiadis Google Scholar page

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

Related Online Degrees & Career Pathways

Exploring online degrees is an excellent way to broaden your career prospects in computer science and related fields. Many professionals are now turning to online emba programs to gain management skills that complement their technical expertise, opening doors to leadership roles in tech organizations.

If you’re interested in data management, information systems, or supporting digital learning environments, pursuing a library degree online can diversify your options. These programs equip graduates to thrive in academic, public, or corporate libraries increasingly using advanced technology.

For those wanting an affordable path to advanced credentials, there are numerous cheap online master's programs available. These flexible degrees can enhance your technical skillset or allow you to pivot into new areas, such as cybersecurity or software engineering.

Finally, tech professionals with aspirations to drive organizational change may consider an online doctorate leadership. These programs focus on high-level strategy, innovation, and team management in today’s digital landscape.