Amr Elmasry
Amr Elmasry
Professor, Faculty of Engineering, Alexandria University
Bestätigte E-Mail-Adresse bei alexu.edu.eg
Titel
Zitiert von
Zitiert von
Jahr
Space-efficient Basic Graph Algorithms
A Elmasry, T Hagerup, F Kammer
32nd International Symposium on Theoretical Aspects of Computer Science …, 2015
392015
Pairing heaps with O(log log n) decrease cost
A Elmasry
Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete …, 2009
382009
The violation heap: A relaxed Fibonacci-like heap
A Elmasry
Discrete Mathematics, Algorithms and Applications 2 (04), 493-503, 2010
35*2010
On the sequential access theorem and deque conjecture for splay trees
A Elmasry
Theoretical Computer Science 314 (3), 459-466, 2004
352004
Optimal time-space tradeoff for the 2D convex-hull problem
O Darwish, A Elmasry
European Symposium on Algorithms, 284-295, 2014
322014
Multipartite priority queues
A Elmasry, C Jensen, J Katajainen
ACM Transactions on Algorithms (TALG) 5 (1), 1-19, 2008
272008
Two-tier relaxed heaps
A Elmasry, C Jensen, J Katajainen
Acta Informatica 45 (3), 193-210, 2008
272008
Selection from read-only memory with limited workspace
A Elmasry, DD Juhl, J Katajainen, SR Satti
Theoretical Computer Science 554, 64-73, 2014
232014
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
212013
The weak-heap data structure: Variants and applications
S Edelkamp, A Elmasry, J Katajainen
Journal of Discrete Algorithms 16, 187-205, 2012
21*2012
An efficient indexing scheme for multi-dimensional moving objects
K Elbassioni, A Elmasry, I Kamel
International Conference on Database Theory, 425-439, 2003
182003
Adaptive sorting: an information theoretic perspective
A Elmasry, ML Fredman
Acta Informatica 45 (1), 33-42, 2008
17*2008
Branch mispredictions don’t affect mergesort
A Elmasry, J Katajainen, M Stenmark
International Symposium on Experimental Algorithms, 160-171, 2012
162012
Layered heaps
A Elmasry
Scandinavian Workshop on Algorithm Theory, 212-222, 2004
162004
Optimizing binary heaps
S Edelkamp, A Elmasry, J Katajainen
Theory of Computing Systems 61 (2), 606-636, 2017
15*2017
A priority queue with the working-set property
A Elmasry
International Journal of Foundations of Computer Science 17 (06), 1455-1465, 2006
15*2006
Priority queues, pairing, and adaptive sorting
A Elmasry
International Colloquium on Automata, Languages, and Programming, 183-194, 2002
152002
Dynamic range majority data structures
A Elmasry, M He, JI Munro, PK Nicholson
Theoretical Computer Science 647, 59-73, 2016
14*2016
Weak heaps engineered
S Edelkamp, A Elmasry, J Katajainen
Journal of Discrete Algorithms 23, 83-97, 2013
14*2013
An O(n+m) certifying triconnnectivity algorithm for Hamiltonian graphs
A Elmasry, K Mehlhorn, JM Schmidt
Algorithmica 62 (3-4), 754-766, 2012
13*2012
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20