2008 |
26 | EE | Qunqiang Feng,
Hosam M. Mahmoud,
Alois Panholzer:
Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees.
SIAM J. Discrete Math. 22(1): 160-184 (2008) |
2006 |
25 | EE | Rafik Aguech,
Nabil Lasmar,
Hosam M. Mahmoud:
Distances in random digital search trees.
Acta Inf. 43(4): 243-264 (2006) |
2004 |
24 | EE | Hosam M. Mahmoud:
Random sprouts as internet models, and Pólya processes.
Acta Inf. 41(1): 1-18 (2004) |
23 | EE | Hosam M. Mahmoud:
Erratum: The size of random bucket trees via urn models.
Acta Inf. 41(1): 63 (2004) |
22 | EE | Hosam M. Mahmoud,
Tatsuie Tsukiji:
Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees.
Acta Inf. 41(2-3): 99-110 (2004) |
21 | EE | Mehri Javanian,
Hosam M. Mahmoud,
Mohammad Vahidi-Asl:
Paths in m-ary interval trees.
Discrete Mathematics 287(1-3): 45-53 (2004) |
20 | EE | Yoshiaki Itoh,
Hosam M. Mahmoud,
Daisuke Takahashi:
A stochastic model for solitons.
Random Struct. Algorithms 24(1): 51-64 (2004) |
2002 |
19 | EE | Hosam M. Mahmoud:
The size of random bucket trees via urn models.
Acta Inf. 38(11/12): 813-838 (2002) |
18 | EE | Friedrich Hubalek,
Hsien-Kuei Hwang,
William Lew,
Hosam M. Mahmoud,
Helmut Prodinger:
A multivariate view of random bucket digital search trees.
J. Algorithms 44(1): 121-158 (2002) |
2001 |
17 | EE | Tatsuie Tsukiji,
Hosam M. Mahmoud:
A Limit Law for Outputs in Random Recursive Circuits.
Algorithmica 31(3): 403-412 (2001) |
2000 |
16 | EE | Hosam M. Mahmoud,
Philippe Flajolet,
Philippe Jacquet,
Mireille Régnier:
Analytic Variations on Bucket Selection and Sorting.
Acta Inf. 36(9/10): 735-760 (2000) |
1998 |
15 | EE | Hosam M. Mahmoud,
Robert T. Smythe:
Probabilistic Analysis of MULTIPLE QUICK SELECT.
Algorithmica 22(4): 569-584 (1998) |
14 | EE | Hosam M. Mahmoud:
On Rotations in Fringe-Balanced Binary Trees.
Inf. Process. Lett. 65(1): 41-46 (1998) |
1997 |
13 | | Hosam M. Mahmoud,
Robert T. Smythe,
Mireille Régnier:
Analysis of Boyer-Moore-Horspool string-matching heuristic.
Random Struct. Algorithms 10(1-2): 169-186 (1997) |
1996 |
12 | | Ratko Orlandic,
Hosam M. Mahmoud:
Storage Overhead of O-Trees, B-Trees and Prefix B-Trees: A Comparative Analysis.
Int. J. Found. Comput. Sci. 7(3): 209-226 (1996) |
1995 |
11 | | Hosam M. Mahmoud:
The Joint Distribution of the Three Types of Nodes in Uniform Binary Trees.
Algorithmica 13(3): 313-323 (1995) |
10 | | Hosam M. Mahmoud,
Reza Modarres,
Robert T. Smythe:
Analysis of Quickselect: An Algorithm for Order Statistics.
ITA 29(4): 255-276 (1995) |
9 | EE | Hosam M. Mahmoud,
Robert T. Smythe:
Probabilistic Analysis of Bucket Recursive Trees.
Theor. Comput. Sci. 144(1&2): 221-249 (1995) |
1994 |
8 | | William Lew,
Hosam M. Mahmoud:
The Joint Distribution of Elastic Buckets in Multiway Search Trees.
SIAM J. Comput. 23(5): 1050-1074 (1994) |
1993 |
7 | | Hosam M. Mahmoud,
Robert T. Smythe,
Jerzy Szymanski:
On the Structure of Random Plane-oriented Recursive Trees and Their Branches.
Random Struct. Algorithms 4(2): 151-176 (1993) |
1992 |
6 | | Hosam M. Mahmoud,
Robert T. Smythe:
Asymptitic Hoint Normality of Outdegrees of Nodes in Random Recursive Trees.
Random Struct. Algorithms 3(3): 255-266 (1992) |
1991 |
5 | EE | Hosam M. Mahmoud,
Boris Pittel:
Corrigendum.
Discrete Applied Mathematics 30(1): 91 (1991) |
1989 |
4 | | Hosam M. Mahmoud,
Boris Pittel:
Analysis of the Space of Search Trees under the Random Insertion Algorithm.
J. Algorithms 10(1): 52-75 (1989) |
1988 |
3 | EE | Hosam M. Mahmoud,
Boris Pittel:
On the joint distribution of the insertion path length and the number of comparisons in search trees.
Discrete Applied Mathematics 20(3): 243-251 (1988) |
1986 |
2 | | Hosam M. Mahmoud:
On the Average Internal Path Length of m -ary Search Trees.
Acta Inf. 23(1): 111-117 (1986) |
1 | | Hosam M. Mahmoud:
The Expected Distribution of Degrees in Random Binary Search Trees.
Comput. J. 29(1): 36-37 (1986) |