Amr Sabry

2.9k total citations
72 papers, 1.7k citations indexed

About

Amr Sabry is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Hardware and Architecture. According to data from OpenAlex, Amr Sabry has authored 72 papers receiving a total of 1.7k indexed citations (citations by other indexed papers that have themselves been cited), including 66 papers in Artificial Intelligence, 35 papers in Computational Theory and Mathematics and 17 papers in Hardware and Architecture. Recurrent topics in Amr Sabry's work include Logic, programming, and type systems (49 papers), Logic, Reasoning, and Knowledge (22 papers) and Formal Methods in Verification (22 papers). Amr Sabry is often cited by papers focused on Logic, programming, and type systems (49 papers), Logic, Reasoning, and Knowledge (22 papers) and Formal Methods in Verification (22 papers). Amr Sabry collaborates with scholars based in United States, United Kingdom and Canada. Amr Sabry's co-authors include Matthias Felleisen, Cormac Flanagan, Bruce F. Duba, Oleg Kiselyov, Lars Pareto, John Hughes, Chung-chieh Shan, Zena M. Ariola, Philip Wadler and Simon Peyton Jones and has published in prestigious journals such as SHILAP Revista de lepidopterología, The Journal of Physical Chemistry Letters and Journal of Chemical Theory and Computation.

In The Last Decade

Amr Sabry

66 papers receiving 1.5k citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Amr Sabry United States 20 1.5k 858 512 279 268 72 1.7k
Eugenio Moggi Italy 15 1.6k 1.1× 940 1.1× 235 0.5× 233 0.8× 182 0.7× 39 1.7k
Robert Glück Denmark 16 673 0.4× 439 0.5× 227 0.4× 107 0.4× 127 0.5× 70 795
Radha Jagadeesan United States 18 844 0.6× 682 0.8× 170 0.3× 242 0.9× 104 0.4× 45 1.1k
Gérard Huet France 19 2.2k 1.4× 1.5k 1.8× 223 0.4× 347 1.2× 229 0.9× 45 2.4k
Nick Benton United Kingdom 20 990 0.7× 517 0.6× 323 0.6× 281 1.0× 153 0.6× 53 1.1k
Bart Demoen Belgium 16 706 0.5× 312 0.4× 81 0.2× 250 0.9× 162 0.6× 134 896
Lars Birkedal Denmark 28 2.5k 1.7× 1.3k 1.6× 621 1.2× 1.1k 3.8× 181 0.7× 163 2.8k
Mariangiola Dezani-Ciancaglini Italy 17 1.5k 1.0× 1.1k 1.3× 113 0.2× 331 1.2× 134 0.5× 138 1.6k
J. W. de Bakker Netherlands 16 806 0.5× 862 1.0× 137 0.3× 196 0.7× 64 0.2× 53 1.1k
Thierry Coquand Sweden 18 1.3k 0.9× 1.0k 1.2× 67 0.1× 146 0.5× 98 0.4× 110 1.6k

Countries citing papers authored by Amr Sabry

Since Specialization
Citations

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

Fields of papers citing papers by Amr Sabry

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Amr Sabry

This figure shows the co-authorship network connecting the top 25 collaborators of Amr Sabry. A scholar is included among the top collaborators of Amr Sabry 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 Amr Sabry. Amr Sabry 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.
Carette, Jacques, et al.. (2024). With a Few Square Roots, Quantum Computing Is as Easy as Pi. Proceedings of the ACM on Programming Languages. 8(POPL). 546–574. 1 indexed citations
2.
Carette, Jacques, et al.. (2024). How to Bake a Quantum Π. Proceedings of the ACM on Programming Languages. 8(ICFP). 1–29.
4.
Kiselyov, Oleg, Shin-Cheng Mu, & Amr Sabry. (2021). Not by equations alone: Reasoning with extensible effects. Journal of Functional Programming. 31. 1 indexed citations
5.
Sabry, Amr, et al.. (2013). Superstructural Reversible Logic.
6.
Kiselyov, Oleg, et al.. (2013). Extensible effects. ACM SIGPLAN Notices. 48(12). 59–70. 7 indexed citations
7.
Sabry, Amr, et al.. (2012). Information effects. ACM SIGPLAN Notices. 47(1). 73–84. 11 indexed citations
8.
Garcia, Ronald, Andrew Lumsdaine, & Amr Sabry. (2010). Lazy Evaluation and Delimited Control. Logical Methods in Computer Science. Volume 6, Issue 3. 2 indexed citations
9.
Ariola, Zena M., Aaron Bohannon, & Amr Sabry. (2009). Sequent calculi and abstract machines. ACM Transactions on Programming Languages and Systems. 31(4). 1–48. 8 indexed citations
10.
Ariola, Zena M., Hugo Herbelin, & Amr Sabry. (2007). A Type-Theoretic Foundation of Delimited Continuations. HAL (Le Centre pour la Communication Scientifique Directe).
11.
Kiselyov, Oleg, Chung-chieh Shan, & Amr Sabry. (2006). Delimited dynamic binding. 26–37. 48 indexed citations
12.
Kiselyov, Oleg, Chung-chieh Shan, & Amr Sabry. (2006). Delimited dynamic binding. ACM SIGPLAN Notices. 41(9). 26–37. 5 indexed citations
13.
Altenkirch, Thorsten, et al.. (2006). Structuring quantum effects: superoperators as arrows. Mathematical Structures in Computer Science. 16(3). 453–468. 18 indexed citations
14.
Flanagan, Cormac, Amr Sabry, Bruce F. Duba, & Matthias Felleisen. (2004). The essence of compiling with continuations. ACM SIGPLAN Notices. 39(4). 502–514. 5 indexed citations
15.
Moggi, Eugenio & Amr Sabry. (2003). An Abstract Monadic Semantics for Value Recursion.. Springer Link (Chiba Institute of Technology). 64–79. 2 indexed citations
16.
Hughes, John, Lars Pareto, & Amr Sabry. (1996). Proving the correctness of reactive systems using sized types. 410–423. 150 indexed citations
17.
Sabry, Amr & Matthias Felleisen. (1994). Is continuation-passing useful for data flow analysis?. 1–12. 30 indexed citations
18.
Flanagan, Cormac, Amr Sabry, Bruce F. Duba, & Matthias Felleisen. (1993). The essence of compiling with continuations (with retrospective). 27(13). 502–514. 4 indexed citations
19.
Sabry, Amr & Matthias Felleisen. (1992). Reasoning about programs in continuation-passing style.. 288–298. 83 indexed citations
20.
Sabry, Amr & Matthias Felleisen. (1992). Reasoning about programs in continuation-passing style.. V(1). 288–298. 24 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