The following pages link to Hosam M. Mahmoud (Q221998):
Displaying 31 items.
- A SPECTRUM OF SERIES–PARALLEL GRAPHS WITH MULTIPLE EDGE EVOLUTION (Q5056627) (← links)
- The containment profile of hyper-recursive trees (Q5067223) (← links)
- A model for the spreading of fake news (Q5109505) (← links)
- DEGREE-BASED GINI INDEX FOR GRAPHS (Q5111478) (← links)
- Trees grown under young-age preferential attachment (Q5139910) (← links)
- A binomial splitting process in connection with corner parking problems (Q5176515) (← links)
- Average-case analysis of moves in Quick Select (Q5194662) (← links)
- Phases in the mixing of gases via the Ehrenfest urn model (Q5194673) (← links)
- The class of tenable zero-balanced Pólya urn schemes: characterization and Gaussian phases (Q5194697) (← links)
- Perpetuities in fair leader election algorithms (Q5194739) (← links)
- Survivors in Leader Election Algorithms (Q5194763) (← links)
- Asymptotic Properties of Protected Nodes in Random Recursive Trees (Q5252253) (← links)
- SOME PROPERTIES OF BINARY SERIES-PARALLEL GRAPHS (Q5349307) (← links)
- DEGREE PROFILE OF <i>m</i>-ARY SEARCH TREES: A VEHICLE FOR DATA STRUCTURE COMPRESSION (Q5358070) (← links)
- ON THE COMBINATORICS OF BINARY SERIES-PARALLEL GRAPHS (Q5358077) (← links)
- DEGREE PROFILE OF HIERARCHICAL LATTICE NETWORKS (Q5358105) (← links)
- BUILDING RANDOM TREES FROM BLOCKS (Q5413455) (← links)
- Perpetuities in Fair Leader Election Algorithms (Q5415100) (← links)
- ON CLIMBING TRIES (Q5450694) (← links)
- (Q5485347) (← links)
- STORAGE OVERHEAD OF O-TREES, B-TREES AND PREFIX B-TREES: A COMPARATIVE ANALYSIS (Q5687657) (← links)
- Corrigendum (Q5905371) (← links)
- Distribution of the size of random hash trees, pebbled hash trees and \(N\)-trees (Q5952094) (← links)
- Degrees in random <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>m</mml:mi></mml:math>-ary hooking networks (Q6050006) (← links)
- Covariances in Pólya urn schemes (Q6104948) (← links)
- Egorychev method: a hidden treasure (Q6140884) (← links)
- Balancing \(m\)-ary search trees with compressions on the fringe (Q6150114) (← links)
- Exact covariances and refined asymptotics in dichromatic tenable balanced Pólya urn schemes (Q6176164) (← links)
- On affine multi-color urns grown under multiple drawing (Q6526634) (← links)
- Correction to: ``Egorychev method: a hidden treasure'' (Q6611807) (← links)
- Affine diminishing urns (Q6633338) (← links)
