Hosam M. Mahmoud

Publication Activity (10 Years)

Years Active: 1986-2024
Publications (10 Years): 15

Top Topics

Preferential Attachment

Top Venues

J. Appl. Probab.

Int. J. Comput. Math. Comput. Syst. Theory

Adv. Appl. Math.

Publications

Shuyang Gao, Leen Hatem, Hosam M. Mahmoud
Balancing m-ary search trees with compressions on the fringe. Acta Informatica 61 (1) (2024)
Kiran R. Bhutani, Ravi Kalpathy, Hosam M. Mahmoud, Achuna Ofonedu
Some empirical and theoretical attributes of random multi-hooking networks. Int. J. Comput. Math. Comput. Syst. Theory 8 (4) (2023)
Joshua Sparks, Srinivasan Balaji, Hosam M. Mahmoud
The containment profile of hyper-recursive trees. J. Appl. Probab. 59 (1) (2022)
Merritt R. Lyon, Hosam M. Mahmoud
Insertion depth in power-weight trees. Inf. Process. Lett. 176 (2022)
Rafik Aguech, Sudip Bose, Hosam M. Mahmoud, Yi Zhang
Some properties of exponential trees. Int. J. Comput. Math. Comput. Syst. Theory 7 (1) (2022)
Kiran R. Bhutani, Ravi Kalpathy, Hosam M. Mahmoud
Random networks grown by fusing edges via urns. Netw. Sci. 10 (4) (2022)
Arnold T. Saunders, Hosam M. Mahmoud
Bar Bets and Generating Functions: The Distribution of the Separation of Two Distinct Card Ranks. Am. Math. Mon. 128 (3) (2021)
Kiran R. Bhutani, Ravi Kalpathy, Hosam M. Mahmoud
Average measures in polymer graphs. Int. J. Comput. Math. Comput. Syst. Theory 6 (1) (2021)
Merritt R. Lyon, Hosam M. Mahmoud
Trees grown under young-age preferential attachment. J. Appl. Probab. 57 (3) (2020)
Hosam M. Mahmoud
A model for the spreading of fake news. J. Appl. Probab. 57 (1) (2020)
Hosam M. Mahmoud
Local and global degree profiles of randomly grown self-similar hooking networks under uniform and preferential attachment. Adv. Appl. Math. 111 (2019)
Markus Kuba, Hosam M. Mahmoud
Two-color balanced affine urn models with multiple drawings. Adv. Appl. Math. 90 (2017)
Hrishikesh Balaji, Hosam M. Mahmoud
The Gini index of random trees with an application to caterpillars. J. Appl. Probab. 54 (3) (2017)
Sebastian Wild, Markus E. Nebel, Hosam M. Mahmoud
Analysis of Quickselect Under Yaroslavskiy's Dual-Pivoting Algorithm. Algorithmica 74 (1) (2016)
Chen Chen, Hosam M. Mahmoud
Degrees in random self-similar bipolar networks. J. Appl. Probab. 53 (2) (2016)
Hosam M. Mahmoud, Mark Daniel Ward
Asymptotic Properties of Protected Nodes in Random Recursive Trees. J. Appl. Probab. 52 (1) (2015)
Ravi Kalpathy, Hosam M. Mahmoud, Walter Rosenkrantz
Survivors in Leader Election Algorithms. ANALCO (2014)
Ahmed M. Aly, Walid G. Aref, Mourad Ouzzani, Hosam M. Mahmoud
JISC: Adaptive Stream Processing Using Just-In-Time State Completion. EDBT (2014)
Michael Fuchs, Hsien-Kuei Hwang, Yoshiaki Itoh, Hosam M. Mahmoud
A Binomial Splitting Process in Connection with Corner Parking Problems. J. Appl. Probab. 51 (4) (2014)
Markus Kuba, Hosam M. Mahmoud, Alois Panholzer
Analysis of a generalized Friedman's urn with multiple drawings. Discret. Appl. Math. 161 (18) (2013)
Hosam M. Mahmoud
Perpetuities in fair leader election algorithms. ANALCO (2013)
Sebastian Wild, Markus E. Nebel, Hosam M. Mahmoud
Analysis of Quickselect under Yaroslavskiy's Dual-Pivoting Algorithm. CoRR (2013)
Hosam M. Mahmoud, Mark Daniel Ward
Asymptotic distribution of two-protected nodes in random binary search trees. Appl. Math. Lett. 25 (12) (2012)
Basile Morcrette, Hosam M. Mahmoud
Exactly Solvable Balanced Tenable Urns with Random Entries via the Analytic Methodology CoRR (2012)
Sanaa Kholfi, Hosam M. Mahmoud
The Class of Tenable Zero-balanced Polya Urn Schemes: Characterization and Gaussian Phases. ANALCO (2011)
Srinivasan Balaji, Hosam M. Mahmoud
Phases in the Mixing of Gases via the Ehrenfest Urn Model. ANALCO (2010)
Hosam M. Mahmoud
Distributional analysis of swaps in Quick Select. Theor. Comput. Sci. 411 (16-18) (2010)
Hosam M. Mahmoud
Average-case Analysis of Moves in Quick Select. ANALCO (2009)
Qunqiang Feng, Hosam M. Mahmoud, Alois Panholzer
Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees. SIAM J. Discret. Math. 22 (1) (2008)
Amrinder Arora, Fanchun Jin, Gokhan Sahin, Hosam M. Mahmoud, Hyeong-Ah Choi
Throughput analysis in wireless networks with multiple users and multiple channels. Acta Informatica 43 (3) (2006)
Rafik Aguech, Nabil Lasmar, Hosam M. Mahmoud
Distances in random digital search trees. Acta Informatica 43 (4) (2006)
Hosam M. Mahmoud
Random sprouts as internet models, and Pólya processes. Acta Informatica 41 (1) (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 Informatica 41 (2-3) (2004)
Yoshiaki Itoh, Hosam M. Mahmoud, Daisuke Takahashi
A stochastic model for solitons. Random Struct. Algorithms 24 (1) (2004)
Mehri Javanian, Hosam M. Mahmoud, Mohammad Q. Vahidi-Asl
-ary interval trees. Discret. Math. 287 (1-3) (2004)
Hosam M. Mahmoud
Erratum: The size of random bucket trees via urn models. Acta Informatica 41 (1) (2004)
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) (2002)
Hosam M. Mahmoud
The size of random bucket trees via urn models. Acta Informatica 38 (11/12) (2002)
Tatsuie Tsukiji, Hosam M. Mahmoud
A Limit Law for Outputs in Random Recursive Circuits. Algorithmica 31 (3) (2001)
Hosam M. Mahmoud, Philippe Flajolet, Philippe Jacquet, Mireille Régnier
Analytic Variations on Bucket Selection and Sorting. Acta Informatica 36 (9/10) (2000)
Hosam M. Mahmoud, Robert T. Smythe
Probabilistic Analysis of MULTIPLE QUICK SELECT. Algorithmica 22 (4) (1998)
Hosam M. Mahmoud
On Rotations in Fringe-Balanced Binary Trees. Inf. Process. Lett. 65 (1) (1998)
Hosam M. Mahmoud, Robert T. Smythe, Mireille Régnier
Analysis of Boyer-Moore-Horspool string-matching heuristic. Random Struct. Algorithms 10 (1-2) (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) (1996)
Hosam M. Mahmoud, Reza Modarres, Robert T. Smythe
Analysis of Quickselect: An Algorithm for Order Statistics. RAIRO Theor. Informatics Appl. 29 (4) (1995)
Hosam M. Mahmoud, Robert T. Smythe
Probabilistic Analysis of Bucket Recursive Trees. Theor. Comput. Sci. 144 (1&2) (1995)
Hosam M. Mahmoud
The Joint Distribution of the Three Types of Nodes in Uniform Binary Trees. Algorithmica 13 (3) (1995)
William Lew, Hosam M. Mahmoud
The Joint Distribution of Elastic Buckets in Multiway Search Trees. SIAM J. Comput. 23 (5) (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) (1993)
Hosam M. Mahmoud, Robert T. Smythe
Asymptitic Hoint Normality of Outdegrees of Nodes in Random Recursive Trees. Random Struct. Algorithms 3 (3) (1992)
Hosam M. Mahmoud, Boris G. Pittel
Corrigendum. Discret. Appl. Math. 30 (1) (1991)
Hosam M. Mahmoud, Boris G. Pittel
Analysis of the Space of Search Trees under the Random Insertion Algorithm. J. Algorithms 10 (1) (1989)
Hosam M. Mahmoud, Boris G. Pittel
On the joint distribution of the insertion path length and the number of comparisons in search trees. Discret. Appl. Math. 20 (3) (1988)
Hosam M. Mahmoud
The Expected Distribution of Degrees in Random Binary Search Trees. Comput. J. 29 (1) (1986)
Hosam M. Mahmoud
-ary Search Trees. Acta Informatica 23 (1) (1986)