default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHosam M. Mahmoud
Person information
- affiliation: George Washington University, Washington, D.C., USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j47]Shuyang Gao, Leen Hatem, Hosam M. Mahmoud:
Balancing m-ary search trees with compressions on the fringe. Acta Informatica 61(1): 53-66 (2024)- 2023
- [j46]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): 222-234 (2023) - 2022
- [j45]Rafik Aguech, Sudip Bose, Hosam M. Mahmoud, Yi Zhang:
Some properties of exponential trees. Int. J. Comput. Math. Comput. Syst. Theory 7(1): 16-32 (2022) - [j44]Merritt R. Lyon, Hosam M. Mahmoud:
Insertion depth in power-weight trees. Inf. Process. Lett. 176: 106227 (2022) - [j43]Joshua Sparks, Srinivasan Balaji, Hosam M. Mahmoud:
The containment profile of hyper-recursive trees. J. Appl. Probab. 59(1): 278-296 (2022) - [j42]Kiran R. Bhutani, Ravi Kalpathy, Hosam M. Mahmoud:
Random networks grown by fusing edges via urns. Netw. Sci. 10(4): 347-360 (2022) - 2021
- [j41]Kiran R. Bhutani, Ravi Kalpathy, Hosam M. Mahmoud:
Average measures in polymer graphs. Int. J. Comput. Math. Comput. Syst. Theory 6(1): 37-53 (2021) - [j40]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): 258-264 (2021) - 2020
- [j39]Hosam M. Mahmoud:
A model for the spreading of fake news. J. Appl. Probab. 57(1): 332-342 (2020) - [j38]Merritt R. Lyon, Hosam M. Mahmoud:
Trees grown under young-age preferential attachment. J. Appl. Probab. 57(3): 911-927 (2020)
2010 – 2019
- 2019
- [j37]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) - 2017
- [j36]Markus Kuba, Hosam M. Mahmoud:
Two-color balanced affine urn models with multiple drawings. Adv. Appl. Math. 90: 1-26 (2017) - [j35]Hrishikesh Balaji, Hosam M. Mahmoud:
The Gini index of random trees with an application to caterpillars. J. Appl. Probab. 54(3): 701-709 (2017) - 2016
- [j34]Sebastian Wild, Markus E. Nebel, Hosam M. Mahmoud:
Analysis of Quickselect Under Yaroslavskiy's Dual-Pivoting Algorithm. Algorithmica 74(1): 485-506 (2016) - [j33]Chen Chen, Hosam M. Mahmoud:
Degrees in random self-similar bipolar networks. J. Appl. Probab. 53(2): 434-447 (2016) - 2015
- [j32]Hosam M. Mahmoud, Mark Daniel Ward:
Asymptotic Properties of Protected Nodes in Random Recursive Trees. J. Appl. Probab. 52(1): 290-297 (2015) - 2014
- [j31]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): 971-989 (2014) - [c6]Ravi Kalpathy, Hosam M. Mahmoud, Walter Rosenkrantz:
Survivors in Leader Election Algorithms. ANALCO 2014: 113-120 - [c5]Ahmed M. Aly, Walid G. Aref, Mourad Ouzzani, Hosam M. Mahmoud:
JISC: Adaptive Stream Processing Using Just-In-Time State Completion. EDBT 2014: 73-84 - 2013
- [j30]Markus Kuba, Hosam M. Mahmoud, Alois Panholzer:
Analysis of a generalized Friedman's urn with multiple drawings. Discret. Appl. Math. 161(18): 2968-2984 (2013) - [c4]Hosam M. Mahmoud:
Perpetuities in fair leader election algorithms. ANALCO 2013: 62-71 - [i2]Sebastian Wild, Markus E. Nebel, Hosam M. Mahmoud:
Analysis of Quickselect under Yaroslavskiy's Dual-Pivoting Algorithm. CoRR abs/1306.3819 (2013) - 2012
- [j29]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) - [i1]Basile Morcrette, Hosam M. Mahmoud:
Exactly Solvable Balanced Tenable Urns with Random Entries via the Analytic Methodology. CoRR abs/1207.4948 (2012) - 2011
- [c3]Sanaa Kholfi, Hosam M. Mahmoud:
The Class of Tenable Zero-balanced Polya Urn Schemes: Characterization and Gaussian Phases. ANALCO 2011: 117-126 - 2010
- [j28]Hosam M. Mahmoud:
Distributional analysis of swaps in Quick Select. Theor. Comput. Sci. 411(16-18): 1763-1769 (2010) - [c2]Srinivasan Balaji, Hosam M. Mahmoud:
Phases in the Mixing of Gases via the Ehrenfest Urn Model. ANALCO 2010: 9-17
2000 – 2009
- 2009
- [c1]Hosam M. Mahmoud:
Average-case Analysis of Moves in Quick Select. ANALCO 2009: 35-40 - 2008
- [j27]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): 160-184 (2008) - 2006
- [j26]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): 147-164 (2006) - [j25]Rafik Aguech, Nabil Lasmar, Hosam M. Mahmoud:
Distances in random digital search trees. Acta Informatica 43(4): 243-264 (2006) - 2004
- [j24]Hosam M. Mahmoud:
Random sprouts as internet models, and Pólya processes. Acta Informatica 41(1): 1-18 (2004) - [j23]Hosam M. Mahmoud:
Erratum: The size of random bucket trees via urn models. Acta Informatica 41(1): 63 (2004) - [j22]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): 99-110 (2004) - [j21]Mehri Javanian, Hosam M. Mahmoud, Mohammad Q. Vahidi-Asl:
Paths in m-ary interval trees. Discret. Math. 287(1-3): 45-53 (2004) - [j20]Yoshiaki Itoh, Hosam M. Mahmoud, Daisuke Takahashi:
A stochastic model for solitons. Random Struct. Algorithms 24(1): 51-64 (2004) - 2002
- [j19]Hosam M. Mahmoud:
The size of random bucket trees via urn models. Acta Informatica 38(11/12): 813-838 (2002) - [j18]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
- [j17]Tatsuie Tsukiji, Hosam M. Mahmoud:
A Limit Law for Outputs in Random Recursive Circuits. Algorithmica 31(3): 403-412 (2001) - 2000
- [j16]Hosam M. Mahmoud, Philippe Flajolet, Philippe Jacquet, Mireille Régnier:
Analytic Variations on Bucket Selection and Sorting. Acta Informatica 36(9/10): 735-760 (2000)
1990 – 1999
- 1998
- [j15]Hosam M. Mahmoud, Robert T. Smythe:
Probabilistic Analysis of MULTIPLE QUICK SELECT. Algorithmica 22(4): 569-584 (1998) - [j14]Hosam M. Mahmoud:
On Rotations in Fringe-Balanced Binary Trees. Inf. Process. Lett. 65(1): 41-46 (1998) - 1997
- [j13]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
- [j12]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
- [j11]Hosam M. Mahmoud:
The Joint Distribution of the Three Types of Nodes in Uniform Binary Trees. Algorithmica 13(3): 313-323 (1995) - [j10]Hosam M. Mahmoud, Reza Modarres, Robert T. Smythe:
Analysis of Quickselect: An Algorithm for Order Statistics. RAIRO Theor. Informatics Appl. 29(4): 255-276 (1995) - [j9]Hosam M. Mahmoud, Robert T. Smythe:
Probabilistic Analysis of Bucket Recursive Trees. Theor. Comput. Sci. 144(1&2): 221-249 (1995) - 1994
- [j8]William Lew, Hosam M. Mahmoud:
The Joint Distribution of Elastic Buckets in Multiway Search Trees. SIAM J. Comput. 23(5): 1050-1074 (1994) - 1993
- [j7]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
- [b1]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 - [j6]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
- [j5]Hosam M. Mahmoud, Boris G. Pittel:
Corrigendum. Discret. Appl. Math. 30(1): 91 (1991)
1980 – 1989
- 1989
- [j4]Hosam M. Mahmoud, Boris G. Pittel:
Analysis of the Space of Search Trees under the Random Insertion Algorithm. J. Algorithms 10(1): 52-75 (1989) - 1988
- [j3]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): 243-251 (1988) - 1986
- [j2]Hosam M. Mahmoud:
On the Average Internal Path Length of m -ary Search Trees. Acta Informatica 23(1): 111-117 (1986) - [j1]Hosam M. Mahmoud:
The Expected Distribution of Degrees in Random Binary Search Trees. Comput. J. 29(1): 36-37 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
