Segui
Amr Elmasry
Amr Elmasry
Professor, Egypt University of Informatics and Alexandria University
Email verificata su eui.edu.eg
Titolo
Citata da
Citata da
Anno
Space-efficient Basic Graph Algorithms
A Elmasry, T Hagerup, F Kammer
32nd International Symposium on Theoretical Aspects of Computer Science …, 2015
582015
Pairing heaps with O(log log n) decrease cost
A Elmasry
Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete …, 2009
412009
On the sequential access theorem and deque conjecture for splay trees
A Elmasry
Theoretical Computer Science 314 (3), 459-466, 2004
412004
Optimal time-space tradeoff for the 2D convex-hull problem
O Darwish, A Elmasry
European Symposium on Algorithms, 284-295, 2014
392014
The violation heap: A relaxed Fibonacci-like heap
A Elmasry
International Computing and Combinatorics Conference, 479-488, 2010
37*2010
Two-tier relaxed heaps
A Elmasry, C Jensen, J Katajainen
Acta Informatica 45 (3), 193-210, 2008
312008
Multipartite priority queues
A Elmasry, C Jensen, J Katajainen
ACM Transactions on Algorithms (TALG) 5 (1), 1-19, 2008
292008
The weak-heap data structure: Variants and applications
S Edelkamp, A Elmasry, J Katajainen
Journal of Discrete Algorithms 16, 187-205, 2012
28*2012
Selection from read-only memory with limited workspace
A Elmasry, DD Juhl, J Katajainen, SR Satti
Theoretical Computer Science 554, 64-73, 2014
262014
Layered heaps
A Elmasry
Scandinavian Workshop on Algorithm Theory, 212-222, 2004
26*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
Optimizing binary heaps
S Edelkamp, A Elmasry, J Katajainen
Theory of Computing Systems 61 (2), 606-636, 2017
23*2017
An efficient indexing scheme for multi-dimensional moving objects
K Elbassioni, A Elmasry, I Kamel
International Conference on Database Theory, 425-439, 2003
232003
Priority queues, pairing, and adaptive sorting
A Elmasry
International Colloquium on Automata, Languages, and Programming, 183-194, 2002
22*2002
Branch mispredictions don’t affect mergesort
A Elmasry, J Katajainen, M Stenmark
Experimental Algorithms: 11th International Symposium, SEA 2012, Bordeaux …, 2012
192012
The longest almost-increasing subsequence
A Elmasry
Information Processing Letters 110 (16), 655-658, 2010
192010
Adaptive sorting: an information theoretic perspective
A Elmasry, ML Fredman
Acta Informatica 45 (1), 33-42, 2008
19*2008
A priority queue with the working-set property
A Elmasry
International Journal of Foundations of Computer Science 17 (06), 1455-1465, 2006
19*2006
Dynamic range majority data structures
A Elmasry, M He, JI Munro, PK Nicholson
Theoretical Computer Science 647, 59-73, 2016
18*2016
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
172020
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20