Amr Elmasry

108 papers A* 2A 5B 10C 8Misc 7Journal 55Unranked 19
YearRankTypeTitle / Venue / Authors
2024 — conf
Automating Sanad Continuity Verification in Disconnected Hadith Using Machine Learning.
ICCTA
Mona Hendawi, Marwan Torki, Amr Elmasry, Ayman Khalafallah
2024 J jnl
Breaking the Bellman-Ford Shortest-Path Bound.
CoRR
Amr Elmasry
2024 J jnl
Verifying Shortest Paths in Linear Time.
CoRR
Ahmed Shokry, Amr Elmasry, Ayman Khalafallah, Amr Aly
2022 J jnl
Regular numeral systems for data structures.
Acta Informatica
Amr Elmasry, Jyrki Katajainen
2022 J jnl
Tuning the Evaporation Parameter in ACO MANET Routing Using a Satisfaction-Form Game-Theoretic Approach.
IEEE Access
Marwan A. Hefnawy, Saad M. Darwish, Amr Elmasry
2021 J jnl
Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls.
ACM Trans. Algorithms
Omar Darwish, Amr Elmasry, Jyrki Katajainen
2019 J jnl
A new algorithm for the shortest-path problem.
Networks
Amr Elmasry, Ahmed Shokry
2019 — conf
Optimal Shortest Path in Mobile Ad-Hoc Network Based on Fruit Fly Optimization Algorithm.
AMLTA
Saad M. Darwish, Amr Elmasry, Shaymaa H. Ibrahim
2019 J jnl
Optimal prefix codes with fewer distinct codeword lengths are faster to construct.
Inf. Comput.
Ahmed A. Belal, Amr Elmasry
2019 — conf
Parameter Estimation for Chaotic Systems Using the Fruit Fly Optimization Algorithm.
AMLTA
Saad M. Darwish, Amr Elmasry, Asmaa H. Ibrahim
2019 J jnl
Red-black trees with constant update time.
Acta Informatica
Amr Elmasry, Mostafa Kahla, Fady Ahdy, Mahmoud Hashem
2018 J jnl
On the approximability of the maximum interval constrained coloring problem.
Discret. Optim.
Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, Rajiv Raman
2018 J jnl
Red-Black Trees with Constant Update Time.
CoRR
Amr Elmasry, Mostafa Kahla, Fady Ahdy, Mahmoud Hashem
2017 J jnl
Bipartite binomial heaps.
RAIRO Theor. Informatics Appl.
Amr Elmasry, Claus Jensen, Jyrki Katajainen
2017 J jnl
Heap Construction - 50 Years Later.
Comput. J.
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
2017 — ch.
Indexing Schemes for Multidimensional Moving Objects.
Encyclopedia of GIS
Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel
2017 J jnl
Optimizing Binary Heaps.
Theory Comput. Syst.
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
2017 J jnl
Toward Optimal Self-Adjusting Heaps.
ACM Trans. Algorithms
Amr Elmasry
2016 C conf
A scalable maximum-clique algorithm using Apache Spark.
AICCSA
Amr Elmasry, Ayman Khalafallah, Moustafa Meshry
2016 J jnl
Dynamic range majority data structures.
Theor. Comput. Sci.
Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson
2016 — conf
Optimality analysis of if-conversion transformation.
SpringSim (HPS)
Reem Elkhouly, Ahmed El-Mahdy, Amr Elmasry
2016 B conf
Space-Efficient Plane-Sweep Algorithms.
ISAAC
Amr Elmasry, Frank Kammer
2015 — conf
2-Bit Branch Predictor Modeling Using Markov Model.
SCSE
Reem Elkhouly, Ahmed El-Mahdy, Amr Elmasry
2015 Misc conf
An In-Place Priority Queue with O(1) Time for Push and lg n + O ( 1 ) Comparisons for Pop.
CSR
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
2015 J jnl
Counting Inversions Adaptively.
CoRR
Amr Elmasry
2015 J jnl
Counting inversions adaptively.
Inf. Process. Lett.
Amr Elmasry
2015 J jnl
Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls.
CoRR
Omar Darwish, Amr Elmasry, Jyrki Katajainen
2015 J jnl
Space-Efficient Plane-Sweep Algorithms.
CoRR
Amr Elmasry, Frank Kammer
2015 A conf
Space-efficient Basic Graph Algorithms.
STACS
Amr Elmasry, Torben Hagerup, Frank Kammer
2014 J jnl
On Finding Sparse Three-Edge-Connected and Three-Vertex-Connected Spanning subgraphs.
Int. J. Found. Comput. Sci.
Amr Elmasry, Yung H. Tsin
2014 A conf
Optimal Time-Space Tradeoff for the 2D Convex-Hull Problem.
ESA
Omar Darwish, Amr Elmasry
2014 J jnl
Selection from read-only memory with limited workspace.
CoRR
Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti
2014 J jnl
Selection from read-only memory with limited workspace.
Theor. Comput. Sci.
Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti
2014 J jnl
Strengthened Lazy Heaps: Surpassing the Lower Bounds for Binary Heaps.
CoRR
Stefan Edelkamp, Jyrki Katajainen, Amr Elmasry
2013 B conf
Branchless Search Programs.
SEA
Amr Elmasry, Jyrki Katajainen
2013 J jnl
Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge.
J. Graph Theory
Amr Elmasry, Kurt Mehlhorn, Jens M. Schmidt
2013 J jnl
Fat Heaps without Regular Counters.
Discret. Math. Algorithms Appl.
Amr Elmasry, Jyrki Katajainen
2013 B conf
In-Place Binary Counters.
MFCS
Amr Elmasry, Jyrki Katajainen
2013 J jnl
On the hierarchy of distribution-sensitive properties for data structures.
Acta Informatica
Amr Elmasry, Arash Farzan, John Iacono
2013 C conf
Priority Queues and Sorting for Read-Only Data.
TAMC
Tetsuo Asano, Amr Elmasry, Jyrki Katajainen
2013 Misc conf
Selection from Read-Only Memory with Limited Workspace.
COCOON
Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti
2013 C conf
Weak Heaps and Friends: Recent Developments.
IWOCA
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen, Armin Weiß
2013 J jnl
Weak heaps engineered.
J. Discrete Algorithms
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
2012 C conf
A Catalogue of Algorithms for Building Weak Heaps.
IWOCA
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
2012 J jnl
A priority queue with the time-finger property.
J. Discrete Algorithms
Amr Elmasry, Arash Farzan, John Iacono
2012 J jnl
An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs.
Algorithmica
Amr Elmasry, Kurt Mehlhorn, Jens M. Schmidt
2012 B conf
Branch Mispredictions Don't Affect Mergesort.
SEA
Amr Elmasry, Jyrki Katajainen, Max Stenmark
2012 J jnl
Enumerating trichromatic triangles containing the origin in linear time.
J. Discrete Algorithms
Amr Elmasry
2012 B conf
Fat Heaps without Regular Counters.
WALCOM
Amr Elmasry, Jyrki Katajainen
2012 C conf
Improved Address-Calculation Coding of Integer Arrays.
SPIRE
Amr Elmasry, Jyrki Katajainen, Jukka Teuhola
2012 B conf
In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses.
MFCS
Jingsen Chen, Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
2012 Misc conf
Lean Programs, Branch Mispredictions, and Sorting.
FUN
Amr Elmasry, Jyrki Katajainen
2012 J jnl
On the size of the subset partial order.
Inf. Process. Lett.
Amr Elmasry
2012 — conf
The Weak-Heap Family of Priority Queues in Theory and Praxis.
CATS
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
2012 J jnl
The weak-heap data structure: Variants and applications.
J. Discrete Algorithms
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
2012 J jnl
Two Skew-Binary Numeral Systems and One Application.
Theory Comput. Syst.
Amr Elmasry, Claus Jensen, Jyrki Katajainen
2012 Misc conf
Worst-Case Optimal Priority Queues via Extended Regular Counters.
CSR
Amr Elmasry, Jyrki Katajainen
2011 C conf
A Unifying Property for Distribution-Sensitive Priority Queues.
IWOCA
Amr Elmasry, Arash Farzan, John Iacono
2011 B conf
Dynamic Range Majority Data Structures.
ISAAC
Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson
2011 J jnl
Finding Simplices containing the Origin in Two and Three Dimensions.
Int. J. Comput. Geom. Appl.
Khaled M. Elbassioni, Amr Elmasry, Kazuhisa Makino
2011 C conf
Two Constant-Factor-Optimal Realizations of Adaptive Heapsort.
IWOCA
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
2011 J jnl
Worst-Case Optimal Priority Queues via Extended Regular Counters
CoRR
Amr Elmasry, Jyrki Katajainen
2010 — conf
On the Approximability of the Maximum Interval Constrained Coloring Problem.
ISAAC (2)
Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, Rajiv Raman
2010 — conf
Pairing Heaps with Costless Meld.
ESA (2)
Amr Elmasry
2010 J jnl
Pairing heaps, scrambled pairing and square-root trees.
Int. J. Comput. Math.
Amr Elmasry
2010 J jnl
Priority Queues with Multiple Time Fingers
CoRR
Amr Elmasry, Arash Farzan, John Iacono
2010 — conf
Strictly-Regular Number System and Data Structures.
SWAT
Amr Elmasry, Claus Jensen, Jyrki Katajainen
2010 Misc conf
The Longest Almost-Increasing Subsequence.
COCOON
Amr Elmasry
2010 Misc conf
The Magic of a Number System.
FUN
Amr Elmasry, Claus Jensen, Jyrki Katajainen
2010 — conf
The Subset Partial Order: Computing and Combinatorics.
ANALCO
Amr Elmasry
2010 Misc conf
The Violation Heap: A Relaxed Fibonacci-Like Heap.
COCOON
Amr Elmasry
2010 J jnl
The Violation Heap: a Relaxed Fibonacci-like Heap.
Discret. Math. Algorithms Appl.
Amr Elmasry
2010 J jnl
The longest almost-increasing subsequence.
Inf. Process. Lett.
Amr Elmasry
2010 — conf
Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs.
ISAAC (2)
Amr Elmasry
2009 J jnl
Computing the subset partial order for dense families of sets.
Inf. Process. Lett.
Amr Elmasry
2009 J jnl
Pairing Heaps with Costless Meld
CoRR
Amr Elmasry
2009 A* conf
Pairing heaps with
SODA
Amr Elmasry
2008 J jnl
Adaptive sorting: an information theoretic perspective.
Acta Informatica
Amr Elmasry, Michael L. Fredman
2008 — ch.
Indexing Schemes for Multi-dimensional Moving Objects.
Encyclopedia of GIS
Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel
2008 J jnl
Inversion-sensitive sorting algorithms in practice.
ACM J. Exp. Algorithmics
Amr Elmasry, Abdelrahman Hammad
2008 J jnl
Multipartite priority queues.
ACM Trans. Algorithms
Amr Elmasry, Claus Jensen, Jyrki Katajainen
2008 J jnl
Two new methods for constructing double-ended priority queues from priority queues.
Computing
Amr Elmasry, Claus Jensen, Jyrki Katajainen
2008 J jnl
Two-tier relaxed heaps.
Acta Informatica
Amr Elmasry, Claus Jensen, Jyrki Katajainen
2008 J jnl
Violation Heaps: A Better Substitute for Fibonacci Heaps
CoRR
Amr Elmasry
2007 — conf
Finding Intersections of Bichromatic Segments Defined by Points.
CCCG
Amr Elmasry, Kazuhisa Makino
2007 — conf
On the Power of Structural Violations in Priority Queues.
CATS
Amr Elmasry, Claus Jensen, Jyrki Katajainen
2006 J jnl
A Priority Queue with the Working-set Property.
Int. J. Found. Comput. Sci.
Amr Elmasry
2006 A conf
Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes.
STACS
Ahmed A. Belal, Amr Elmasry
2006 B conf
Two-Tier Relaxed Heaps.
ISAAC
Amr Elmasry, Claus Jensen, Jyrki Katajainen
2006 J jnl
Verification of minimum-redundancy prefix codes.
IEEE Trans. Inf. Theory
Ahmed A. Belal, Amr Elmasry
2005 — conf
An Empirical Study for Inversions-Sensitive Sorting Algorithms.
WEA
Amr Elmasry, Abdelrahman Hammad
2005 J jnl
An Indexing Method for Answering Queries on Moving Objects.
Distributed Parallel Databases
Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel
2005 J jnl
Deterministic Jumplists.
Nord. J. Comput.
Amr Elmasry
2005 J jnl
Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes
CoRR
Ahmed A. Belal, Amr Elmasry
2005 C conf
Finding maximum-cost minimum spanning trees.
AICCSA
Ahmed A. Belal, Amr Elmasry
2005 — conf
Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in the Plane.
CCCG
Amr Elmasry, Khaled M. Elbassioni
2004 — conf
A stronger version of Bárány's theorem in the plane.
CCCG
Khaled M. Elbassioni, Amr Elmasry, Vladimir Gurvich
2004 — conf
Adaptive Sorting with AVL Trees.
IFIP TCS
Amr Elmasry
2004 — conf
Layered Heaps.
SWAT
Amr Elmasry
2004 J jnl
On the sequential access theorem and deque conjecture for splay trees.
Theor. Comput. Sci.
Amr Elmasry
2004 J jnl
Parameterized self-adjusting heaps.
J. Algorithms
Amr Elmasry
2003 A conf
Adaptive Sorting and the Information Theoretic Lower Bound.
STACS
Amr Elmasry, Michael L. Fredman
2003 A conf
An Efficient Indexing Scheme for Multi-dimensional Moving Objects.
ICDT
Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel
2003 B conf
Distribution-Sensitive Binomial Queues.
WADS
Amr Elmasry
2003 B conf
Three Sorting Algorithms Using Priority Queues.
ISAAC
Amr Elmasry
2002 — conf
Efficient answering of polyhedral queries in r
CCCG
Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel
2002 A* conf
Priority Queues, Pairing, and Adaptive Sorting.
ICALP
Amr Elmasry
1998 J jnl
Reaching the Bound in the (2, n) merging Problem.
Inf. Sci.
Ahmed A. Belal, Amr Elmasry