Amr Elmasry

687 total citations
55 papers, 180 citations indexed

About

Amr Elmasry is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Amr Elmasry has authored 55 papers receiving a total of 180 indexed citations (citations by other indexed papers that have themselves been cited), including 31 papers in Artificial Intelligence, 27 papers in Computational Theory and Mathematics and 14 papers in Computer Networks and Communications. Recurrent topics in Amr Elmasry's work include Algorithms and Data Compression (31 papers), Complexity and Algorithms in Graphs (12 papers) and Computational Geometry and Mesh Generation (11 papers). Amr Elmasry is often cited by papers focused on Algorithms and Data Compression (31 papers), Complexity and Algorithms in Graphs (12 papers) and Computational Geometry and Mesh Generation (11 papers). Amr Elmasry collaborates with scholars based in Egypt, Germany and Denmark. Amr Elmasry's co-authors include Jyrki Katajainen, Stefan Edelkamp, Khaled Elbassioni, Frank Kammer, Michael L. Fredman, Hosam M. Mahmoud, Jens M. Schmidt, Kurt Mehlhorn, Kazuhisa Makino and Ibrahim Kamel and has published in prestigious journals such as IEEE Transactions on Information Theory, Theoretical Computer Science and Networks.

In The Last Decade

Amr Elmasry

45 papers receiving 166 citations

Author Peers

Peers are selected by citation overlap in the author's most active subfields. citations · hero ref

Author Last Decade Papers Cites
Amr Elmasry 91 83 50 29 29 55 180
Monika Rauch 134 1.5× 54 0.7× 114 2.3× 37 1.3× 12 0.4× 9 202
Peter van Emde Boas 128 1.4× 120 1.4× 78 1.6× 24 0.8× 9 0.3× 25 229
Tsvi Kopelowitz 105 1.2× 119 1.4× 117 2.3× 19 0.7× 33 1.1× 38 229
Sylvia Boyd 155 1.7× 23 0.3× 69 1.4× 14 0.5× 31 1.1× 27 254
Milan Ružić 42 0.5× 74 0.9× 87 1.7× 17 0.6× 10 0.3× 10 186
Toshinobu Kashiwabara 115 1.3× 38 0.5× 86 1.7× 48 1.7× 50 1.7× 23 256
Gregory E. Shannon 185 2.0× 76 0.9× 150 3.0× 31 1.1× 24 0.8× 16 261
S. W. Song 40 0.4× 82 1.0× 100 2.0× 7 0.2× 81 2.8× 25 201
Johannes Singler 16 0.2× 73 0.9× 152 3.0× 47 1.6× 86 3.0× 12 256
Eiji Miyano 113 1.2× 36 0.4× 97 1.9× 10 0.3× 6 0.2× 47 184

Countries citing papers authored by Amr Elmasry

Since Specialization
Citations

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

Fields of papers citing papers by Amr Elmasry

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Amr Elmasry

This figure shows the co-authorship network connecting the top 25 collaborators of Amr Elmasry. A scholar is included among the top collaborators of Amr Elmasry 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 Elmasry. Amr Elmasry 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.
2.
Youssri, Y. H., W. M. Abd‐Elhameed, Amr Elmasry, & Ahmed Gamal Atta. (2025). An Efficient Petrov–Galerkin Scheme for the Euler–Bernoulli Beam Equation via Second-Kind Chebyshev Polynomials. Fractal and Fractional. 9(2). 78–78. 2 indexed citations
3.
Elmasry, Amr, et al.. (2023). Gene Expression Profile of some Antioxidant-Related Genes in Five Species of the Family Asteraceae in Egypt. Journal of Agricultural Chemistry and Biotechnology. 14(5). 57–64. 1 indexed citations
4.
Elmasry, Amr, et al.. (2018). A new algorithm for the shortest‐path problem. Networks. 74(1). 16–39. 1 indexed citations
5.
Canzar, Stefan, Khaled Elbassioni, Amr Elmasry, & Rajiv Raman. (2017). On the approximability of the maximum interval constrained coloring problem. Discrete Optimization. 27. 57–72. 1 indexed citations
6.
Elmasry, Amr, Meng He, J. Ian Munro, & Patrick K. Nicholson. (2016). Dynamic range majority data structures. Theoretical Computer Science. 647. 59–73.
7.
Elmasry, Amr, et al.. (2014). Selection from read-only memory with limited workspace. Theoretical Computer Science. 554. 64–73. 3 indexed citations
8.
Edelkamp, Stefan, Amr Elmasry, & Jyrki Katajainen. (2013). Weak heaps engineered. Journal of Discrete Algorithms. 23. 83–97. 1 indexed citations
9.
Edelkamp, Stefan, Amr Elmasry, & Jyrki Katajainen. (2012). The weak-heap family of priority queues in theory and praxis. Research at the University of Copenhagen (University of Copenhagen). 103–112. 4 indexed citations
10.
Edelkamp, Stefan, Amr Elmasry, & Jyrki Katajainen. (2012). The weak-heap data structure: Variants and applications. Journal of Discrete Algorithms. 16. 187–205. 6 indexed citations
11.
Elmasry, Amr. (2009). Pairing heaps with O(log log n) decrease cost. Symposium on Discrete Algorithms. 471–476. 6 indexed citations
12.
Elmasry, Amr, et al.. (2007). On the power of structural violations in priority queues. Research at the University of Copenhagen (University of Copenhagen). 45–53. 1 indexed citations
13.
Elmasry, Amr & Kazuhisa Makino. (2007). Finding Intersections of Bichromatic Segments Defined by Points.. Canadian Conference on Computational Geometry. 269–272. 1 indexed citations
14.
Elmasry, Amr. (2005). Deterministic jumplists. Nordic journal of computing. 12(1). 27–39. 2 indexed citations
15.
Elmasry, Amr & Khaled Elbassioni. (2005). Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in th Plane. MPG.PuRe (Max Planck Society). 248–251. 2 indexed citations
16.
Elmasry, Amr, et al.. (2005). Relaxed weak queues: an alternative to run-relaxed heaps. Research at the University of Copenhagen (University of Copenhagen). 1 indexed citations
17.
Elbassioni, Khaled, Amr Elmasry, & Vladimir Gurvich. (2004). A stronger version of Bárány's theorem in the plane.. Canadian Conference on Computational Geometry. 4–6.
18.
Elmasry, Amr, et al.. (2004). A framework for speeding up priorityqueue operations. Research at the University of Copenhagen (University of Copenhagen). 3 indexed citations
19.
Elmasry, Amr. (2004). On the sequential access theorem and deque conjecture for splay trees. Theoretical Computer Science. 314(3). 459–466. 10 indexed citations
20.
Elbassioni, Khaled, Amr Elmasry, & Ibrahim Kamel. (2002). Efficient answering of polyhedral queries in r d using bbs-trees.. Canadian Conference on Computational Geometry. 54–57. 1 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