Hosam M. Mahmoud
According to our database^{1},
Hosam M. Mahmoud
authored at least 35 papers
between 1986 and 2015.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:

at home.gwu.edu
On csauthors.net:
Bibliography
2015
Asymptotic Properties of Protected Nodes in Random Recursive Trees.
J. Applied Probability, 2015
2014
JISC: Adaptive Stream Processing Using JustInTime 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
2013
Analysis of a generalized Friedman's urn with multiple drawings.
Discrete Applied Mathematics, 2013
2012
Asymptotic distribution of twoprotected nodes in random binary search trees.
Appl. Math. Lett., 2012
2010
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
2009
Averagecase Analysis of Moves in Quick Select.
Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, 2009
2008
Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees.
SIAM J. Discrete Math., 2008
2006
Distances in random digital search trees.
Acta Inf., 2006
2004
A stochastic model for solitons.
Random Struct. Algorithms, 2004
Paths in mary interval trees.
Discrete Mathematics, 2004
Limit laws for terminal nodes in random circuits with restricted fanout: 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
2002
A multivariate view of random bucket digital search trees.
J. Algorithms, 2002
The size of random bucket trees via urn models.
Acta Inf., 2002
2001
A Limit Law for Outputs in Random Recursive Circuits.
Algorithmica, 2001
2000
Analytic Variations on Bucket Selection and Sorting.
Acta Inf., 2000
1998
On Rotations in FringeBalanced Binary Trees.
Inf. Process. Lett., 1998
Probabilistic Analysis of MULTIPLE QUICK SELECT.
Algorithmica, 1998
1997
Analysis of BoyerMooreHorspool stringmatching heuristic.
Random Struct. Algorithms, 1997
1996
Storage Overhead of OTrees, BTrees and Prefix BTrees: A Comparative Analysis.
Int. J. Found. Comput. Sci., 1996
1995
Probabilistic Analysis of Bucket Recursive Trees.
Theor. Comput. Sci., 1995
Analysis of Quickselect: An Algorithm for Order Statistics.
ITA, 1995
The Joint Distribution of the Three Types of Nodes in Uniform Binary Trees.
Algorithmica, 1995
1994
The Joint Distribution of Elastic Buckets in Multiway Search Trees.
SIAM J. Comput., 1994
1993
On the Structure of Random Planeoriented Recursive Trees and Their Branches.
Random Struct. Algorithms, 1993
1992
Asymptitic Hoint Normality of Outdegrees of Nodes in Random Recursive Trees.
Random Struct. Algorithms, 1992
Evolution of random search trees.
WileyInterscience series in discrete mathematics and optimization, Wiley, ISBN: 9780471532286, 1992
1991
Corrigendum.
Discrete Applied Mathematics, 1991
1989
Analysis of the Space of Search Trees under the Random Insertion Algorithm.
J. Algorithms, 1989
1988
On the joint distribution of the insertion path length and the number of comparisons in search trees.
Discrete Applied Mathematics, 1988
1986
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