On the Average Internal Path Length of m -ary Search Trees. - Hosam M. Mahmoud (Acta Informatica, 1986)

The Expected Distribution of Degrees in Random Binary Search Trees. - Hosam M. Mahmoud (Comput. J., 1986)

On the joint distribution of the insertion path length and the number of comparisons in search trees. - Hosam M. Mahmoud; Boris G. Pittel (Discret. Appl. Math., 1988)

Analysis of the Space of Search Trees under the Random Insertion Algorithm. - Hosam M. Mahmoud; Boris G. Pittel (J. Algorithms, 1989)

Corrigendum. - Hosam M. Mahmoud; Boris G. Pittel (Discret. Appl. Math., 1991)

Evolution of random search trees. - Hosam M. Mahmoud (Wiley, 1992)

Asymptitic Hoint Normality of Outdegrees of Nodes in Random Recursive Trees. - Hosam M. Mahmoud; Robert T. Smythe (Random Struct. Algorithms, 1992)

On the Structure of Random Plane-oriented Recursive Trees and Their Branches. - Hosam M. Mahmoud; Robert T. Smythe; Jerzy Szymanski (Random Struct. Algorithms, 1993)

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

The Joint Distribution of the Three Types of Nodes in Uniform Binary Trees. - Hosam M. Mahmoud (Algorithmica, 1995)

Analysis of Quickselect: An Algorithm for Order Statistics. - Hosam M. Mahmoud; Reza Modarres; Robert T. Smythe (RAIRO Theor. Informatics Appl., 1995)

Probabilistic Analysis of Bucket Recursive Trees. - Hosam M. Mahmoud; Robert T. Smythe (Theor. Comput. Sci., 1995)

Storage Overhead of O-Trees, B-Trees and Prefix B-Trees: A Comparative Analysis. - Ratko Orlandic; Hosam M. Mahmoud (Int. J. Found. Comput. Sci., 1996)

Analysis of Boyer-Moore-Horspool string-matching heuristic. - Hosam M. Mahmoud; Robert T. Smythe; Mireille Régnier (Random Struct. Algorithms, 1997)

Probabilistic Analysis of MULTIPLE QUICK SELECT. - Hosam M. Mahmoud; Robert T. Smythe (Algorithmica, 1998)

On Rotations in Fringe-Balanced Binary Trees. - Hosam M. Mahmoud (Inf. Process. Lett., 1998)

Analytic Variations on Bucket Selection and Sorting. - Hosam M. Mahmoud; Philippe Flajolet; Philippe Jacquet; Mireille Régnier (Acta Informatica, 2000)

A Limit Law for Outputs in Random Recursive Circuits. - Tatsuie Tsukiji; Hosam M. Mahmoud (Algorithmica, 2001)

The size of random bucket trees via urn models. - Hosam M. Mahmoud (Acta Informatica, 2002)

A multivariate view of random bucket digital search trees. - Friedrich Hubalek; Hsien-Kuei Hwang; William Lew; Hosam M. Mahmoud; Helmut Prodinger (J. Algorithms, 2002)

Random sprouts as internet models, and Pólya processes. - Hosam M. Mahmoud (Acta Informatica, 2004)

Erratum: The size of random bucket trees via urn models. - Hosam M. Mahmoud (Acta Informatica, 2004)

Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees. - Hosam M. Mahmoud; Tatsuie Tsukiji (Acta Informatica, 2004)

Paths in m-ary interval trees. - Mehri Javanian; Hosam M. Mahmoud; Mohammad Q. Vahidi-Asl (Discret. Math., 2004)

A stochastic model for solitons. - Yoshiaki Itoh 002; Hosam M. Mahmoud; Daisuke Takahashi (Random Struct. Algorithms, 2004)

Distances in random digital search trees. - Rafik Aguech; Nabil Lasmar; Hosam M. Mahmoud (Acta Informatica, 2006)

Throughput analysis in wireless networks with multiple users and multiple channels. - Amrinder Arora; Fanchun Jin; Gokhan Sahin; Hosam M. Mahmoud; Hyeong-Ah Choi (Acta Informatica, 2006)

Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees. - Qunqiang Feng; Hosam M. Mahmoud; Alois Panholzer (SIAM J. Discret. Math., 2008)

Average-case Analysis of Moves in Quick Select. - Hosam M. Mahmoud (ANALCO, 2009)

Phases in the Mixing of Gases via the Ehrenfest Urn Model. - Srinivasan Balaji; Hosam M. Mahmoud (ANALCO, 2010)

Distributional analysis of swaps in Quick Select. - Hosam M. Mahmoud (Theor. Comput. Sci., 2010)

The Class of Tenable Zero-balanced Polya Urn Schemes: Characterization and Gaussian Phases. - Sanaa Kholfi; Hosam M. Mahmoud (ANALCO, 2011)

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

Exactly Solvable Balanced Tenable Urns with Random Entries via the Analytic Methodology - Basile Morcrette; Hosam M. Mahmoud (CoRR, 2012)

Perpetuities in fair leader election algorithms. - Hosam M. Mahmoud (ANALCO, 2013)

Analysis of a generalized Friedman's urn with multiple drawings. - Markus Kuba; Hosam M. Mahmoud; Alois Panholzer (Discret. Appl. Math., 2013)

Survivors in Leader Election Algorithms. - Ravi Kalpathy; Hosam M. Mahmoud; Walter Rosenkrantz (ANALCO, 2014)

JISC: Adaptive Stream Processing Using Just-In-Time State Completion. - Ahmed M. Aly; Walid G. Aref; Mourad Ouzzani; Hosam M. Mahmoud (EDBT, 2014)

A Binomial Splitting Process in Connection with Corner Parking Problems. - Michael Fuchs 001; Hsien-Kuei Hwang; Yoshiaki Itoh 002; Hosam M. Mahmoud (J. Appl. Probab., 2014)

Asymptotic Properties of Protected Nodes in Random Recursive Trees. - Hosam M. Mahmoud; Mark Daniel Ward (J. Appl. Probab., 2015)

Analysis of Quickselect Under Yaroslavskiy's Dual-Pivoting Algorithm. - Sebastian Wild; Markus E. Nebel; Hosam M. Mahmoud (Algorithmica, 2016)

Degrees in random self-similar bipolar networks. - Chen Chen; Hosam M. Mahmoud (J. Appl. Probab., 2016)

Two-color balanced affine urn models with multiple drawings. - Markus Kuba; Hosam M. Mahmoud (Adv. Appl. Math., 2017)

The Gini index of random trees with an application to caterpillars. - Hrishikesh Balaji; Hosam M. Mahmoud (J. Appl. Probab., 2017)

Local and global degree profiles of randomly grown self-similar hooking networks under uniform and preferential attachment. - Hosam M. Mahmoud (Adv. Appl. Math., 2019)

Trees grown under young-age preferential attachment. - Merritt R. Lyon; Hosam M. Mahmoud (J. Appl. Probab., 2020)

A model for the spreading of fake news. - Hosam M. Mahmoud (J. Appl. Probab., 2020)

Average measures in polymer graphs. - Kiran R. Bhutani; Ravi Kalpathy; Hosam M. Mahmoud (Int. J. Comput. Math. Comput. Syst. Theory, 2021)

Bar Bets and Generating Functions: The Distribution of the Separation of Two Distinct Card Ranks. - Arnold T. Saunders; Hosam M. Mahmoud (Am. Math. Mon., 2021)

Some properties of exponential trees. - Rafik Aguech; Sudip Bose; Hosam M. Mahmoud; Yi Zhang (Int. J. Comput. Math. Comput. Syst. Theory, 2022)

Insertion depth in power-weight trees. - Merritt R. Lyon; Hosam M. Mahmoud (Inf. Process. Lett., 2022)

The containment profile of hyper-recursive trees. - Joshua Sparks; Srinivasan Balaji; Hosam M. Mahmoud (J. Appl. Probab., 2022)

Random networks grown by fusing edges via urns. - Kiran R. Bhutani; Ravi Kalpathy; Hosam M. Mahmoud (Netw. Sci., 2022)

Degrees in random m-ary hooking networks. - Kiran R. Bhutani; Ravi Kalpathy; Hosam M. Mahmoud (Compositionality, 2023)

Some empirical and theoretical attributes of random multi-hooking networks. - Kiran R. Bhutani; Ravi Kalpathy; Hosam M. Mahmoud; Achuna Ofonedu (Int. J. Comput. Math. Comput. Syst. Theory, 2023)

Balancing m-ary search trees with compressions on the fringe. - Shuyang Gao; Leen Hatem; Hosam M. Mahmoud (Acta Informatica, 2024)

On affine multicolor urns grown under multiple drawing. - Joshua Sparks; Markus Kuba; Srinivasan Balaji; Hosam M. Mahmoud (J. Appl. Probab., 2025)

Exponentially preferential trees. - Rafik Aguech; Hosam M. Mahmoud; Hanene Mohamed; Zhou Yang (Netw. Sci., 2025)

Probabilistic analysis of arithmetic coding showing its robustness. - Hosam M. Mahmoud; Hans J. Rivertz (CoRR, 2025)