Ori Lahav

1.6k total citations
47 papers, 579 citations indexed

About

Ori Lahav is a scholar working on Artificial Intelligence, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, Ori Lahav has authored 47 papers receiving a total of 579 indexed citations (citations by other indexed papers that have themselves been cited), including 35 papers in Artificial Intelligence, 27 papers in Computer Networks and Communications and 24 papers in Computational Theory and Mathematics. Recurrent topics in Ori Lahav's work include Distributed systems and fault tolerance (24 papers), Parallel Computing and Optimization Techniques (19 papers) and Logic, programming, and type systems (18 papers). Ori Lahav is often cited by papers focused on Distributed systems and fault tolerance (24 papers), Parallel Computing and Optimization Techniques (19 papers) and Logic, programming, and type systems (18 papers). Ori Lahav collaborates with scholars based in Israel, Germany and South Korea. Ori Lahav's co-authors include Viktor Vafeiadis, Derek Dreyer, Chung-Kil Hur, Jeehoon Kang, Michalis Kokologiannakis, Konstantinos Sagonas, Arnon Avron, Udi Boker, Azalea Raad and Neil Immerman and has published in prestigious journals such as SHILAP Revista de lepidopterología, Fuzzy Sets and Systems and ACM SIGPLAN Notices.

In The Last Decade

Ori Lahav

43 papers receiving 565 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Ori Lahav Israel 12 389 363 340 180 48 47 579
Alexey Gotsman Spain 12 330 0.8× 163 0.4× 237 0.7× 155 0.9× 51 1.1× 39 470
Luc Maranget France 11 313 0.8× 348 1.0× 365 1.1× 156 0.9× 74 1.5× 36 582
Tjark Weber United Kingdom 10 279 0.7× 291 0.8× 278 0.8× 113 0.6× 61 1.3× 24 462
Jade Alglave United Kingdom 12 470 1.2× 519 1.4× 262 0.8× 79 0.4× 66 1.4× 23 637
Jeehoon Kang South Korea 13 251 0.6× 268 0.7× 269 0.8× 93 0.5× 59 1.2× 33 442
Michael Tautschnig United Kingdom 10 173 0.4× 250 0.7× 153 0.5× 149 0.8× 133 2.8× 34 404
Jeremy Manson United States 6 525 1.3× 532 1.5× 234 0.7× 46 0.3× 50 1.0× 8 623
Mark Bickford United States 9 134 0.3× 94 0.3× 141 0.4× 148 0.8× 35 0.7× 40 301
Bill McCloskey United States 8 185 0.5× 185 0.5× 149 0.4× 71 0.4× 72 1.5× 10 317
Tayfun Elmas United States 10 297 0.8× 313 0.9× 152 0.4× 58 0.3× 123 2.6× 24 428

Countries citing papers authored by Ori Lahav

Since Specialization
Citations

This map shows the geographic impact of Ori Lahav'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 Ori Lahav with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ori Lahav more than expected).

Fields of papers citing papers by Ori Lahav

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ori Lahav. 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 Ori Lahav. The network helps show where Ori Lahav may publish in the future.

Co-authorship network of co-authors of Ori Lahav

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

All Works

20 of 20 papers shown
1.
Lahav, Ori, et al.. (2024). Compositional Semantics for Shared-Variable Concurrency. Proceedings of the ACM on Programming Languages. 8(PLDI). 543–566.
2.
Kokologiannakis, Michalis, Ori Lahav, & Viktor Vafeiadis. (2023). Kater: Automating Weak Memory Model Metatheory and Consistency Checking. Proceedings of the ACM on Programming Languages. 7(POPL). 544–572. 3 indexed citations
3.
Hur, Chung-Kil, et al.. (2023). Putting Weak Memory in Order via a Promising Intermediate Representation. Proceedings of the ACM on Programming Languages. 7(PLDI). 1872–1895. 4 indexed citations
4.
Lahav, Ori & Udi Boker. (2022). What’s Decidable About Causally Consistent Shared Memory?. ACM Transactions on Programming Languages and Systems. 44(2). 1–55. 5 indexed citations
5.
Lahav, Ori, et al.. (2020). Reconciling Event Structures with Modern Multiprocessors. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 5 indexed citations
6.
Lahav, Ori & Udi Boker. (2020). Decidable verification under a causally consistent shared memory. 211–226. 11 indexed citations
7.
Raad, Azalea, et al.. (2019). On library correctness under weak memory consistency: specifying and verifying concurrent libraries under declarative consistency models. Proceedings of the ACM on Programming Languages. 3(POPL). 1–31. 17 indexed citations
8.
Kokologiannakis, Michalis, Ori Lahav, Konstantinos Sagonas, & Viktor Vafeiadis. (2018). Effective Stateless Model Checking for C/C++ Concurrency. 9 indexed citations
9.
Avron, Arnon & Ori Lahav. (2018). A Simple Cut-Free System for a Paraconsistent Logic Equivalent to S5.. 29–42. 2 indexed citations
10.
Lahav, Ori, et al.. (2017). Promising Compilation to ARMv8 POP. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 8 indexed citations
11.
Lahav, Ori, et al.. (2017). Promising Compilation to ARMv8.3. SHILAP Revista de lepidopterología. 29(5). 149–164. 2 indexed citations
12.
Dreyer, Derek, et al.. (2017). Strong Logic for Weak Memory: Reasoning About Release-Acquire Consistency in Iris. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 39 indexed citations
13.
Lahav, Ori, Viktor Vafeiadis, Jeehoon Kang, Chung-Kil Hur, & Derek Dreyer. (2017). Repairing sequential consistency in C/C++11. ACM SIGPLAN Notices. 52(6). 618–632. 7 indexed citations
14.
Kang, Jeehoon, Chung-Kil Hur, Ori Lahav, Viktor Vafeiadis, & Derek Dreyer. (2016). A promising semantics for relaxed-memory concurrency. 175–189. 72 indexed citations
15.
Lahav, Ori & Arnon Avron. (2015). A cut-free calculus for second-order Gödel logic. Fuzzy Sets and Systems. 276. 1–30.
16.
Padon, Oded, Neil Immerman, Aleksandr Karbyshev, et al.. (2015). Decentralizing SDN Policies. ACM SIGPLAN Notices. 50(1). 663–676. 3 indexed citations
17.
Padon, Oded, Neil Immerman, Aleksandr Karbyshev, et al.. (2014). Decentralizing SDN Policies. 663–676. 11 indexed citations
18.
Lahav, Ori. (2013). Studying Sequent Systems via Non-deterministic Multiple-Valued Matrices.. 21. 575–595. 4 indexed citations
19.
Baaz, Matthias, Ori Lahav, & Anna Zamansky. (2013). Finite-valued Semantics for Canonical Labelled Calculi. Journal of Automated Reasoning. 51(4). 401–430. 10 indexed citations
20.
Avron, Arnon & Ori Lahav. (2010). On Constructive Connectives and Systems. Logical Methods in Computer Science. Volume 6, Issue 4. 6 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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026