Amr Elmasry

CoRR, 2024

2022

Regular numeral systems for data structures.

[BibT_eX]

[DOI]

Acta Informatica, 2022

Tuning the Evaporation Parameter in ACO MANET Routing Using a Satisfaction-Form Game-Theoretic Approach.

[BibT_eX]

[DOI]

Marwan A. Hefnawy

Saad M. Darwish

IEEE Access, 2022

2021

Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls.

[BibT_eX]

[DOI]

Omar Darwish

ACM Trans. Algorithms, 2021

2019

A new algorithm for the shortest-path problem.

[BibT_eX]

[DOI]

Ahmed Shokry

Networks, 2019

Optimal prefix codes with fewer distinct codeword lengths are faster to construct.

[BibT_eX]

[DOI]

Inf. Comput., 2019

Red-black trees with constant update time.

[BibT_eX]

[DOI]

Acta Informatica, 2019

Optimal Shortest Path in Mobile Ad-Hoc Network Based on Fruit Fly Optimization Algorithm.

[BibT_eX]

[DOI]

Saad M. Darwish

Shaymaa H. Ibrahim

Proceedings of the International Conference on Advanced Machine Learning Technologies and Applications, 2019

Parameter Estimation for Chaotic Systems Using the Fruit Fly Optimization Algorithm.

[BibT_eX]

[DOI]

Saad M. Darwish

Asmaa H. Ibrahim

Proceedings of the International Conference on Advanced Machine Learning Technologies and Applications, 2019

2018

On the approximability of the maximum interval constrained coloring problem.

[BibT_eX]

[DOI]

Discret. Optim., 2018

2017

Indexing Schemes for Multidimensional Moving Objects.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of GIS., 2017

Toward Optimal Self-Adjusting Heaps.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2017

Optimizing Binary Heaps.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

Bipartite binomial heaps.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2017

Heap Construction - 50 Years Later.

[BibT_eX]

[DOI]

Comput. J., 2017

2016

Dynamic range majority data structures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Optimality analysis of if-conversion transformation.

[BibT_eX]

[DOI]

Reem Elkhouly

Ahmed El-Mahdy

Proceedings of the 24th High Performance Computing Symposium, 2016

Space-Efficient Plane-Sweep Algorithms.

[BibT_eX]

[DOI]

Frank Kammer

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

A scalable maximum-clique algorithm using Apache Spark.

[BibT_eX]

[DOI]

Ayman Khalafallah

Moustafa Meshry

Proceedings of the 13th IEEE/ACS International Conference of Computer Systems and Applications, 2016

2015

Counting inversions adaptively.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Space-efficient Basic Graph Algorithms.

[BibT_eX]

[DOI]

Torben Hagerup

Frank Kammer

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2-Bit Branch Predictor Modeling Using Markov Model.

[BibT_eX]

[DOI]

Reem Elkhouly

Ahmed El-Mahdy

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.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2015

2014

Selection from read-only memory with limited workspace.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

On Finding Sparse Three-Edge-Connected and Three-Vertex-Connected Spanning subgraphs.

[BibT_eX]

[DOI]

Yung H. Tsin

Int. J. Found. Comput. Sci., 2014

Strengthened Lazy Heaps: Surpassing the Lower Bounds for Binary Heaps.

[BibT_eX]

[DOI]

CoRR, 2014

Optimal Time-Space Tradeoff for the 2D Convex-Hull Problem.

[BibT_eX]

[DOI]

Omar Darwish

Proceedings of the Algorithms - ESA 2014, 2014

2013

Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge.

[BibT_eX]

[DOI]

Kurt Mehlhorn

Jens M. Schmidt

J. Graph Theory, 2013

Weak heaps engineered.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2013

Fat Heaps without Regular Counters.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2013

On the hierarchy of distribution-sensitive properties for data structures.

[BibT_eX]

[DOI]

Acta Informatica, 2013

Branchless Search Programs.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Priority Queues and Sorting for Read-Only Data.

[BibT_eX]

[DOI]

Tetsuo Asano

Proceedings of the Theory and Applications of Models of Computation, 2013

In-Place Binary Counters.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Weak Heaps and Friends: Recent Developments.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012

Two Skew-Binary Numeral Systems and One Application.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2012

A priority queue with the time-finger property.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Enumerating trichromatic triangles containing the origin in linear time.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

The weak-heap data structure: Variants and applications.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

On the size of the subset partial order.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs.

[BibT_eX]

[DOI]

Kurt Mehlhorn

Jens M. Schmidt

Algorithmica, 2012

Branch Mispredictions Don't Affect Mergesort.

[BibT_eX]

[DOI]

Max Stenmark

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Improved Address-Calculation Coding of Integer Arrays.

[BibT_eX]

[DOI]

Jukka Teuhola

Proceedings of the String Processing and Information Retrieval, 2012

In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

A Catalogue of Algorithms for Building Weak Heaps.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012

Lean Programs, Branch Mispredictions, and Sorting.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Worst-Case Optimal Priority Queues via Extended Regular Counters.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2012

The Weak-Heap Family of Priority Queues in Theory and Praxis.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

2011

Finding Simplices containing the Origin in Two and Three Dimensions.

[BibT_eX]

[DOI]

Kazuhisa Makino

Int. J. Comput. Geom. Appl., 2011

A Unifying Property for Distribution-Sensitive Priority Queues.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

Two Constant-Factor-Optimal Realizations of Adaptive Heapsort.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

2010

The longest almost-increasing subsequence.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Pairing heaps, scrambled pairing and square-root trees.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2010

The Violation Heap: a Relaxed Fibonacci-like Heap.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2010

Priority Queues with Multiple Time Fingers

[BibT_eX]

[DOI]

CoRR, 2010

Strictly-Regular Number System and Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2010

Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

The Magic of a Number System.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Pairing Heaps with Costless Meld.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

The Subset Partial Order: Computing and Combinatorics.

[BibT_eX]

[DOI]

Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010

2009

Computing the subset partial order for dense families of sets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Pairing heaps with O(log log n) decrease cost.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008

Indexing Schemes for Multi-dimensional Moving Objects.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of GIS., 2008

Multipartite priority queues.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

Inversion-sensitive sorting algorithms in practice.

[BibT_eX]

[DOI]

Abdelrahman Hammad

ACM J. Exp. Algorithmics, 2008

Violation Heaps: A Better Substitute for Fibonacci Heaps

[BibT_eX]

[DOI]

CoRR, 2008

Two new methods for constructing double-ended priority queues from priority queues.

[BibT_eX]

[DOI]

Computing, 2008

Two-tier relaxed heaps.

[BibT_eX]

[DOI]

Acta Informatica, 2008

Adaptive sorting: an information theoretic perspective.

[BibT_eX]

[DOI]

Michael L. Fredman

Acta Informatica, 2008

2007

Finding Intersections of Bichromatic Segments Defined by Points.

[BibT_eX]

[DOI]

Kazuhisa Makino

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

On the Power of Structural Violations in Priority Queues.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

A Priority Queue with the Working-set Property.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2006

Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes.

[BibT_eX]

[DOI]

Proceedings of the STACS 2006, 2006

2005

Deterministic Jumplists.

[BibT_eX]

Nord. J. Comput., 2005

An Indexing Method for Answering Queries on Moving Objects.

[BibT_eX]

[DOI]

Distributed Parallel Databases, 2005

An Empirical Study for Inversions-Sensitive Sorting Algorithms.

[BibT_eX]

[DOI]

Abdelrahman Hammad

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.

[BibT_eX]

[DOI]

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Finding maximum-cost minimum spanning trees.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Parameterized self-adjusting heaps.

[BibT_eX]

[DOI]

J. Algorithms, 2004

Layered Heaps.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2004

Adaptive Sorting with AVL Trees.

[BibT_eX]

[DOI]

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

A stronger version of Bárány's theorem in the plane.

[BibT_eX]

[DOI]

Vladimir Gurvich

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003

Distribution-Sensitive Binomial Queues.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Adaptive Sorting and the Information Theoretic Lower Bound.

[BibT_eX]

[DOI]

Michael L. Fredman

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.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

An Efficient Indexing Scheme for Multi-dimensional Moving Objects.

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 2003

2002

Priority Queues, Pairing, and Adaptive Sorting.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Efficient answering of polyhedral queries in rd using bbs-trees.

[BibT_eX]

[DOI]

Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

1998

Reaching the Bound in the (2, n) merging Problem.

[BibT_eX]

[DOI]