Hosam M. Mahmoud

Hosam M. Mahmoud, Mark Daniel Ward: Asymptotic distribution of two-protected nodes in random binary search trees. Appl. Math. Lett. 25(12): 2218-2222 (2012)

Basile Morcrette, Hosam M. Mahmoud: Exactly Solvable Balanced Tenable Urns with Random Entries via the Analytic Methodology. CoRR abs/1207.4948 (2012)

Hosam M. Mahmoud: Distributional analysis of swaps in Quick Select. Theor. Comput. Sci. 411(16-18): 1763-1769 (2010)

Srinivasan Balaji, Hosam M. Mahmoud: Phases in the Mixing of Gases via the Ehrenfest Urn Model. ANALCO 2010: 9-17

Hosam M. Mahmoud: Average-case Analysis of Moves in Quick Select. ANALCO 2009: 35-40

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)

Rafik Aguech, Nabil Lasmar, Hosam M. Mahmoud: Distances in random digital search trees. Acta Inf. 43(4): 243-264 (2006)

Hosam M. Mahmoud: Random sprouts as internet models, and Pólya processes. Acta Inf. 41(1): 1-18 (2004)

Hosam M. Mahmoud: Erratum: The size of random bucket trees via urn models. Acta Inf. 41(1): 63 (2004)

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)

Mehri Javanian, Hosam M. Mahmoud, Mohammad Vahidi-Asl: Paths in m-ary interval trees. Discrete Mathematics 287(1-3): 45-53 (2004)

Yoshiaki Itoh, Hosam M. Mahmoud, Daisuke Takahashi: A stochastic model for solitons. Random Struct. Algorithms 24(1): 51-64 (2004)

Hosam M. Mahmoud: The size of random bucket trees via urn models. Acta Inf. 38(11/12): 813-838 (2002)

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)

Tatsuie Tsukiji, Hosam M. Mahmoud: A Limit Law for Outputs in Random Recursive Circuits. Algorithmica 31(3): 403-412 (2001)

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)

Hosam M. Mahmoud, Robert T. Smythe: Probabilistic Analysis of MULTIPLE QUICK SELECT. Algorithmica 22(4): 569-584 (1998)

Hosam M. Mahmoud: On Rotations in Fringe-Balanced Binary Trees. Inf. Process. Lett. 65(1): 41-46 (1998)

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)

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)

Hosam M. Mahmoud: The Joint Distribution of the Three Types of Nodes in Uniform Binary Trees. Algorithmica 13(3): 313-323 (1995)

Hosam M. Mahmoud, Reza Modarres, Robert T. Smythe: Analysis of Quickselect: An Algorithm for Order Statistics. ITA 29(4): 255-276 (1995)

Hosam M. Mahmoud, Robert T. Smythe: Probabilistic Analysis of Bucket Recursive Trees. Theor. Comput. Sci. 144(1&2): 221-249 (1995)

William Lew, Hosam M. Mahmoud: The Joint Distribution of Elastic Buckets in Multiway Search Trees. SIAM J. Comput. 23(5): 1050-1074 (1994)

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)

Hosam M. Mahmoud: Evolution of random search trees. Wiley-Interscience series in discrete mathematics and optimization, Wiley 1992, isbn 978-0-471-53228-6, pp. I-X, 1-324

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)

Hosam M. Mahmoud, Boris Pittel: Corrigendum. Discrete Applied Mathematics 30(1): 91 (1991)

Hosam M. Mahmoud, Boris Pittel: Analysis of the Space of Search Trees under the Random Insertion Algorithm. J. Algorithms 10(1): 52-75 (1989)

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)

Hosam M. Mahmoud: On the Average Internal Path Length of m -ary Search Trees. Acta Inf. 23(1): 111-117 (1986)

Hosam M. Mahmoud: The Expected Distribution of Degrees in Random Binary Search Trees. Comput. J. 29(1): 36-37 (1986)