The SCEAS System
| |||||||

## Search the dblp DataBase
Amr Elmasry:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel
**Efficient answering of polyhedral queries in r**[Citation Graph (0, 0)][DBLP]^{d}using bbs-trees. CCCG, 2002, pp:54-57 [Conf] - 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] - Amr Elmasry
**Priority Queues, Pairing, and Adaptive Sorting.**[Citation Graph (0, 0)][DBLP] ICALP, 2002, pp:183-194 [Conf] - 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] - Amr Elmasry
**Adaptive Sorting with AVL Trees.**[Citation Graph (0, 0)][DBLP] IFIP TCS, 2004, pp:307-316 [Conf] - Amr Elmasry
**Three Sorting Algorithms Using Priority Queues.**[Citation Graph (0, 0)][DBLP] ISAAC, 2003, pp:209-220 [Conf] - Amr Elmasry, Claus Jensen, Jyrki Katajainen
**Two-Tier Relaxed Heaps.**[Citation Graph (0, 0)][DBLP] ISAAC, 2006, pp:308-317 [Conf] - Ahmed A. Belal, Amr Elmasry
**Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes.**[Citation Graph (0, 0)][DBLP] STACS, 2006, pp:92-103 [Conf] - Amr Elmasry, Michael L. Fredman
**Adaptive Sorting and the Information Theoretic Lower Bound.**[Citation Graph (0, 0)][DBLP] STACS, 2003, pp:654-662 [Conf] - Amr Elmasry
**Layered Heaps.**[Citation Graph (0, 0)][DBLP] SWAT, 2004, pp:212-222 [Conf] - Amr Elmasry
**Distribution-Sensitive Binomial Queues.**[Citation Graph (0, 0)][DBLP] WADS, 2003, pp:103-113 [Conf] - Amr Elmasry, Abdelrahman Hammad
**An Empirical Study for Inversions-Sensitive Sorting Algorithms.**[Citation Graph (0, 0)][DBLP] WEA, 2005, pp:597-601 [Conf] - 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] - 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] - 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] - Amr Elmasry
**Parameterized self-adjusting heaps.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2004, v:52, n:2, pp:103-119 [Journal] - Amr Elmasry
**Deterministic Jumplists.**[Citation Graph (0, 0)][DBLP] Nord. J. Comput., 2005, v:12, n:1, pp:27-39 [Journal] - 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] - 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] - Ahmed A. Belal, Amr Elmasry
**Finding maximum-cost minimum spanning trees.**[Citation Graph (0, 0)][DBLP] AICCSA, 2005, pp:14- [Conf] - Amr Elmasry, Kazuhisa Makino
**Finding Intersections of Bichromatic Segments Defined by Points.**[Citation Graph (0, 0)][DBLP] CCCG, 2007, pp:269-272 [Conf] **On the Power of Structural Violations in Priority Queues.**[Citation Graph (, )][DBLP]**The Violation Heap: A Relaxed Fibonacci-Like Heap.**[Citation Graph (, )][DBLP]**The Longest Almost-Increasing Subsequence.**[Citation Graph (, )][DBLP]**Pairing Heaps with Costless Meld.**[Citation Graph (, )][DBLP]**Pairing heaps with**[Citation Graph (, )][DBLP]*O*(log log*n*) decrease cost.**Strictly-Regular Number System and Data Structures.**[Citation Graph (, )][DBLP]**The Magic of a Number System.**[Citation Graph (, )][DBLP]**Adaptive sorting: an information theoretic perspective.**[Citation Graph (, )][DBLP]**Two-tier relaxed heaps.**[Citation Graph (, )][DBLP]**Two new methods for constructing double-ended priority queues from priority queues.**[Citation Graph (, )][DBLP]**Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes**[Citation Graph (, )][DBLP]**Violation Heaps: A Better Substitute for Fibonacci Heaps**[Citation Graph (, )][DBLP]**Pairing Heaps with Costless Meld**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |