Search the dblp DataBase

Publications of Author

1. Khaled M. Elbassioni, Amr Elmasry, Vladimir Gurvich
   A stronger version of Bárány's theorem in the plane. [Citation Graph (0, 0)][DBLP]
   CCCG, 2004, pp:4-6 [Conf]
   
2. Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel
   Efficient answering of polyhedral queries in r^d using bbs-trees. [Citation Graph (0, 0)][DBLP]
   CCCG, 2002, pp:54-57 [Conf]
   
3. Amr Elmasry, Khaled M. Elbassioni
   Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in the Plane. [Citation Graph (0, 0)][DBLP]
   CCCG, 2005, pp:248-251 [Conf]
   
4. Amr Elmasry
   Priority Queues, Pairing, and Adaptive Sorting. [Citation Graph (0, 0)][DBLP]
   ICALP, 2002, pp:183-194 [Conf]
   
5. Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel
   An Efficient Indexing Scheme for Multi-dimensional Moving Objects. [Citation Graph (0, 0)][DBLP]
   ICDT, 2003, pp:422-436 [Conf]
   
6. Amr Elmasry
   Adaptive Sorting with AVL Trees. [Citation Graph (0, 0)][DBLP]
   IFIP TCS, 2004, pp:307-316 [Conf]
   
7. Amr Elmasry
   Three Sorting Algorithms Using Priority Queues. [Citation Graph (0, 0)][DBLP]
   ISAAC, 2003, pp:209-220 [Conf]
   
8. Amr Elmasry, Claus Jensen, Jyrki Katajainen
   Two-Tier Relaxed Heaps. [Citation Graph (0, 0)][DBLP]
   ISAAC, 2006, pp:308-317 [Conf]
   
9. Ahmed A. Belal, Amr Elmasry
   Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes. [Citation Graph (0, 0)][DBLP]
   STACS, 2006, pp:92-103 [Conf]
   
10. Amr Elmasry, Michael L. Fredman
    Adaptive Sorting and the Information Theoretic Lower Bound. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:654-662 [Conf]
    
11. Amr Elmasry
    Layered Heaps. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:212-222 [Conf]
    
12. Amr Elmasry
    Distribution-Sensitive Binomial Queues. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:103-113 [Conf]
    
13. Amr Elmasry, Abdelrahman Hammad
    An Empirical Study for Inversions-Sensitive Sorting Algorithms. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:597-601 [Conf]
    
14. Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel
    An Indexing Method for Answering Queries on Moving Objects. [Citation Graph (0, 0)][DBLP]
    Distributed and Parallel Databases, 2005, v:17, n:3, pp:215-249 [Journal]
    
15. Amr Elmasry
    A Priority Queue with the Working-set Property. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1455-1466 [Journal]
    
16. Ahmed A. Belal, Amr Elmasry
    Reaching the Bound in the (2, n) merging Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1998, v:111, n:1-4, pp:261-271 [Journal]
    
17. Amr Elmasry
    Parameterized self-adjusting heaps. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:52, n:2, pp:103-119 [Journal]
    
18. Amr Elmasry
    Deterministic Jumplists. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2005, v:12, n:1, pp:27-39 [Journal]
    
19. Amr Elmasry
    On the sequential access theorem and deque conjecture for splay trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:314, n:3, pp:459-466 [Journal]
    
20. Ahmed A. Belal, Amr Elmasry
    Verification of minimum-redundancy prefix codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:4, pp:1399-1404 [Journal]
    
21. Ahmed A. Belal, Amr Elmasry
    Finding maximum-cost minimum spanning trees. [Citation Graph (0, 0)][DBLP]
    AICCSA, 2005, pp:14- [Conf]
    
22. Amr Elmasry, Kazuhisa Makino
    Finding Intersections of Bichromatic Segments Defined by Points. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:269-272 [Conf]
    
23. 
    On the Power of Structural Violations in Priority Queues. [Citation Graph (, )][DBLP]
    
    
24. 
    The Violation Heap: A Relaxed Fibonacci-Like Heap. [Citation Graph (, )][DBLP]
    
    
25. 
    The Longest Almost-Increasing Subsequence. [Citation Graph (, )][DBLP]
    
    
26. 
    Pairing Heaps with Costless Meld. [Citation Graph (, )][DBLP]
    
    
27. 
    Pairing heaps with O(log log n) decrease cost. [Citation Graph (, )][DBLP]
    
    
28. 
    Strictly-Regular Number System and Data Structures. [Citation Graph (, )][DBLP]
    
    
29. 
    The Magic of a Number System. [Citation Graph (, )][DBLP]
    
    
30. 
    Adaptive sorting: an information theoretic perspective. [Citation Graph (, )][DBLP]
    
    
31. 
    Two-tier relaxed heaps. [Citation Graph (, )][DBLP]
    
    
32. 
    Two new methods for constructing double-ended priority queues from priority queues. [Citation Graph (, )][DBLP]
    
    
33. 
    Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes [Citation Graph (, )][DBLP]
    
    
34. 
    Violation Heaps: A Better Substitute for Fibonacci Heaps [Citation Graph (, )][DBLP]
    
    
35. 
    Pairing Heaps with Costless Meld [Citation Graph (, )][DBLP]