Amr Elmasry
According to our database1,
Amr Elmasry
authored at least 102 papers
between 1998 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:
On csauthors.net:
Bibliography
2019
A new algorithm for the shortest-path problem.
Networks, 2019
Optimal prefix codes with fewer distinct codeword lengths are faster to construct.
Inf. Comput., 2019
Red-black trees with constant update time.
Acta Inf., 2019
Optimal Shortest Path in Mobile Ad-Hoc Network Based on Fruit Fly Optimization Algorithm.
Proceedings of the International Conference on Advanced Machine Learning Technologies and Applications, 2019
Parameter Estimation for Chaotic Systems Using the Fruit Fly Optimization Algorithm.
Proceedings of the International Conference on Advanced Machine Learning Technologies and Applications, 2019
2018
On the approximability of the maximum interval constrained coloring problem.
Discrete Optimization, 2018
Red-Black Trees with Constant Update Time.
CoRR, 2018
2017
Indexing Schemes for Multidimensional Moving Objects.
, 2017
Toward Optimal Self-Adjusting Heaps.
ACM Trans. Algorithms, 2017
Optimizing Binary Heaps.
Theory Comput. Syst., 2017
Bipartite binomial heaps.
RAIRO - Theor. Inf. and Applic., 2017
Heap Construction - 50 Years Later.
Comput. J., 2017
2016
Dynamic range majority data structures.
Theor. Comput. Sci., 2016
Optimality analysis of if-conversion transformation.
Proceedings of the 24th High Performance Computing Symposium, 2016
Space-Efficient Plane-Sweep Algorithms.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016
A scalable maximum-clique algorithm using Apache Spark.
Proceedings of the 13th IEEE/ACS International Conference of Computer Systems and Applications, 2016
2015
Counting inversions adaptively.
Inf. Process. Lett., 2015
Space-Efficient Plane-Sweep Algorithms.
CoRR, 2015
Counting Inversions Adaptively.
CoRR, 2015
Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls.
CoRR, 2015
Space-efficient Basic Graph Algorithms.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015
2-Bit Branch Predictor Modeling Using Markov Model.
Proceedings of the 2015 International Conference on Soft Computing and Software Engineering, 2015
An In-Place Priority Queue with O(1) Time for Push and lg n + O ( 1 ) Comparisons for Pop.
Proceedings of the Computer Science - Theory and Applications, 2015
2014
Selection from read-only memory with limited workspace.
Theor. Comput. Sci., 2014
On Finding Sparse Three-Edge-Connected and Three-Vertex-Connected Spanning subgraphs.
Int. J. Found. Comput. Sci., 2014
Selection from read-only memory with limited workspace.
CoRR, 2014
Strengthened Lazy Heaps: Surpassing the Lower Bounds for Binary Heaps.
CoRR, 2014
Optimal Time-Space Tradeoff for the 2D Convex-Hull Problem.
Proceedings of the Algorithms - ESA 2014, 2014
2013
Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge.
Journal of Graph Theory, 2013
Weak heaps engineered.
J. Discrete Algorithms, 2013
Fat Heaps without Regular Counters.
Discrete Math., Alg. and Appl., 2013
On the hierarchy of distribution-sensitive properties for data structures.
Acta Inf., 2013
Branchless Search Programs.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013
Priority Queues and Sorting for Read-Only Data.
Proceedings of the Theory and Applications of Models of Computation, 2013
In-Place Binary Counters.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013
Weak Heaps and Friends: Recent Developments.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013
Selection from Read-Only Memory with Limited Workspace.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013
2012
Two Skew-Binary Numeral Systems and One Application.
Theory Comput. Syst., 2012
A priority queue with the time-finger property.
J. Discrete Algorithms, 2012
Enumerating trichromatic triangles containing the origin in linear time.
J. Discrete Algorithms, 2012
The weak-heap data structure: Variants and applications.
J. Discrete Algorithms, 2012
On the size of the subset partial order.
Inf. Process. Lett., 2012
An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs.
Algorithmica, 2012
Branch Mispredictions Don't Affect Mergesort.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012
Fat Heaps without Regular Counters.
Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012
Improved Address-Calculation Coding of Integer Arrays.
Proceedings of the String Processing and Information Retrieval, 2012
In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012
A Catalogue of Algorithms for Building Weak Heaps.
Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012
Lean Programs, Branch Mispredictions, and Sorting.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012
Worst-Case Optimal Priority Queues via Extended Regular Counters.
Proceedings of the Computer Science - Theory and Applications, 2012
The Weak-Heap Family of Priority Queues in Theory and Praxis.
Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012
2011
Finding Simplices containing the Origin in Two and Three Dimensions.
Int. J. Comput. Geometry Appl., 2011
Worst-Case Optimal Priority Queues via Extended Regular Counters
CoRR, 2011
A Unifying Property for Distribution-Sensitive Priority Queues.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011
Two Constant-Factor-Optimal Realizations of Adaptive Heapsort.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011
Dynamic Range Majority Data Structures.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011
2010
The longest almost-increasing subsequence.
Inf. Process. Lett., 2010
Pairing heaps, scrambled pairing and square-root trees.
Int. J. Comput. Math., 2010
The Violation Heap: a Relaxed Fibonacci-like Heap.
Discrete Math., Alg. and Appl., 2010
Priority Queues with Multiple Time Fingers
CoRR, 2010
Strictly-Regular Number System and Data Structures.
Proceedings of the Algorithm Theory, 2010
Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010
On the Approximability of the Maximum Interval Constrained Coloring Problem.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010
The Magic of a Number System.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010
Pairing Heaps with Costless Meld.
Proceedings of the Algorithms, 2010
The Violation Heap: A Relaxed Fibonacci-Like Heap.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010
The Longest Almost-Increasing Subsequence.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010
The Subset Partial Order: Computing and Combinatorics.
Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010
2009
Computing the subset partial order for dense families of sets.
Inf. Process. Lett., 2009
Pairing Heaps with Costless Meld
CoRR, 2009
Pairing heaps with O(log log n) decrease cost.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
2008
Indexing Schemes for Multi-dimensional Moving Objects.
Proceedings of the Encyclopedia of GIS., 2008
Multipartite priority queues.
ACM Trans. Algorithms, 2008
Inversion-sensitive sorting algorithms in practice.
ACM Journal of Experimental Algorithmics, 2008
Violation Heaps: A Better Substitute for Fibonacci Heaps
CoRR, 2008
Two new methods for constructing double-ended priority queues from priority queues.
Computing, 2008
Two-tier relaxed heaps.
Acta Inf., 2008
Adaptive sorting: an information theoretic perspective.
Acta Inf., 2008
2007
Finding Intersections of Bichromatic Segments Defined by Points.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007
On the Power of Structural Violations in Priority Queues.
Proceedings of the Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30, 2007
2006
Verification of minimum-redundancy prefix codes.
IEEE Trans. Information Theory, 2006
A Priority Queue with the Working-set Property.
Int. J. Found. Comput. Sci., 2006
Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes.
Proceedings of the STACS 2006, 2006
Two-Tier Relaxed Heaps.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006
2005
Deterministic Jumplists.
Nord. J. Comput., 2005
An Indexing Method for Answering Queries on Moving Objects.
Distributed and Parallel Databases, 2005
Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes
CoRR, 2005
An Empirical Study for Inversions-Sensitive Sorting Algorithms.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005
Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in the Plane.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005
Finding maximum-cost minimum spanning trees.
Proceedings of the 2005 ACS / IEEE International Conference on Computer Systems and Applications (AICCSA 2005), 2005
2004
On the sequential access theorem and deque conjecture for splay trees.
Theor. Comput. Sci., 2004
Parameterized self-adjusting heaps.
J. Algorithms, 2004
Layered Heaps.
Proceedings of the Algorithm Theory, 2004
Adaptive Sorting with AVL Trees.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004
A stronger version of Bárány's theorem in the plane.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004
2003
Distribution-Sensitive Binomial Queues.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003
Adaptive Sorting and the Information Theoretic Lower Bound.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003
Three Sorting Algorithms Using Priority Queues.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003
An Efficient Indexing Scheme for Multi-dimensional Moving Objects.
Proceedings of the Database Theory, 2003
2002
Priority Queues, Pairing, and Adaptive Sorting.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002
Efficient answering of polyhedral queries in rd using bbs-trees.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002
1998
Reaching the Bound in the (2, n) merging Problem.
Inf. Sci., 1998