Hosam M. Mahmoud - Citegraph

Author Info

Name	Affiliation	Papers
HOSAM M. MAHMOUD	Department of Statistics, The George Washington University, Washington, DC 20052, USA	34
Collaborators	Citations	PageRank
25	183	55.63
Referers	Referees	References
151	150	147

Search Limit

100151

Publications (34 rows)

Collaborators (25 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
The containment profile of hyper-recursive trees	0	0.34	2022
Local and global degree profiles of randomly grown self-similar hooking networks under uniform and preferential attachment.	0	0.34	2019
Two-color balanced affine urn models with multiple drawings	2	0.47	2017
The Gini Index Of Random Trees With An Application To Caterpillars	0	0.34	2017
Degrees In Random Self-Similar Bipolar Networks	0	0.34	2016
Asymptotic Properties Of Protected Nodes In Random Recursive Trees	2	0.43	2015
JISC: Adaptive Stream Processing Using Just-In-Time State Completion.	1	0.36	2014
Survivors in Leader Election Algorithms.	2	0.43	2014
Exactly Solvable Balanced Tenable Urns with Random Entries via the Analytic Methodology	2	1.23	2012
Asymptotic distribution of two-protected nodes in random binary search trees.	5	0.73	2012
Phases in the Mixing of Gases via the Ehrenfest Urn Model.	0	0.34	2010
Distributional analysis of swaps in Quick Select	1	0.35	2010
Average-case Analysis of Moves in Quick Select.	1	0.39	2009
Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees	5	0.55	2008
A stochastic model for solitons	0	0.34	2004
Random sprouts as internet models, and Pólya processes	3	0.62	2004
Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees.	2	0.51	2004
Erratum: The size of random bucket trees via urn models	0	0.34	2004
The size of random bucket trees via urn models	6	0.82	2002
A Limit Law for Outputs in Random Recursive Circuits	3	0.68	2001
Probabilistic Analysis of MULTIPLE QUICK SELECT	7	0.74	1998
On rotations in fringe-balanced binary trees	5	0.53	1998
Analysis of Boyer-Moore-Horspool string-matching heuristic	9	0.65	1997
Storage Overhead of O-Trees, B-Trees and Prefix B-Trees: A Comparative Analysis	4	0.46	1996
The Joint Distribution of the Three Types of Nodes in Uniform Binary Trees	2	0.47	1995
Probabilistic analysis of bucket recursive trees	13	0.92	1995
Analysis of Quickselect: An Algorithm for Order Statistics	18	2.33	1995
The Joint Distribution of Elastic Buckets in Multiway Search Trees	8	0.85	1994
On The Structure Of Random Plane-Oriented Recursive Trees And Their Branches	28	32.19	1993
Asymptitic Hoint Normality of Outdegrees of Nodes in Random Recursive Trees	4	0.58	1992
Analysis of the space of search trees under the random insertion algorithm	23	1.93	1989
On the joint distribution of the insertion path length and the number of comparisons in search trees	8	1.04	1988
On the average internal path length of -ary search trees	11	1.31	1986
The Expected Distribution Of Degrees In Random Binary Search-Trees	8	1.72	1986