 | 2012 |
|---|
| 54 |       | Amr Elmasry,
Jyrki Katajainen,
Max Stenmark:
Branch Mispredictions Don't Affect Mergesort.
SEA 2012: 160-171 |
| 53 | | Amr Elmasry,
Jyrki Katajainen:
Fat Heaps without Regular Counters.
WALCOM 2012: 173-185 |
| 52 | | Amr Elmasry,
Kurt Mehlhorn,
Jens M. Schmidt:
An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs.
Algorithmica 62(3-4): 754-766 (2012) |
| 51 | | Amr Elmasry:
On the size of the subset partial order.
Inf. Process. Lett. 112(12): 487-489 (2012) |
| 50 | | Amr Elmasry,
Claus Jensen,
Jyrki Katajainen:
Two Skew-Binary Numeral Systems and One Application.
Theory Comput. Syst. 50(1): 185-211 (2012) |
| 2011 |
|---|
| 49 | | Amr Elmasry,
Meng He,
J. Ian Munro,
Patrick K. Nicholson:
Dynamic Range Majority Data Structures.
ISAAC 2011: 150-159 |
| 48 | | Stefan Edelkamp,
Amr Elmasry,
Jyrki Katajainen:
Two Constant-Factor-Optimal Realizations of Adaptive Heapsort.
IWOCA 2011: 195-208 |
| 47 | | Amr Elmasry,
Arash Farzan,
John Iacono:
A Unifying Property for Distribution-Sensitive Priority Queues.
IWOCA 2011: 209-222 |
| 46 | | Amr Elmasry,
Jyrki Katajainen:
Worst-Case Optimal Priority Queues via Extended Regular Counters
CoRR abs/1112.0993: (2011) |
| 45 | | Khaled M. Elbassioni,
Amr Elmasry,
Kazuhisa Makino:
Finding Simplices containing the Origin in Two and Three Dimensions.
Int. J. Comput. Geometry Appl. 21(5): 495-506 (2011) |
| 2010 |
|---|
| 44 | | Amr Elmasry:
The Longest Almost-Increasing Subsequence.
COCOON 2010: 338-347 |
| 43 | | Amr Elmasry:
The Violation Heap: A Relaxed Fibonacci-Like Heap.
COCOON 2010: 479-488 |
| 42 | | Amr Elmasry:
Pairing Heaps with Costless Meld.
ESA (2) 2010: 183-193 |
| 41 | | Amr Elmasry,
Claus Jensen,
Jyrki Katajainen:
The Magic of a Number System.
FUN 2010: 156-165 |
| 40 | | Stefan Canzar,
Khaled M. Elbassioni,
Amr Elmasry,
Rajiv Raman:
On the Approximability of the Maximum Interval Constrained Coloring Problem.
ISAAC (2) 2010: 168-179 |
| 39 | | Amr Elmasry:
Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs.
ISAAC (2) 2010: 375-386 |
| 38 | | Amr Elmasry,
Claus Jensen,
Jyrki Katajainen:
Strictly-Regular Number System and Data Structures.
SWAT 2010: 26-37 |
| 37 | | Amr Elmasry,
Arash Farzan,
John Iacono:
Priority Queues with Multiple Time Fingers
CoRR abs/1009.5538: (2010) |
| 36 | | Amr Elmasry:
The longest almost-increasing subsequence.
Inf. Process. Lett. 110(16): 655-658 (2010) |
| 35 | | Amr Elmasry:
Pairing heaps, scrambled pairing and square-root trees.
Int. J. Comput. Math. 87(14): 3096-3110 (2010) |
| 2009 |
|---|
| 34 | | Amr Elmasry:
Pairing heaps with O(log log n) decrease cost.
SODA 2009: 471-476 |
| 33 | | Amr Elmasry:
Pairing Heaps with Costless Meld
CoRR abs/0903.4130: (2009) |
| 32 | | Amr Elmasry:
Computing the subset partial order for dense families of sets.
Inf. Process. Lett. 109(18): 1082-1086 (2009) |
| 2008 |
|---|
| 31 | | Khaled M. Elbassioni,
Amr Elmasry,
Ibrahim Kamel:
Indexing Schemes for Multi-dimensional Moving Objects.
Encyclopedia of GIS 2008: 523-529 |
| 30 | | Amr Elmasry,
Abdelrahman Hammad:
Inversion-sensitive sorting algorithms in practice.
ACM Journal of Experimental Algorithmics 13: (2008) |
| 29 | | Amr Elmasry,
Claus Jensen,
Jyrki Katajainen:
Multipartite priority queues.
ACM Transactions on Algorithms 5(1): (2008) |
| 28 | | Amr Elmasry,
Michael L. Fredman:
Adaptive sorting: an information theoretic perspective.
Acta Inf. 45(1): 33-42 (2008) |
| 27 | | Amr Elmasry,
Claus Jensen,
Jyrki Katajainen:
Two-tier relaxed heaps.
Acta Inf. 45(3): 193-210 (2008) |
| 26 | | Amr Elmasry:
Violation Heaps: A Better Substitute for Fibonacci Heaps
CoRR abs/0812.2851: (2008) |
| 25 | | Amr Elmasry,
Claus Jensen,
Jyrki Katajainen:
Two new methods for constructing double-ended priority queues from priority queues.
Computing 83(4): 193-204 (2008) |
| 2007 |
|---|
| 24 | | 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 | | Amr Elmasry,
Claus Jensen,
Jyrki Katajainen:
Two-Tier Relaxed Heaps.
ISAAC 2006: 308-317 |
| 21 | | Ahmed A. Belal,
Amr Elmasry:
Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes.
STACS 2006: 92-103 |
| 20 | | Ahmed A. Belal,
Amr Elmasry:
Verification of minimum-redundancy prefix codes.
IEEE Transactions on Information Theory 52(4): 1399-1404 (2006) |
| 19 | | Amr Elmasry:
A Priority Queue with the Working-set Property.
Int. J. Found. Comput. Sci. 17(6): 1455-1466 (2006) |
| 2005 |
|---|
| 18 | | Ahmed A. Belal,
Amr Elmasry:
Finding maximum-cost minimum spanning trees.
AICCSA 2005: 14 |
| 17 | | 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 | | Amr Elmasry,
Abdelrahman Hammad:
An Empirical Study for Inversions-Sensitive Sorting Algorithms.
WEA 2005: 597-601 |
| 15 | | Ahmed A. Belal,
Amr Elmasry:
Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes
CoRR abs/cs/0509015: (2005) |
| 14 | | 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 | | 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 | | Amr Elmasry:
Layered Heaps.
SWAT 2004: 212-222 |
| 9 | | Amr Elmasry:
Parameterized self-adjusting heaps.
J. Algorithms 52(2): 103-119 (2004) |
| 8 | | Amr Elmasry:
On the sequential access theorem and deque conjecture for splay trees.
Theor. Comput. Sci. 314(3): 459-466 (2004) |
| 2003 |
|---|
| 7 | | Khaled M. Elbassioni,
Amr Elmasry,
Ibrahim Kamel:
An Efficient Indexing Scheme for Multi-dimensional Moving Objects.
ICDT 2003: 422-436 |
| 6 | | Amr Elmasry:
Three Sorting Algorithms Using Priority Queues.
ISAAC 2003: 209-220 |
| 5 | | Amr Elmasry,
Michael L. Fredman:
Adaptive Sorting and the Information Theoretic Lower Bound.
STACS 2003: 654-662 |
| 4 | | Amr Elmasry:
Distribution-Sensitive Binomial Queues.
WADS 2003: 103-113 |
| 2002 |
|---|
| 3 | | Khaled M. Elbassioni,
Amr Elmasry,
Ibrahim Kamel:
Efficient answering of polyhedral queries in rd using bbs-trees.
CCCG 2002: 54-57 |
| 2 | | 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) |
Data released under the ODC-BY 1.0 license — See also our legal information page