Hosam M. Mahmoud
According to our database1, Hosam M. Mahmoud
Legend:Book In proceedings Article PhD thesis Other
Asymptotic Properties of Protected Nodes in Random Recursive Trees.
J. Applied Probability, 2015
JISC: Adaptive Stream Processing Using Just-In-Time State Completion.
Proceedings of the 17th International Conference on Extending Database Technology, 2014
Survivors in Leader Election Algorithms.
Proceedings of the 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, 2014
Analysis of a generalized Friedman's urn with multiple drawings.
Discrete Applied Mathematics, 2013
Exactly Solvable Balanced Tenable Urns with Random Entries via the Analytic Methodology
Asymptotic distribution of two-protected nodes in random binary search trees.
Appl. Math. Lett., 2012
Distributional analysis of swaps in Quick Select.
Theor. Comput. Sci., 2010
Phases in the Mixing of Gases via the Ehrenfest Urn Model.
Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010
Average-case Analysis of Moves in Quick Select.
Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, 2009
Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees.
SIAM J. Discrete Math., 2008
Distances in random digital search trees.
Acta Inf., 2006
A stochastic model for solitons.
Random Struct. Algorithms, 2004
Paths in m-ary interval trees.
Discrete Mathematics, 2004
Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees.
Acta Inf., 2004
Erratum: The size of random bucket trees via urn models.
Acta Inf., 2004
Random sprouts as internet models, and Pólya processes.
Acta Inf., 2004
A multivariate view of random bucket digital search trees.
J. Algorithms, 2002
The size of random bucket trees via urn models.
Acta Inf., 2002
A Limit Law for Outputs in Random Recursive Circuits.
Analytic Variations on Bucket Selection and Sorting.
Acta Inf., 2000
On Rotations in Fringe-Balanced Binary Trees.
Inf. Process. Lett., 1998
Probabilistic Analysis of MULTIPLE QUICK SELECT.
Analysis of Boyer-Moore-Horspool string-matching heuristic.
Random Struct. Algorithms, 1997
Storage Overhead of O-Trees, B-Trees and Prefix B-Trees: A Comparative Analysis.
Int. J. Found. Comput. Sci., 1996
Probabilistic Analysis of Bucket Recursive Trees.
Theor. Comput. Sci., 1995
Analysis of Quickselect: An Algorithm for Order Statistics.
The Joint Distribution of the Three Types of Nodes in Uniform Binary Trees.
The Joint Distribution of Elastic Buckets in Multiway Search Trees.
SIAM J. Comput., 1994
On the Structure of Random Plane-oriented Recursive Trees and Their Branches.
Random Struct. Algorithms, 1993
Asymptitic Hoint Normality of Outdegrees of Nodes in Random Recursive Trees.
Random Struct. Algorithms, 1992
Evolution of random search trees.
Wiley-Interscience series in discrete mathematics and optimization, Wiley, ISBN: 978-0-471-53228-6, 1992
Discrete Applied Mathematics, 1991
Analysis of the Space of Search Trees under the Random Insertion Algorithm.
J. Algorithms, 1989
On the joint distribution of the insertion path length and the number of comparisons in search trees.
Discrete Applied Mathematics, 1988
The Expected Distribution of Degrees in Random Binary Search Trees.
Comput. J., 1986
On the Average Internal Path Length of m -ary Search Trees.
Acta Inf., 1986