Amr Elmasry Papers on DiSC'04 An Efficient Indexing Scheme for Multi-dimensional Moving Objects Publications Note: Links lead to the DBLP on the Web. Amr Elmasry Amr Elmasry, Abdelrahman Hammad : An Empirical Study for Inversions-Sensitive Sorting Algorithms. WEA 2005 : 597-601 Khaled M. Elbassioni , Amr Elmasry, Vladimir Gurvich : A stronger version of Bárány's theorem in the plane. CCCG 2004 : 4-6 Amr Elmasry: Adaptive Sorting with AVL Trees. IFIP TCS 2004 : 307-316 Amr Elmasry: Layered Heaps. SWAT 2004 : 212-222 Amr Elmasry: Parameterized self-adjusting heaps. J. Algorithms 52 (2): 103-119 (2004) Amr Elmasry: On the sequential access theorem and deque conjecture for splay trees. Theor. Comput. Sci. 314 (3): 459-466 (2004) Khaled M. Elbassioni , Amr Elmasry, Ibrahim Kamel : An Efficient Indexing Scheme for Multi-dimensional Moving Objects. ICDT 2003 : 425-439 Amr Elmasry: Three Sorting Algorithms Using Priority Queues. ISAAC 2003 : 209-220 Amr Elmasry, Michael L. Fredman : Adaptive Sorting and the Information Theoretic Lower Bound. STACS 2003 : 654-662 Amr Elmasry: Distribution-Sensitive Binomial Queues. WADS 2003 : 103-113 Khaled M. Elbassioni , Amr Elmasry, Ibrahim Kamel : Efficient answering of polyhedral queries in r d using bbs-trees. CCCG 2002 : 54-57 Amr Elmasry: Priority Queues, Pairing, and Adaptive Sorting. ICALP 2002 : 183-194 Ahmed A. Belal , Amr Elmasry: Reaching the Bound in the (2, n) merging Problem. Inf. Sci. 111 (1-4): 261-271 (1998) 1 [ 1 ] 2 [ 3 ] [ 7 ] [ 12 ] 3 [ 5 ] 4 [ 12 ] 5 [ 13 ] 6 [ 3 ] [ 7 ] ©2005 Association for Computing Machinery