Follow
Amr Elmasry
Amr Elmasry
Professor, Egypt University of Informatics and Alexandria University
Verified email at eui.edu.eg
Title
Cited by
Cited by
Year
Space-efficient Basic Graph Algorithms
A Elmasry, T Hagerup, F Kammer
32nd International Symposium on Theoretical Aspects of Computer Science …, 2015
572015
Pairing heaps with O(log log n) decrease cost
A Elmasry
Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete …, 2009
402009
On the sequential access theorem and deque conjecture for splay trees
A Elmasry
Theoretical Computer Science 314 (3), 459-466, 2004
392004
Optimal time-space tradeoff for the 2D convex-hull problem
O Darwish, A Elmasry
European Symposium on Algorithms, 284-295, 2014
382014
The violation heap: A relaxed Fibonacci-like heap
A Elmasry
International Computing and Combinatorics Conference, 479-488, 2010
36*2010
Two-tier relaxed heaps
A Elmasry, C Jensen, J Katajainen
Acta Informatica 45 (3), 193-210, 2008
302008
Multipartite priority queues
A Elmasry, C Jensen, J Katajainen
ACM Transactions on Algorithms (TALG) 5 (1), 1-19, 2008
282008
Selection from read-only memory with limited workspace
A Elmasry, DD Juhl, J Katajainen, SR Satti
Theoretical Computer Science 554, 64-73, 2014
262014
The weak-heap data structure: Variants and applications
S Edelkamp, A Elmasry, J Katajainen
Journal of Discrete Algorithms 16, 187-205, 2012
26*2012
Layered heaps
A Elmasry
Scandinavian Workshop on Algorithm Theory, 212-222, 2004
25*2004
Priority queues and sorting for read-only data
T Asano, A Elmasry, J Katajainen
International Conference on Theory and Applications of Models of Computation …, 2013
242013
An efficient indexing scheme for multi-dimensional moving objects
K Elbassioni, A Elmasry, I Kamel
International Conference on Database Theory, 425-439, 2003
222003
Optimizing binary heaps
S Edelkamp, A Elmasry, J Katajainen
Theory of Computing Systems 61 (2), 606-636, 2017
20*2017
Priority queues, pairing, and adaptive sorting
A Elmasry
International Colloquium on Automata, Languages, and Programming, 183-194, 2002
20*2002
Dynamic range majority data structures
A Elmasry, M He, JI Munro, PK Nicholson
Theoretical Computer Science 647, 59-73, 2016
19*2016
Branch mispredictions don’t affect mergesort
A Elmasry, J Katajainen, M Stenmark
Experimental Algorithms: 11th International Symposium, SEA 2012, Bordeaux …, 2012
192012
Adaptive sorting: an information theoretic perspective
A Elmasry, ML Fredman
Acta Informatica 45 (1), 33-42, 2008
18*2008
A priority queue with the working-set property
A Elmasry
International Journal of Foundations of Computer Science 17 (06), 1455-1465, 2006
18*2006
Optimal shortest path in mobile ad-hoc network based on fruit fly optimization algorithm
SM Darwish, A Elmasry, SH Ibrahim
The International Conference on Advanced Machine Learning Technologies and …, 2020
152020
Weak heaps engineered
S Edelkamp, A Elmasry, J Katajainen
Journal of Discrete Algorithms 23, 83-97, 2013
15*2013
The system can't perform the operation now. Try again later.
Articles 1–20