Hosam M. Mahmoud

60 papers B 1Journal 53Unranked 5

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Exponentially preferential trees. Netw. Sci. Rafik Aguech, Hosam M. Mahmoud, Hanene Mohamed, Zhou Yang
2025	J	`jnl`	On affine multicolor urns grown under multiple drawing. J. Appl. Probab. Joshua Sparks, Markus Kuba, Srinivasan Balaji, Hosam M. Mahmoud
2025	J	`jnl`	Probabilistic analysis of arithmetic coding showing its robustness. CoRR Hosam M. Mahmoud, Hans J. Rivertz
2024	J	`jnl`	Balancing m-ary search trees with compressions on the fringe. Acta Informatica Shuyang Gao, Leen Hatem, Hosam M. Mahmoud
2023	J	`jnl`	Degrees in random m-ary hooking networks. Compositionality Kiran R. Bhutani, Ravi Kalpathy, Hosam M. Mahmoud
2023	J	`jnl`	Some empirical and theoretical attributes of random multi-hooking networks. Int. J. Comput. Math. Comput. Syst. Theory Kiran R. Bhutani, Ravi Kalpathy, Hosam M. Mahmoud, Achuna Ofonedu
2022	J	`jnl`	Insertion depth in power-weight trees. Inf. Process. Lett. Merritt R. Lyon, Hosam M. Mahmoud
2022	J	`jnl`	Random networks grown by fusing edges via urns. Netw. Sci. Kiran R. Bhutani, Ravi Kalpathy, Hosam M. Mahmoud
2022	J	`jnl`	Some properties of exponential trees. Int. J. Comput. Math. Comput. Syst. Theory Rafik Aguech, Sudip Bose, Hosam M. Mahmoud, Yi Zhang
2022	J	`jnl`	The containment profile of hyper-recursive trees. J. Appl. Probab. Joshua Sparks, Srinivasan Balaji, Hosam M. Mahmoud
2021	J	`jnl`	Average measures in polymer graphs. Int. J. Comput. Math. Comput. Syst. Theory Kiran R. Bhutani, Ravi Kalpathy, Hosam M. Mahmoud
2021	J	`jnl`	Bar Bets and Generating Functions: The Distribution of the Separation of Two Distinct Card Ranks. Am. Math. Mon. Arnold T. Saunders, Hosam M. Mahmoud
2020	J	`jnl`	A model for the spreading of fake news. J. Appl. Probab. Hosam M. Mahmoud
2020	J	`jnl`	Trees grown under young-age preferential attachment. J. Appl. Probab. Merritt R. Lyon, Hosam M. Mahmoud
2019	J	`jnl`	Local and global degree profiles of randomly grown self-similar hooking networks under uniform and preferential attachment. Adv. Appl. Math. Hosam M. Mahmoud
2017	J	`jnl`	The Gini index of random trees with an application to caterpillars. J. Appl. Probab. Hrishikesh Balaji, Hosam M. Mahmoud
2017	J	`jnl`	Two-color balanced affine urn models with multiple drawings. Adv. Appl. Math. Markus Kuba, Hosam M. Mahmoud
2016	J	`jnl`	Analysis of Quickselect Under Yaroslavskiy's Dual-Pivoting Algorithm. Algorithmica Sebastian Wild, Markus E. Nebel, Hosam M. Mahmoud
2016	J	`jnl`	Degrees in random self-similar bipolar networks. J. Appl. Probab. Chen Chen, Hosam M. Mahmoud
2015	J	`jnl`	Asymptotic Properties of Protected Nodes in Random Recursive Trees. J. Appl. Probab. Hosam M. Mahmoud, Mark Daniel Ward
2014	J	`jnl`	A Binomial Splitting Process in Connection with Corner Parking Problems. J. Appl. Probab. Michael Fuchs, Hsien-Kuei Hwang, Yoshiaki Itoh, Hosam M. Mahmoud
2014	B	`conf`	JISC: Adaptive Stream Processing Using Just-In-Time State Completion. EDBT Ahmed M. Aly, Walid G. Aref, Mourad Ouzzani, Hosam M. Mahmoud
2014	—	`conf`	Survivors in Leader Election Algorithms. ANALCO Ravi Kalpathy, Hosam M. Mahmoud, Walter Rosenkrantz
2013	J	`jnl`	Analysis of Quickselect under Yaroslavskiy's Dual-Pivoting Algorithm. CoRR Sebastian Wild, Markus E. Nebel, Hosam M. Mahmoud
2013	J	`jnl`	Analysis of a generalized Friedman's urn with multiple drawings. Discret. Appl. Math. Markus Kuba, Hosam M. Mahmoud, Alois Panholzer
2013	—	`conf`	Perpetuities in fair leader election algorithms. ANALCO Hosam M. Mahmoud
2012	J	`jnl`	Asymptotic distribution of two-protected nodes in random binary search trees. Appl. Math. Lett. Hosam M. Mahmoud, Mark Daniel Ward
2012	J	`jnl`	Exactly Solvable Balanced Tenable Urns with Random Entries via the Analytic Methodology CoRR Basile Morcrette, Hosam M. Mahmoud
2011	—	`conf`	The Class of Tenable Zero-balanced Polya Urn Schemes: Characterization and Gaussian Phases. ANALCO Sanaa Kholfi, Hosam M. Mahmoud
2010	J	`jnl`	Distributional analysis of swaps in Quick Select. Theor. Comput. Sci. Hosam M. Mahmoud
2010	—	`conf`	Phases in the Mixing of Gases via the Ehrenfest Urn Model. ANALCO Srinivasan Balaji, Hosam M. Mahmoud
2009	—	`conf`	Average-case Analysis of Moves in Quick Select. ANALCO Hosam M. Mahmoud
2008	J	`jnl`	Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees. SIAM J. Discret. Math. Qunqiang Feng, Hosam M. Mahmoud, Alois Panholzer
2006	J	`jnl`	Distances in random digital search trees. Acta Informatica Rafik Aguech, Nabil Lasmar, Hosam M. Mahmoud
2006	J	`jnl`	Throughput analysis in wireless networks with multiple users and multiple channels. Acta Informatica Amrinder Arora, Fanchun Jin, Gokhan Sahin, Hosam M. Mahmoud, Hyeong-Ah Choi
2004	J	`jnl`	A stochastic model for solitons. Random Struct. Algorithms Yoshiaki Itoh, Hosam M. Mahmoud, Daisuke Takahashi
2004	J	`jnl`	Erratum: The size of random bucket trees via urn models. Acta Informatica Hosam M. Mahmoud
2004	J	`jnl`	Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees. Acta Informatica Hosam M. Mahmoud, Tatsuie Tsukiji
2004	J	`jnl`	Paths in Discret. Math. Mehri Javanian, Hosam M. Mahmoud, Mohammad Q. Vahidi-Asl
2004	J	`jnl`	Random sprouts as internet models, and Pólya processes. Acta Informatica Hosam M. Mahmoud
2002	J	`jnl`	A multivariate view of random bucket digital search trees. J. Algorithms Friedrich Hubalek, Hsien-Kuei Hwang, William Lew, Hosam M. Mahmoud, Helmut Prodinger
2002	J	`jnl`	The size of random bucket trees via urn models. Acta Informatica Hosam M. Mahmoud
2001	J	`jnl`	A Limit Law for Outputs in Random Recursive Circuits. Algorithmica Tatsuie Tsukiji, Hosam M. Mahmoud
2000	J	`jnl`	Analytic Variations on Bucket Selection and Sorting. Acta Informatica Hosam M. Mahmoud, Philippe Flajolet, Philippe Jacquet, Mireille Régnier
1998	J	`jnl`	On Rotations in Fringe-Balanced Binary Trees. Inf. Process. Lett. Hosam M. Mahmoud
1998	J	`jnl`	Probabilistic Analysis of MULTIPLE QUICK SELECT. Algorithmica Hosam M. Mahmoud, Robert T. Smythe
1997	J	`jnl`	Analysis of Boyer-Moore-Horspool string-matching heuristic. Random Struct. Algorithms Hosam M. Mahmoud, Robert T. Smythe, Mireille Régnier
1996	J	`jnl`	Storage Overhead of O-Trees, B-Trees and Prefix B-Trees: A Comparative Analysis. Int. J. Found. Comput. Sci. Ratko Orlandic, Hosam M. Mahmoud
1995	J	`jnl`	Analysis of Quickselect: An Algorithm for Order Statistics. RAIRO Theor. Informatics Appl. Hosam M. Mahmoud, Reza Modarres, Robert T. Smythe
1995	J	`jnl`	Probabilistic Analysis of Bucket Recursive Trees. Theor. Comput. Sci. Hosam M. Mahmoud, Robert T. Smythe
1995	J	`jnl`	The Joint Distribution of the Three Types of Nodes in Uniform Binary Trees. Algorithmica Hosam M. Mahmoud
1994	J	`jnl`	The Joint Distribution of Elastic Buckets in Multiway Search Trees. SIAM J. Comput. William Lew, Hosam M. Mahmoud
1993	J	`jnl`	On the Structure of Random Plane-oriented Recursive Trees and Their Branches. Random Struct. Algorithms Hosam M. Mahmoud, Robert T. Smythe, Jerzy Szymanski
1992	J	`jnl`	Asymptitic Hoint Normality of Outdegrees of Nodes in Random Recursive Trees. Random Struct. Algorithms Hosam M. Mahmoud, Robert T. Smythe
1992	—	`book`	Evolution of random search trees. Hosam M. Mahmoud
1991	J	`jnl`	Corrigendum. Discret. Appl. Math. Hosam M. Mahmoud, Boris G. Pittel
1989	J	`jnl`	Analysis of the Space of Search Trees under the Random Insertion Algorithm. J. Algorithms Hosam M. Mahmoud, Boris G. Pittel
1988	J	`jnl`	On the joint distribution of the insertion path length and the number of comparisons in search trees. Discret. Appl. Math. Hosam M. Mahmoud, Boris G. Pittel
1986	J	`jnl`	On the Average Internal Path Length of Acta Informatica Hosam M. Mahmoud
1986	J	`jnl`	The Expected Distribution of Degrees in Random Binary Search Trees. Comput. J. Hosam M. Mahmoud