Filter Results:
- Full text PDF available (17)
Publication Year
1986
2018
- This year (2)
- Last 5 years (5)
- Last 10 years (14)
Publication Type
Co-author
Journals and Conferences
Learn More
- Hosam M. Mahmoud
- 1992
- Qunqiang Feng, Hosam M. Mahmoud, Alois Panholzer
- SIAM J. Discrete Math.
- 2008
Abstract. We study the variety of subtrees lying on the fringe of recursive trees and binary search trees by analyzing the distributional behavior of Xn,k, which counts the number of subtrees of size… (More)
We investigate random distances in a random binary search tree. Two types of random distance are considered: the depth of a node randomly selected from the tree, and distance between randomly… (More)
- Hosam M. Mahmoud, Mark Daniel Ward
- Appl. Math. Lett.
- 2012
Wederive exactmoments of the number of 2-protected nodes in binary search trees grown from random permutations. Furthermore, we show that a properly normalized version of this tree parameter… (More)
- Friedrich Hubalek, Hsien-Kuei Hwang, William Lew, Hosam M. Mahmoud, Helmut Prodinger
- J. Algorithms
- 2002
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitrary memory… (More)
- William Lew, Hosam M. Mahmoud
- SIAM J. Comput.
- 1994
- Hosam M. Mahmoud
- Acta Informatica
- 2004
The Equation (2) in [1] is not exact as claimed. It is only approximate, and there are error terms that seem hard to determine. However, it gives a basis for a good heuristic based on the observation… (More)
We study QUICKSELECT, a one-sided version of QUICKSORT suited for finding the order statistics of a sample. We identify procedures by which the moments of the number of comparisons can be found… (More)