| 2009 |
|---|
| 32 | EE | Amr Elmasry:
Pairing heaps with O(log log n) decrease cost.
SODA 2009: 471-476 |
| 31 | EE | Amr Elmasry:
Pairing Heaps with Costless Meld
CoRR abs/0903.4130: (2009) |
| 2008 |
|---|
| 30 | EE | Khaled M. Elbassioni,
Amr Elmasry,
Ibrahim Kamel:
Indexing Schemes for Multi-dimensional Moving Objects.
Encyclopedia of GIS 2008: 523-529 |
| 29 | EE | Amr Elmasry,
Abdelrahman Hammad:
Inversion-sensitive sorting algorithms in practice.
ACM Journal of Experimental Algorithmics 13: (2008) |
| 28 | EE | Amr Elmasry,
Claus Jensen,
Jyrki Katajainen:
Multipartite priority queues.
ACM Transactions on Algorithms 5(1): (2008) |
| 27 | EE | Amr Elmasry,
Michael L. Fredman:
Adaptive sorting: an information theoretic perspective.
Acta Inf. 45(1): 33-42 (2008) |
| 26 | EE | Amr Elmasry,
Claus Jensen,
Jyrki Katajainen:
Two-tier relaxed heaps.
Acta Inf. 45(3): 193-210 (2008) |
| 25 | EE | Amr Elmasry:
Violation Heaps: A Better Substitute for Fibonacci Heaps
CoRR abs/0812.2851: (2008) |
| 2007 |
|---|
| 24 | EE | Amr Elmasry,
Claus Jensen,
Jyrki Katajainen:
On the Power of Structural Violations in Priority Queues.
CATS 2007: 45-53 |
| 23 | | Amr Elmasry,
Kazuhisa Makino:
Finding Intersections of Bichromatic Segments Defined by Points.
CCCG 2007: 269-272 |
| 2006 |
|---|
| 22 | EE | Amr Elmasry,
Claus Jensen,
Jyrki Katajainen:
Two-Tier Relaxed Heaps.
ISAAC 2006: 308-317 |
| 21 | EE | Ahmed A. Belal,
Amr Elmasry:
Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes.
STACS 2006: 92-103 |
| 20 | EE | Ahmed A. Belal,
Amr Elmasry:
Verification of minimum-redundancy prefix codes.
IEEE Transactions on Information Theory 52(4): 1399-1404 (2006) |
| 19 | EE | Amr Elmasry:
A Priority Queue with the Working-set Property.
Int. J. Found. Comput. Sci. 17(6): 1455-1466 (2006) |
| 2005 |
|---|
| 18 | EE | Ahmed A. Belal,
Amr Elmasry:
Finding maximum-cost minimum spanning trees.
AICCSA 2005: 14 |
| 17 | EE | Amr Elmasry,
Khaled M. Elbassioni:
Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in the Plane.
CCCG 2005: 248-251 |
| 16 | EE | Amr Elmasry,
Abdelrahman Hammad:
An Empirical Study for Inversions-Sensitive Sorting Algorithms.
WEA 2005: 597-601 |
| 15 | EE | Ahmed A. Belal,
Amr Elmasry:
Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes
CoRR abs/cs/0509015: (2005) |
| 14 | EE | Khaled M. Elbassioni,
Amr Elmasry,
Ibrahim Kamel:
An Indexing Method for Answering Queries on Moving Objects.
Distributed and Parallel Databases 17(3): 215-249 (2005) |
| 13 | | Amr Elmasry:
Deterministic Jumplists.
Nord. J. Comput. 12(1): 27-39 (2005) |
| 2004 |
|---|
| 12 | EE | Khaled M. Elbassioni,
Amr Elmasry,
Vladimir Gurvich:
A stronger version of Bárány's theorem in the plane.
CCCG 2004: 4-6 |
| 11 | | Amr Elmasry:
Adaptive Sorting with AVL Trees.
IFIP TCS 2004: 307-316 |
| 10 | EE | Amr Elmasry:
Layered Heaps.
SWAT 2004: 212-222 |
| 9 | EE | Amr Elmasry:
Parameterized self-adjusting heaps.
J. Algorithms 52(2): 103-119 (2004) |
| 8 | EE | Amr Elmasry:
On the sequential access theorem and deque conjecture for splay trees.
Theor. Comput. Sci. 314(3): 459-466 (2004) |
| 2003 |
|---|
| 7 | EE | Khaled M. Elbassioni,
Amr Elmasry,
Ibrahim Kamel:
An Efficient Indexing Scheme for Multi-dimensional Moving Objects.
ICDT 2003: 422-436 |
| 6 | EE | Amr Elmasry:
Three Sorting Algorithms Using Priority Queues.
ISAAC 2003: 209-220 |
| 5 | EE | Amr Elmasry,
Michael L. Fredman:
Adaptive Sorting and the Information Theoretic Lower Bound.
STACS 2003: 654-662 |
| 4 | EE | Amr Elmasry:
Distribution-Sensitive Binomial Queues.
WADS 2003: 103-113 |
| 2002 |
|---|
| 3 | EE | Khaled M. Elbassioni,
Amr Elmasry,
Ibrahim Kamel:
Efficient answering of polyhedral queries in rd using bbs-trees.
CCCG 2002: 54-57 |
| 2 | EE | Amr Elmasry:
Priority Queues, Pairing, and Adaptive Sorting.
ICALP 2002: 183-194 |
| 1998 |
|---|
| 1 | | Ahmed A. Belal,
Amr Elmasry:
Reaching the Bound in the (2, n) merging Problem.
Inf. Sci. 111(1-4): 261-271 (1998) |
