Samir Genaim

2.1k total citations
43 papers, 446 citations indexed

About

Samir Genaim is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Hardware and Architecture. According to data from OpenAlex, Samir Genaim has authored 43 papers receiving a total of 446 indexed citations (citations by other indexed papers that have themselves been cited), including 33 papers in Artificial Intelligence, 32 papers in Computational Theory and Mathematics and 18 papers in Hardware and Architecture. Recurrent topics in Samir Genaim's work include Logic, programming, and type systems (31 papers), Formal Methods in Verification (31 papers) and Parallel Computing and Optimization Techniques (15 papers). Samir Genaim is often cited by papers focused on Logic, programming, and type systems (31 papers), Formal Methods in Verification (31 papers) and Parallel Computing and Optimization Techniques (15 papers). Samir Genaim collaborates with scholars based in Spain, Israel and Germany. Samir Genaim's co-authors include Elvira Albert, Puri Arenas, Germán Puebla, Miguel Gómez‐Zamalloa, Amir M. Ben-Amram, Damiano Zanardini, Michael Codish, Maurice Bruynooghe, Wim Vanhoof and John P. Gallagher and has published in prestigious journals such as Journal of the ACM, Theoretical Computer Science and ACM SIGPLAN Notices.

In The Last Decade

Samir Genaim

39 papers receiving 423 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Samir Genaim Spain 12 327 270 155 114 97 43 446
Jan Midtgaard Denmark 12 441 1.3× 251 0.9× 132 0.9× 59 0.5× 86 0.9× 27 494
Ross Paterson United Kingdom 9 538 1.6× 293 1.1× 161 1.0× 112 1.0× 64 0.7× 16 612
Marieke Huisman Netherlands 10 291 0.9× 200 0.7× 66 0.4× 96 0.8× 120 1.2× 79 392
Julia L. Lawall France 13 361 1.1× 158 0.6× 133 0.9× 126 1.1× 134 1.4× 30 493
Samin Ishtiaq United Kingdom 9 348 1.1× 217 0.8× 96 0.6× 129 1.1× 58 0.6× 20 442
Edwin Brady United Kingdom 9 299 0.9× 166 0.6× 89 0.6× 59 0.5× 53 0.5× 25 352
Wouter Swierstra Netherlands 9 403 1.2× 200 0.7× 89 0.6× 92 0.8× 72 0.7× 41 445
Bruno C. d. S. Oliveira Hong Kong 14 539 1.6× 235 0.9× 133 0.9× 146 1.3× 159 1.6× 82 652
Lennart Augustsson Sweden 8 372 1.1× 233 0.9× 160 1.0× 94 0.8× 57 0.6× 16 427
Arthur Charguéraud France 15 461 1.4× 256 0.9× 164 1.1× 182 1.6× 52 0.5× 23 577

Countries citing papers authored by Samir Genaim

Since Specialization
Citations

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

Fields of papers citing papers by Samir Genaim

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Samir Genaim

This figure shows the co-authorship network connecting the top 25 collaborators of Samir Genaim. A scholar is included among the top collaborators of Samir Genaim 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 Samir Genaim. Samir Genaim 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.
Albert, Elvira, et al.. (2025). Secure Optimizations on Ethereum Bytecode Jump-Free Sequences. IEEE Transactions on Dependable and Secure Computing. 22(4). 3676–3691.
2.
Gallagher, John P., et al.. (2019). . arXiv (Cornell University). 1 indexed citations
3.
Albert, Elvira, et al.. (2016). Rely-Guarantee Termination and Cost Analyses of Loops with Concurrent Interleavings. Journal of Automated Reasoning. 59(1). 47–85. 5 indexed citations
4.
Albert, Elvira, et al.. (2015). Object‐sensitive cost analysis for concurrent objects. Software Testing Verification and Reliability. 25(3). 218–271. 8 indexed citations
5.
Albert, Elvira, Puri Arenas, Samir Genaim, & Germán Puebla. (2014). A practical comparator of cost functions and its applications. Science of Computer Programming. 111. 483–504. 2 indexed citations
6.
Zanardini, Damiano & Samir Genaim. (2014). Inference of Field-Sensitive Reachability and Cyclicity. ACM Transactions on Computational Logic. 15(4). 1–41. 2 indexed citations
7.
Albert, Elvira, et al.. (2013). Conditional termination of loops over heap-allocated data. Science of Computer Programming. 92. 2–24. 5 indexed citations
8.
Ben-Amram, Amir M. & Samir Genaim. (2013). On the linear ranking problem for integer linear-constraint loops. ACM SIGPLAN Notices. 48(1). 51–62. 5 indexed citations
9.
Genaim, Samir & Damiano Zanardini. (2012). Reachability-based acyclicity analysis by Abstract Interpretation. Theoretical Computer Science. 474. 60–79. 6 indexed citations
10.
Albert, Elvira, Samir Genaim, & Miguel Gómez‐Zamalloa. (2012). Heap space analysis for garbage collected languages. Science of Computer Programming. 78(9). 1427–1448. 5 indexed citations
11.
Albert, Elvira, Puri Arenas, Samir Genaim, Miguel Gómez‐Zamalloa, & Germán Puebla. (2012). COSTABS. 151–154. 8 indexed citations
12.
Albert, Elvira, Puri Arenas, Samir Genaim, Germán Puebla, & Damiano Zanardini. (2011). Cost analysis of object-oriented bytecode programs. Theoretical Computer Science. 413(1). 142–159. 49 indexed citations
13.
Albert, Elvira, Samir Genaim, & Miguel Gómez‐Zamalloa. (2010). Parametric inference of memory requirements for garbage collected languages. Archivo Digital UPM (Universidad Politécnica de Madrid). 121–130. 26 indexed citations
14.
Albert, Elvira, Puri Arenas, Samir Genaim, & Germán Puebla. (2009). Cost Relation Systems: A Language-Independent Target Language for Cost Analysis. Electronic Notes in Theoretical Computer Science. 248. 31–46. 4 indexed citations
15.
Albert, Elvira, Samir Genaim, & Miguel Gómez‐Zamalloa. (2009). Live heap space analysis for languages with garbage collection. UPM Digital Archive (Technical University of Madrid). 129–138. 26 indexed citations
16.
Albert, Elvira, Puri Arenas, Samir Genaim, et al.. (2009). Termination and Cost Analysis with COSTA and its User Interfaces. Electronic Notes in Theoretical Computer Science. 258(1). 109–121. 16 indexed citations
17.
Bruynooghe, Maurice, Michael Codish, John P. Gallagher, Samir Genaim, & Wim Vanhoof. (2007). Termination analysis of logic programs through combination of type-based norms. ACM Transactions on Programming Languages and Systems. 29(2). 10–10. 26 indexed citations
18.
Genaim, Samir & Michael Codish. (2005). Inferring termination conditions for logic programs using backwards analysis. Theory and Practice of Logic Programming. 5(1-2). 75–91. 7 indexed citations
19.
Genaim, Samir, Roberto Giacobazzi, & Isabella Mastroeni. (2004). Modeling Information Flow Dependencies with Boolean Functions. 1–12. 3 indexed citations
20.
Codish, Michael & Samir Genaim. (2003). Proving Termination One Loop at a Time.. 48–59. 4 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